Quadrotor-UAV optimal coverage path planning in cluttered environment with a limited onboard energy

Abstract : In this paper, a quadrotor optimal coverage planning approach in damaged area is considered. The quadrotor is assumed to visit a set of reachable points following the shortest path while avoiding the no-fly zones. The problem is solved by using a two-scale proposed algorithm. In the first scale, an efficient tool for cluttered environments based on optimal Rapidly-exploring Random Trees (RRT) approach, called multi-RRT∗ Fixed Node (RRT∗FN), is developed to define the shortest paths from each point to their neighbors. Using the pair-wise costs between points provided by the first-scale algorithm, in the second scale, the overall shortest path is obtained by solving the Traveling Salesman Problem (TSP) using Genetic Algorithms (GA). Taking into consideration the limited onboard energy, a second alternative based on the well-known Vehicle Routing Problem (VRP) is used. This latter is solved using the savings heuristic approach. The effectiveness of this proposed two-scale algorithm is demonstrated through numerical simulations and promising results are obtained.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01716915
Contributor : Frédéric Davesne <>
Submitted on : Sunday, February 25, 2018 - 12:19:35 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

Yasser Bouzid, Yasmina Bestaoui, Houria Siguerdidjane. Quadrotor-UAV optimal coverage path planning in cluttered environment with a limited onboard energy. 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2017), Sep 2017, Vancouver, France. pp.979--984, ⟨10.1109/IROS.2017.8202264⟩. ⟨hal-01716915⟩

Share

Metrics

Record views

136