Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles

DOI10.1007/S10479-016-2169-5zbMATH Open1357.90050OpenAlexW1573764064MaRDI QIDQ513626FDOQ513626

Authors: Jonas Kvarnström, Patrick Doherty, Oleg 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

Recommendations

• Towards optimal positioning of surveillance UGVs
• scientific article
• Cyclic routing of unmanned aerial vehicles
• Cyclic-routing of unmanned aerial vehicles
• Modelling the mobile target covering problem using flying drones

zbMATH Keywords

scheduling problemunmanned aerial vehiclesoptimal replacement strategiesperimeter guarding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Introduction to algorithms.
• Searching for a Mobile Intruder in a Polygonal Region
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Coverage for robotics -- a survey of recent results
• Solving the aerial fleet refueling problem using group theoretic tabu search
• Stochastic optimization of sensor placement for diver detection
• Title not available (Why is that?)

Cited In (2)

• Towards optimal positioning of surveillance UGVs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513626)