Evolutionary Optimization-based Mission Planning for UAS Traffic Management (UTM)
Authors:
- 1 June 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 952-958
Abstract
In this work, we propose a route planning scheme for large scale Unmanned Aircraft System (UAS) or multiple-drone operations in complex urban air space. The route planning system consists of a path finding algorithm and a scheduling system for safe and efficient uses of airspace. The work flow of the system is: first, generate shortest paths between origination and destination points via heuristic search and second, schedule the submitted flights to avoid possible conflicts. The scheduling process is performed by Evolutionary Algorithm (EA). Such a system would postpone or delay flight requests that may collide with previous flights and reject the conflicted flights. We also propose a fitness function for the EA to minimize both the total delay of the flight requests and the possibility of UAS collision. To demonstrate the feasibility of the proposed route planning models, preliminary simulations in a local town in Singapore are presented and discussed.Keywords
This publication has 17 references indexed in Scilit:
- STAR: ultrafast universal RNA-seq alignerBioinformatics, 2012
- Unmanned aircraft systems: Surveillance, ethics and privacy in civil applicationsComputer Law & Security Review, 2012
- Definition of an airworthiness certification framework for civil unmanned aircraft systemsSafety Science, 2011
- On unmanned aircraft systems issues, challenges and operational restrictions preventing integration into the National Airspace SystemProgress in Aerospace Sciences, 2008
- Finding the k shortest simple pathsACM Transactions on Algorithms, 2007
- Evolutionary algorithm based offline/online path planner for uav navigationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2003
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- A fast tabu search algorithm for the permutation flow-shop problemEuropean Journal of Operational Research, 1996
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971
- On the Shortest Route Through a NetworkManagement Science, 1960