On persistent coverage control

In this paper we address the problem of persistent coverage of a given convex polygonal region in the plane. We present an algorithmic solution for this problem that takes into account the limitations in the communication and sensing ranges of the agents. We show that our algorithm provides a persistent coverage period that is bounded away by a constant factor from a minimal tour among the centers of an optimal static cover, which is comprised of circles having the same radius as the sensing radius of the agents. A simulation is provided that illustrates the algorithm.

[1]  Dusan M. Stipanovic,et al.  Effective Coverage Control for Mobile Sensor Networks With Guaranteed Collision Avoidance , 2007, IEEE Transactions on Control Systems Technology.

[2]  Wei Li,et al.  Distributed Cooperative coverage Control of Sensor Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[3]  Devin J. Balkcom,et al.  Time optimal trajectories for bounded velocity differential drive robots , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[4]  Jorge Cortés.  Finite-time convergent gradient flowswith applications to motion coordination ? , .

[5]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[6]  F. Bullo,et al.  On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity , 2005, IEEE Transactions on Automatic Control.

[7]  Emilio Frazzoli,et al.  On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  A. Ollero,et al.  Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms , 2004, DARS.

[9]  P.F. Hokayem,et al.  Dynamic Coverage Control with Limited Communication , 2007, 2007 American Control Conference.

[10]  Jose B. Cruz,et al.  Coordinating networked uninhabited air vehicles for persistent area denial , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[11]  I.I. Hussein,et al.  Effective Coverage Control using Dynamic Sensor Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[12]  Zhihua Qu,et al.  Coverage control for a mobile robot patrolling a dynamic and uncertain environment , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[13]  Jorge Cortés,et al.  Finite-time convergent gradient flows with applications to network consensus , 2006, Autom..

[14]  Emilio Frazzoli,et al.  On synchronous robotic networks Part I: Models, tasks and complexity notions , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[15]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[16]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[17]  Howie Choset,et al.  Towards optimal coverage of 2-dimensional surfaces embedded in IR/sup 3/: choice of start curve , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[18]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.