Two-scale geometric path planning of quadrotor with obstacle avoidance: First step toward coverage algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

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.

Domains

Automatic
Fichier principal
Vignette du fichier
hal-01625850.pdf (702.06 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01625850 , version 1 (27-03-2020)

Identifiers

Cite

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⟩
96 View
111 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More