TY - GEN
T1 - Surveillance of Remote Targets by UAVs
AU - Huang, Hailong
AU - Savkin, Andrey V.
N1 - Funding Information:
*This work is supported by Australian Research Council. Also, this work received funding from the Australian Government, via grant AUS-MURIB000001 associated with ONR MURI grant N00014-19-1-2571.
Publisher Copyright:
© 2021 IEEE.
PY - 2021/11
Y1 - 2021/11
N2 - This paper considers using unmanned aerial vehicles (UAVs) to survey remote sites across a city. Suppose that a UAV can take public transportation vehicles (PTVs) like a passenger. Then, it may reach a site that is unreachable by flying only. Based on this UAV-PTV scheme, we investigate a task-UAV assignment problem. We formulate a mixed-integer linear programming (MILP) problem that minimizes the overall energy consumption of UAVs, subject to that every site is surveyed by a certain number of UAVs during a given time window. This problem is NP-hard, and we present a sub-optimal solution. It orders the surveillance tasks according to the time windows. Then, starting from the earliest task, it assigns the tasks one by one to UAVs. The comparison with the brute force method shows that the proposed solution can achieve competitive performance in a reasonable time.
AB - This paper considers using unmanned aerial vehicles (UAVs) to survey remote sites across a city. Suppose that a UAV can take public transportation vehicles (PTVs) like a passenger. Then, it may reach a site that is unreachable by flying only. Based on this UAV-PTV scheme, we investigate a task-UAV assignment problem. We formulate a mixed-integer linear programming (MILP) problem that minimizes the overall energy consumption of UAVs, subject to that every site is surveyed by a certain number of UAVs during a given time window. This problem is NP-hard, and we present a sub-optimal solution. It orders the surveillance tasks according to the time windows. Then, starting from the earliest task, it assigns the tasks one by one to UAVs. The comparison with the brute force method shows that the proposed solution can achieve competitive performance in a reasonable time.
UR - http://www.scopus.com/inward/record.url?scp=85123571046&partnerID=8YFLogxK
U2 - 10.1109/ANZCC53563.2021.9628281
DO - 10.1109/ANZCC53563.2021.9628281
M3 - Conference article published in proceeding or book
AN - SCOPUS:85123571046
T3 - 2021 Australian and New Zealand Control Conference, ANZCC 2021
SP - 222
EP - 225
BT - 2021 Australian and New Zealand Control Conference, ANZCC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 Australian and New Zealand Control Conference, ANZCC 2021
Y2 - 25 November 2021 through 26 November 2021
ER -
