TY  - Type of reference 
TI  - Flight plan optimization of a UAV making a Hamiltonian cycle between N measurement points; Traveler problem and battery lifetime 
AU  - Mohamed Abdessamia Chakchouk 
AU  - Abdelkhalak El Hami 
AU  - Pierre Richard Dahoo 
AU  - Azzedine Lakhlifi 
AU  - Wajih Gafsi 
AU  - Mohamed Haddar 
AB  - 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. 
DO  - 10.21494/ISTE.OP.2022.0806 
JF  - Uncertainties and Reliability of Multiphysical Systems 
KW  - Commercial traveler problem,  monte carlo,  markov chain,  batteries lifetime,  flight plan,  Optimization, Problème du voyageur de commerce,  monte Carlo,  chaine de Markov,  batteries durées de vie,  plan de vol,  Optimisation,  
L1  - https://openscience.fr/IMG/pdf/iste_incertfia22v6n1_1.pdf 
LA  - en 
PB  - ISTE OpenScience 
DA  - 2022/02/17 
SN  - 2514-569X 
TT  - 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 
UR  - https://openscience.fr/Flight-plan-optimization-of-a-UAV-making-a-Hamiltonian-cycle-between-N 
IS  - Issue 1 
VL  - 6 
ER  -