Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles
Abstract: 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.
Keywords: scheduling problem; optimal replacement strategies; perimeter guarding; unmanned aerial vehicles.
Category 1: Applications -- OR and Management Sciences (Scheduling )
Category 2: Applications -- Science and Engineering (Civil and Environmental Engineering )
Category 3: Global Optimization
Citation: Technical Report LiTH-MAT-R–2014/09–SE, Department of Mathematics, Linkoping University, Sweden, August/2014
Entry Submitted: 10/02/2014
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|