TY - JOUR
T1 - Uavs path planning under a bi-objective optimization framework for smart cities
AU - Saha, Subrata
AU - Vasegaard, Alex Elkjær
AU - Nielsen, Izabela
AU - Hapka, Aneta
AU - Budzisz, Henryk
N1 - Publisher Copyright:
© 2021 by the authors. Licensee MDPI, Basel, Switzerland.
PY - 2021/5/2
Y1 - 2021/5/2
N2 - Unmanned aerial vehicles (UAVs) have been used extensively for search and rescue opera-tions, surveillance, disaster monitoring, attacking terrorists, etc. due to their growing advantages of low-cost, high maneuverability, and easy deployability. This study proposes a mixed-integer programming model under a multi-objective optimization framework to design trajectories that enable a set of UAVs to execute surveillance tasks. The first objective maximizes the cumulative probability of target detection to aim for mission planning success. The second objective ensures minimization of cumulative path length to provide a higher resource utilization goal. A two-step variable neighborhood search (VNS) algorithm is offered, which addresses the combinatorial optimization issue for determining the near-optimal sequence for cell visiting to reach the target. Numerical experiments and simulation results are evaluated in numerous benchmark instances. Results demonstrate that the proposed approach can favorably support practical deployability purposes.
AB - Unmanned aerial vehicles (UAVs) have been used extensively for search and rescue opera-tions, surveillance, disaster monitoring, attacking terrorists, etc. due to their growing advantages of low-cost, high maneuverability, and easy deployability. This study proposes a mixed-integer programming model under a multi-objective optimization framework to design trajectories that enable a set of UAVs to execute surveillance tasks. The first objective maximizes the cumulative probability of target detection to aim for mission planning success. The second objective ensures minimization of cumulative path length to provide a higher resource utilization goal. A two-step variable neighborhood search (VNS) algorithm is offered, which addresses the combinatorial optimization issue for determining the near-optimal sequence for cell visiting to reach the target. Numerical experiments and simulation results are evaluated in numerous benchmark instances. Results demonstrate that the proposed approach can favorably support practical deployability purposes.
KW - GLPK
KW - Integer programming
KW - Multi-objective optimization
KW - Search and rescue
KW - Unmanned aerial vehicles (UAVs)
KW - Variable neighborhood search
UR - http://www.scopus.com/inward/record.url?scp=85105813688&partnerID=8YFLogxK
U2 - 10.3390/electronics10101193
DO - 10.3390/electronics10101193
M3 - Journal article
AN - SCOPUS:85105813688
VL - 10
JO - Electronics
JF - Electronics
SN - 2079-9292
IS - 10
M1 - 1193
ER -