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

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

2011-01-20

arxiv.org/abs/1101.3973v3

Mathematics

Combinatorics

Preprint submitted to IEEE Transaction on Robotics

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334375