From d58d5e1baf9390d4119f48c4af3fbcf308da10a3 Mon Sep 17 00:00:00 2001
From: 826220679@qq.com <826220679@qq.com>
Date: 星期六, 27 十二月 2025 22:46:10 +0800
Subject: [PATCH] 进一步优化了异形无障碍物路径规划算法
---
src/lujing/YixinglujingNoObstacle.java | 55 +++++++++++++++++++++++++++++++++++++++++++------------
1 files changed, 43 insertions(+), 12 deletions(-)
diff --git a/src/lujing/YixinglujingNoObstacle.java b/src/lujing/YixinglujingNoObstacle.java
index 304a3bc..bdda587 100644
--- a/src/lujing/YixinglujingNoObstacle.java
+++ b/src/lujing/YixinglujingNoObstacle.java
@@ -71,6 +71,20 @@
}
private static List<PathSegment> generateGlobalScanPath(List<Point> polygon, double width, double angle, Point currentPos) {
+ // 鍏堝皾璇曞皢鍑归櫡澶勮涓轰袱涓嫭绔嬪尯鍩燂紝鍒嗕袱娆℃壂鎻忥紝閬垮厤璺ㄥ尯鐩寸嚎杩炴帴
+ List<PathSegment> all = new ArrayList<>();
+ // 绗竴娆℃壂鎻忥細浼樺厛澶勭悊宸︿晶鍖哄煙锛坓roupIndex=0锛�
+ List<PathSegment> leftScan = generateScanPathForSide(polygon, width, angle, currentPos, 0);
+ all.addAll(leftScan);
+ Point posAfterLeft = leftScan.isEmpty() ? currentPos : leftScan.get(leftScan.size() - 1).end;
+ // 绗簩娆℃壂鎻忥細澶勭悊鍙充晶鍖哄煙锛坓roupIndex=1锛夛紝浠庡乏渚х粨鏉熺偣娌胯竟鐣屽埌鍙充晶棣栨
+ List<PathSegment> rightScan = generateScanPathForSide(polygon, width, angle, posAfterLeft, 1);
+ all.addAll(rightScan);
+ return all;
+ }
+
+ // 浠呮壂鎻忔寚瀹氫晶锛堝悓涓�鏉℃壂鎻忕嚎鐨勭 groupIndex 娈碉級锛岀敤浜庡皢鈥滆�虫湹鈥濊涓虹嫭绔嬪尯鍩�
+ private static List<PathSegment> generateScanPathForSide(List<Point> polygon, double width, double angle, Point currentPos, int sideIndex) {
List<PathSegment> segments = new ArrayList<>();
List<Point> rotatedPoly = new ArrayList<>();
for (Point p : polygon) rotatedPoly.add(rotatePoint(p, -angle));
@@ -82,37 +96,46 @@
}
boolean leftToRight = true;
- // 姝ラ暱 y 浠庢渶灏忓埌鏈�澶ф壂鎻�
+ boolean firstSegmentConnected = false;
+
for (double y = minY + width/2; y <= maxY - width/2; y += width) {
List<Double> xIntersections = getXIntersections(rotatedPoly, y);
if (xIntersections.size() < 2) continue;
Collections.sort(xIntersections);
- // 澶勭悊鍑瑰杈瑰舰锛氭瘡涓や釜鐐圭粍鎴愪竴涓湁鏁堜綔涓氭
+ // 鏋勫缓鏈鐨勪綔涓氭锛堝乏鍒板彸锛夊拰缁勭储寮�
List<PathSegment> lineSegmentsInRow = new ArrayList<>();
- for (int i = 0; i < xIntersections.size() - 1; i += 2) {
+ List<Integer> groupIndices = new ArrayList<>();
+ for (int i = 0, g = 0; i < xIntersections.size() - 1; i += 2, g++) {
Point pS = rotatePoint(new Point(xIntersections.get(i), y), angle);
Point pE = rotatePoint(new Point(xIntersections.get(i + 1), y), angle);
lineSegmentsInRow.add(new PathSegment(pS, pE, true));
+ groupIndices.add(g);
}
- // 鏍规嵁褰撳墠S鍨嬫柟鍚戞帓搴忎綔涓氭
if (!leftToRight) {
Collections.reverse(lineSegmentsInRow);
+ Collections.reverse(groupIndices);
for (PathSegment s : lineSegmentsInRow) {
Point temp = s.start; s.start = s.end; s.end = temp;
}
}
- // 灏嗕綔涓氭杩炴帴鍒版�昏矾寰�
- for (PathSegment s : lineSegmentsInRow) {
- if (Math.hypot(currentPos.x - s.start.x, currentPos.y - s.start.y) > 0.01) {
- // 濡傛灉闂磋窛澶т簬1cm锛屾坊鍔犵┖璧拌矾寰�
- addSafeConnection(segments, currentPos, s.start, polygon);
- }
- segments.add(s);
- currentPos = s.end;
+ int idxInRow = groupIndices.indexOf(sideIndex);
+ if (idxInRow == -1) {
+ // 鏈涓嶅寘鍚渚х殑浣滀笟娈碉紝璺宠繃
+ leftToRight = !leftToRight;
+ continue;
}
+
+ PathSegment s = lineSegmentsInRow.get(idxInRow);
+ // 棣栨杩炴帴鎴栬法鍖鸿繛鎺ュ潎寮哄埗娌胯竟鐣岋紝閬垮厤绌胯秺鍑归櫡鍖�
+ if (Math.hypot(currentPos.x - s.start.x, currentPos.y - s.start.y) > 0.01) {
+ addBoundaryConnection(segments, currentPos, s.start, polygon);
+ firstSegmentConnected = true;
+ }
+ segments.add(s);
+ currentPos = s.end;
leftToRight = !leftToRight;
}
return segments;
@@ -245,6 +268,14 @@
}
}
+ // 寮哄埗娌胯竟鐣岀粫琛岀殑杩炴帴锛堜笉鍋氱洿绾垮畨鍏ㄥ垽鏂級锛岀敤鏉ュ湪鍚屼竴鎵弿琛岀殑澶氫釜浣滀笟娈典箣闂磋烦杞�
+ private static void addBoundaryConnection(List<PathSegment> segments, Point start, Point end, List<Point> polygon) {
+ List<Point> path = getBoundaryPath(start, end, polygon);
+ for (int i = 0; i < path.size() - 1; i++) {
+ segments.add(new PathSegment(path.get(i), path.get(i+1), false));
+ }
+ }
+
private static boolean isSegmentSafe(Point p1, Point p2, List<Point> polygon) {
Point mid = new Point((p1.x + p2.x) / 2, (p1.y + p2.y) / 2);
if (!isPointInPolygon(mid, polygon)) return false;
--
Gitblit v1.10.0