de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons83915

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Pasqualetti, F., Franchi, A., & Bullo, F. (2012). On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms. IEEE Transaction on Robotics, 28(3), 592-606. doi:10.1109/TRO.2011.2179580.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-B720-8
Abstract
The subject of this paper is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal properties and of distributed control laws converging to optimal trajectories. As performance criteria, the refresh time and the latency are considered, i.e., respectively, time gap between any two visits of the same region and the time necessary to inform every agent about an event occurred in the environment. We associate a graph with the environment, and we study separately the case of a chain, tree, and cyclic graph. For the case of chain graph, we first describe a minimum refresh time and latency team trajectory and propose a polynomial time algorithm for its computation. Then, we describe a distributed procedure that steers the robots toward an optimal trajectory. For the case of tree graph, a polynomial time algorithm is developed for the minimum refresh time problem, under the technical assumption of a constant number of robots involved in the patrolling task. Finally, we show that the design of a minimum refresh time trajectory for a cyclic graph is NP-hard, and we develop a constant factor approximation algorithm.