Journal
ANNALS OF OPERATIONS RESEARCH
Volume 249, Issue 1-2, Pages 163-174Publisher
SPRINGER
DOI: 10.1007/s10479-016-2169-5
Keywords
Scheduling problem; Optimal replacement strategies; Perimeter guarding; Unmanned aerial vehicles
Categories
Funding
- EU FP7 project SHERPA [600958]
- Vinnova NFFP6 Project [2013-01206]
- Swedish Foundation for Strategic Research (CUAS Project)
- Swedish Research Council (VR) Linnaeus Center CADICS
- ELLIIT network organization for Information and Communication Technology
Ask authors/readers for more resources
Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available