Title
Space-Time Low Complexity Algorithms for Scheduling a Fleet of UAVs in Smart Cities Using Dimensionality Reduction Approaches.
Abstract
In this paper, we propose three low complexity algorithms to solve a scheduling framework problem for Unmanned Aerial Vehicles (UAVs) in smart cities. The objective is to assign UAVs to different missions having different characteristics such as geographical locations, starting times, and duration while minimizing the total energy consumption and ensuring sequential and parallel mission execution. A mixed integer linear programming is formulated and solved using the proposed algorithms, which employ dimensionality reduction techniques to decrease the computational complexity. In this paper, we describe the UAV scheduling problem as well as the developed algorithms. Significant computational saving has been achieved with the different proposed algorithms. In the selected simulation results, we evaluate the advantages and limitations of the algorithms and compare their performances to the ones of the optimal branch-and-bound-based solution.
Year
DOI
Venue
2019
10.1109/SYSCON.2019.8836828
SysCon
Field
DocType
Citations 
Space time,Dimensionality reduction,Job shop scheduling,Scheduling (computing),Computer science,Algorithm,Integer programming,Energy consumption,Computational complexity theory
Conference
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Ahmed Bahabry101.01
Hakim Ghazzai218134.97
Gregg Vesonder324.29
Yehia Massoud421.76