Journal
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING
Volume 233, Issue 14, Pages 5347-5359Publisher
SAGE PUBLICATIONS LTD
DOI: 10.1177/0954410019842487
Keywords
Unmanned aerial vehicle; aerial recovery; scheduling; genetic algorithm
Categories
Ask authors/readers for more resources
The ability to deploy multiple unmanned aerial vehicles expands their application range, but aerial recovery of unmanned aerial vehicles presents many unique challenges owing to the number of unmanned aerial vehicles and the limited recovery time. In this paper, scheduling the aerial recovery of multiple unmanned aerial vehicles by one mothership is posed as a combinatorial optimization problem. A mathematical model with recovery time windows of the unmanned aerial vehicles is developed to formulate this problem. Furthermore, a genetic algorithm is proposed for finding the optimal recovery sequence. The algorithm adopts the path representation of chromosomes to simplify the encoding process and the genetic operations. It also resolves decoding difficulties by iteration, and thus can efficiently generate a recovery timetable for the unmanned aerial vehicles. Simulation results in stochastic scenarios validate the performance of the proposed algorithm compared with the random search algorithm and the greedy algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available