UAV survey coverage path planning of complex regions containing exclusion zones
Shadman Tajwar Shahid, Shah Md. Ahasan Siddique, Md. Mahidul Alam

TL;DR
This paper presents a novel UAV coverage path planning method for complex regions with exclusion zones, utilizing polygon decomposition, merging, and offset techniques to ensure safe and efficient survey routes.
Contribution
It introduces a comprehensive approach combining polygon decomposition, merging, and offsetting to handle complex survey regions with obstacles, improving UAV path planning accuracy.
Findings
Successfully manages complex polygons with holes and obstacles.
Generates continuous coverage paths with safety margins.
Enhances UAV survey efficiency in intricate environments.
Abstract
This article addresses the challenge of UAV survey coverage path planning for areas that are complex concave polygons, containing exclusion zones or obstacles. While standard drone path planners typically generate coverage paths for simple convex polygons, this study proposes a method to manage more intricate regions, including boundary splits, merges, and interior holes. To achieve this, polygonal decomposition techniques are used to partition the target area into convex sub-regions. The sub-polygons are then merged using a depth-first search algorithm, followed by the generation of continuous Boustrophedon paths based on connected components. Polygonal offset by the straight skeleton method was used to ensure a constant safe distance from the exclusion zones. This approach allows UAV path planning in environments with complex geometric constraints.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · UAV Applications and Optimization
