On the continuous coverage problem for a swarm of UAVs

Hazim Shakhatreh, Abdallah Khreishah, Jacob Chakareski, Haythem Bany Salameh, Issa Khalil

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited battery capacity. We study the problem of minimizing the number of UAVs required for a continuous coverage of a given area, given the recharging requirement. We prove that this problem is NP-complete. Due to its intractability, we study partitioning the coverage graph into cycles that start at the charging station. We first characterize the minimum number of UAVs to cover such a cycle based on the charging time, the traveling time, and the number of subareas to be covered by the cycle. Based on this analysis, we then develop an efficient algorithm, the cycles with limited energy algorithm. The straightforward method to continuously cover a given area is to split it into N subareas and cover it by N cycles using N additional UAVs. Our simulation results examine the importance of critical system parameters: the energy capacity of the UAVs, the number of subareas in the covered area, and the UAV charging and traveling times. We demonstrate that the cycles with limited energy algorithm requires 69%-94% fewer additional UAVs relative to the straightforward method, as the energy capacity of the UAVs is increased, and 67%-71% fewer additional UAVs, as the number of subareas is increased.

Original languageEnglish
Title of host publication37th IEEE Sarnoff Symposium, Sarnoff 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages130-135
Number of pages6
ISBN (Electronic)9781509015405
DOIs
Publication statusPublished - 7 Feb 2017
Event37th IEEE Sarnoff Symposium, Sarnoff 2016 - Newark, United States
Duration: 19 Sep 201621 Sep 2016

Other

Other37th IEEE Sarnoff Symposium, Sarnoff 2016
CountryUnited States
CityNewark
Period19/9/1621/9/16

Fingerprint

Unmanned aerial vehicles (UAV)
Disasters
Computational complexity
Wireless networks

Keywords

  • charging
  • continuous coverage
  • Unmanned aerial vehicles

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Shakhatreh, H., Khreishah, A., Chakareski, J., Salameh, H. B., & Khalil, I. (2017). On the continuous coverage problem for a swarm of UAVs. In 37th IEEE Sarnoff Symposium, Sarnoff 2016 (pp. 130-135). [7846742] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SARNOF.2016.7846742

On the continuous coverage problem for a swarm of UAVs. / Shakhatreh, Hazim; Khreishah, Abdallah; Chakareski, Jacob; Salameh, Haythem Bany; Khalil, Issa.

37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 130-135 7846742.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakhatreh, H, Khreishah, A, Chakareski, J, Salameh, HB & Khalil, I 2017, On the continuous coverage problem for a swarm of UAVs. in 37th IEEE Sarnoff Symposium, Sarnoff 2016., 7846742, Institute of Electrical and Electronics Engineers Inc., pp. 130-135, 37th IEEE Sarnoff Symposium, Sarnoff 2016, Newark, United States, 19/9/16. https://doi.org/10.1109/SARNOF.2016.7846742
Shakhatreh H, Khreishah A, Chakareski J, Salameh HB, Khalil I. On the continuous coverage problem for a swarm of UAVs. In 37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 130-135. 7846742 https://doi.org/10.1109/SARNOF.2016.7846742
Shakhatreh, Hazim ; Khreishah, Abdallah ; Chakareski, Jacob ; Salameh, Haythem Bany ; Khalil, Issa. / On the continuous coverage problem for a swarm of UAVs. 37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 130-135
@inproceedings{450f96c0093d4075b671f6c0f7ae8f6f,
title = "On the continuous coverage problem for a swarm of UAVs",
abstract = "Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited battery capacity. We study the problem of minimizing the number of UAVs required for a continuous coverage of a given area, given the recharging requirement. We prove that this problem is NP-complete. Due to its intractability, we study partitioning the coverage graph into cycles that start at the charging station. We first characterize the minimum number of UAVs to cover such a cycle based on the charging time, the traveling time, and the number of subareas to be covered by the cycle. Based on this analysis, we then develop an efficient algorithm, the cycles with limited energy algorithm. The straightforward method to continuously cover a given area is to split it into N subareas and cover it by N cycles using N additional UAVs. Our simulation results examine the importance of critical system parameters: the energy capacity of the UAVs, the number of subareas in the covered area, and the UAV charging and traveling times. We demonstrate that the cycles with limited energy algorithm requires 69{\%}-94{\%} fewer additional UAVs relative to the straightforward method, as the energy capacity of the UAVs is increased, and 67{\%}-71{\%} fewer additional UAVs, as the number of subareas is increased.",
keywords = "charging, continuous coverage, Unmanned aerial vehicles",
author = "Hazim Shakhatreh and Abdallah Khreishah and Jacob Chakareski and Salameh, {Haythem Bany} and Issa Khalil",
year = "2017",
month = "2",
day = "7",
doi = "10.1109/SARNOF.2016.7846742",
language = "English",
pages = "130--135",
booktitle = "37th IEEE Sarnoff Symposium, Sarnoff 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - On the continuous coverage problem for a swarm of UAVs

AU - Shakhatreh, Hazim

AU - Khreishah, Abdallah

AU - Chakareski, Jacob

AU - Salameh, Haythem Bany

AU - Khalil, Issa

PY - 2017/2/7

Y1 - 2017/2/7

N2 - Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited battery capacity. We study the problem of minimizing the number of UAVs required for a continuous coverage of a given area, given the recharging requirement. We prove that this problem is NP-complete. Due to its intractability, we study partitioning the coverage graph into cycles that start at the charging station. We first characterize the minimum number of UAVs to cover such a cycle based on the charging time, the traveling time, and the number of subareas to be covered by the cycle. Based on this analysis, we then develop an efficient algorithm, the cycles with limited energy algorithm. The straightforward method to continuously cover a given area is to split it into N subareas and cover it by N cycles using N additional UAVs. Our simulation results examine the importance of critical system parameters: the energy capacity of the UAVs, the number of subareas in the covered area, and the UAV charging and traveling times. We demonstrate that the cycles with limited energy algorithm requires 69%-94% fewer additional UAVs relative to the straightforward method, as the energy capacity of the UAVs is increased, and 67%-71% fewer additional UAVs, as the number of subareas is increased.

AB - Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited battery capacity. We study the problem of minimizing the number of UAVs required for a continuous coverage of a given area, given the recharging requirement. We prove that this problem is NP-complete. Due to its intractability, we study partitioning the coverage graph into cycles that start at the charging station. We first characterize the minimum number of UAVs to cover such a cycle based on the charging time, the traveling time, and the number of subareas to be covered by the cycle. Based on this analysis, we then develop an efficient algorithm, the cycles with limited energy algorithm. The straightforward method to continuously cover a given area is to split it into N subareas and cover it by N cycles using N additional UAVs. Our simulation results examine the importance of critical system parameters: the energy capacity of the UAVs, the number of subareas in the covered area, and the UAV charging and traveling times. We demonstrate that the cycles with limited energy algorithm requires 69%-94% fewer additional UAVs relative to the straightforward method, as the energy capacity of the UAVs is increased, and 67%-71% fewer additional UAVs, as the number of subareas is increased.

KW - charging

KW - continuous coverage

KW - Unmanned aerial vehicles

UR - http://www.scopus.com/inward/record.url?scp=85015186896&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015186896&partnerID=8YFLogxK

U2 - 10.1109/SARNOF.2016.7846742

DO - 10.1109/SARNOF.2016.7846742

M3 - Conference contribution

SP - 130

EP - 135

BT - 37th IEEE Sarnoff Symposium, Sarnoff 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -