HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Optimisation de plan de vol d'un drone faisant un cycle hamiltonien entre N points de mesures ; Problème du voyageur de commerce et durée de vie de batterie

Abstract : Cover path planning is a fascinating area of study for roboticists, with many studies available in the research literature. During the trajectory planning phase. Since energy consumption is a function of the trajectory it will take, the energy consumption problem will be partially converted to a trajectory optimization problem. For the first phase, we will compress the problem into a 2d design, which is known as the "traveling salesman problem". There is no known method for solving the "traveling salesman problem" that provides accurate answers in a reasonable amount of time for large cases (a large number of cities). Due to the combinatorial explosion, we will often have to make do with approximate solutions for these huge situations. In this paper we will show a heuristic and make a numerical simulation of the flight plan and then characterize the effect of this optimization on the flight time.
Document type :
Journal articles
Complete list of metadata

https://hal-insu.archives-ouvertes.fr/insu-03602789
Contributor : Catherine Cardon Connect in order to contact the contributor
Submitted on : Wednesday, March 9, 2022 - 1:34:26 PM
Last modification on : Friday, March 11, 2022 - 3:26:57 AM

File

iste_incertfia22v6n1_1.pdf
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Mohamed Chakchouk, Abdelkhalak El Hami, Pierre-Richard Dahoo, Azzedine Lakhlifi, Wajih Gafsi, et al.. Optimisation de plan de vol d'un drone faisant un cycle hamiltonien entre N points de mesures ; Problème du voyageur de commerce et durée de vie de batterie. Uncertainties and Reliability of Multiphysical Systems, ISTE OpenScience, 2022, 6 (1), 7p. ⟨10.21494/ISTE.OP.2022.0806⟩. ⟨insu-03602789⟩

Share

Metrics

Record views

32

Files downloads

13