Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles

DOI10.1007/s10479-016-2169-5zbMath1357.90050OpenAlexW1573764064MaRDI QIDQ513626

Patrick Doherty, Jonas Kvarnström, Oleg P. Burdakov

Publication date: 7 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-109607

zbMATH Keywords

scheduling problemunmanned aerial vehiclesoptimal replacement strategiesperimeter guarding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the aerial fleet refueling problem using group theoretic tabu search
• Coverage for robotics -- a survey of recent results
• Stochastic Optimization of Sensor Placement for Diver Detection
• Searching for a Mobile Intruder in a Polygonal Region

This page was built for publication: Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles