Sciweavers

Share
CORR
2011
Springer

On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms

8 years 3 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work 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 we 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 ...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where CORR
Authors Fabio Pasqualetti, Antonio Franchi, Francesco Bullo
Comments (0)
books