UAV survey coverage path planning of complex regions containing exclusion zones
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929589482160128 |
|---|---|
| author | Shahid, Shadman Tajwar Siddique, Shah Md. Ahasan Alam, Md. Mahidul |
| author_facet | Shahid, Shadman Tajwar Siddique, Shah Md. Ahasan Alam, Md. Mahidul |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07053 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | UAV survey coverage path planning of complex regions containing exclusion zones Shahid, Shadman Tajwar Siddique, Shah Md. Ahasan Alam, Md. Mahidul Robotics Computational Geometry 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. |
| title | UAV survey coverage path planning of complex regions containing exclusion zones |
| topic | Robotics Computational Geometry |
| url | https://arxiv.org/abs/2411.07053 |