| Autor: |
Lexu Du, Yankai Fan, Mingzhen Gui, Dangjun Zhao |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Drones, Vol 7, Iss 12, p 692 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2504-446X |
| DOI: |
10.3390/drones7120692 |
| Popis: |
This study focuses on the path-planning problem of rescue UAVs with regional detection priority. Initially, we propose a mixed-integer programming model that integrates coverage path planning (CPP) and the hierarchical traveling salesman problem (HTSP) to address multi-regional path planning under priority constraints. For intra-regional path planning, we present an enhanced method for acquiring reciprocating flight paths to ensure complete coverage of convex polygonal regions with shorter flight paths when a UAV is equipped with sensors featuring circular sampling ranges. An additional comparison was made for spiral flight paths, and second-order Bezier curves were employed to optimize both sets of paths. This optimization not only reduced the path length but also enhanced the ability to counteract inherent drone jitter. Additionally, we propose a variable neighborhood descent algorithm based on K-nearest neighbors to solve the inter-regional access order path-planning problem with priority. We establish parameters for measuring distance and evaluating the priority order of UAV flight paths. Simulation and experiment results demonstrate that the proposed algorithm can effectively assist UAVs in performing path-planning tasks with priority constraints, enabling faster information collection in important areas and facilitating quick exploration of three-dimensional characteristics in unknown disaster areas by rescue workers. This algorithm significantly enhances the safety of rescue workers and optimizes crucial rescue times in key areas. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
