English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On optimal cooperative patrolling

MPS-Authors
/persons/resource/persons83915

Franchi,  A
Department Human Perception, Cognition and Action, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5717873
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Pasqualetti, F., Franchi, A., & Bullo, F. (2010). On optimal cooperative patrolling. In 49th IEEE Conference on Decision and Control (CDC 2010) (pp. 7153-7158). Piscataway, NJ, USA: IEEE.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-BD36-4
Abstract
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. In both civil and military applications it is of increasing importance
to instruct a team of autonomous agents to accomplish
repetitive tasks, such as the monitoring of strategic regions
or the detection of life threatening situations. As performance
criterion for optimal patrolling we minimize the worst-case time
gap between any two visits of an environment location. We
characterize the computational complexity of the trajectory
design (patrolling) problem with respect to the environment
topology and to the number of robots to be employed in
the surveillance task. Even though the patrolling problem is
generally NP-hard, we identify particular cases that are solvable
efficiently, and we describe optimal patrolling trajectories.
Finally, we present a heuristic with performance guarantee, and
an 8-approximation algorithm to solve the NP-hard patrolling
problem.