Optimal Scheduling for Replacing Perimeter Guarding Unmanned Aerial Vehicles
2016 (English)Report (Other academic)
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.
Place, publisher, year, edition, pages
Linköping University Electronic Press, 2016. , 16 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2014:09
scheduling problem; optimal replacement strategies; perimeter guarding; unmanned aerial vehicles
Computational Mathematics Computer Vision and Robotics (Autonomous Systems)
IdentifiersURN: urn:nbn:se:liu:diva-109607ISRN: LiTH-MAT-R--2014/09--SEOAI: oai:DiVA.org:liu-109607DiVA: diva2:739489