Two-scale geometric path planning of quadrotor with obstacle avoidance: First step toward coverage algorithm

Abstract : In this paper, a quadrotor path-planning problem while avoiding obstacles, in different shapes and sizes, is considered. The quadrotor is assumed to pass by a set of scattered points or regions defined according to the desired mission following the shortest path. The problem is solved by using a two-scale proposed algorithm. In the first scale, multi-directional optimal Rapidly-exploring Random Trees (RRT) based algorithm is used to define the shortest paths from each point to its neighbors. By means of the inter-costs provides 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). The effectiveness of the proposed algorithm is verified with numerical simulations.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01625850
Contributor : Frédéric Davesne <>
Submitted on : Sunday, October 29, 2017 - 2:57:53 PM
Last modification on : Wednesday, January 23, 2019 - 1:48:04 PM

Identifiers

Citation

Yasser Bouzid, Yasmina Bestaoui, Houria Siguerdidjane. Two-scale geometric path planning of quadrotor with obstacle avoidance: First step toward coverage algorithm. 11th International Workshop on Robot Motion and Control (RoMoCo 2017), Jul 2017, Wasowo, Poland. pp.166--171, ⟨10.1109/RoMoCo.2017.8003909⟩. ⟨hal-01625850⟩

Share

Metrics

Record views

134