Distributed deployment of asynchronous guards in art galleries

This paper presents deployment algorithms for multiple mobile robots with line-of-sight sensing and communication capabilities in a simple nonconvex polygonal environment. The objective of the proposed algorithms is to achieve full visibility of the environment. We solve the problem by constructing a novel data structure called the vertex-induced tree and designing schemes to deploy over the nodes of this tree by means of distributed algorithms. The agents are assumed to have access to a local memory and their operation is partially asynchronous

[1]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[2]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[3]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[4]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  J. Baillieul,et al.  Stochastic Strategies for Autonomous Robotic Surveillance , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[8]  Steven M. LaValle,et al.  Pursuit-evasion in an unknown environment using gap navigation trees , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[9]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.