Persistent coverage control for a team of agents with collision avoidance

Abstract In this paper, the idea of persistent coverage to be accomplished by multiple agents while avoiding collisions is considered and developed. The persistent coverage problem is formulated by assuming that the coverage degrades over time. In this framework, our contribution is a new distributed control law which is capable of carrying out the persistent coverage without computing agents׳ paths explicitly. The proposed setup considers agents with nonholonomic motion constraints and it is based on the combination of local and global strategies to achieve efficient coverage while avoiding bottlenecks such as local minima. The local strategy is based on the gradient of the coverage error in the neighborhood of an agent whereas the global strategy leads the agents to uncovered areas of the domain. Furthermore, we present a new bounded potential repulsion law and a proof of safe navigation is provided for the case of unicycle vehicles. We also propose a modification of the tangent-bug algorithm to deal with multiple non-point agents which allows the team to navigate in environments with non-convex obstacles in a reactive manner. Simulation results illustrate the performance of the proposed control law.

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

[2]  Javier Minguez,et al.  Nearness diagram (ND) navigation: collision avoidance in troublesome scenarios , 2004, IEEE Transactions on Robotics and Automation.

[3]  Sonal Jain,et al.  Multirobot Forest Coverage for Weighted and Unweighted Terrain , 2010, IEEE Transactions on Robotics.

[4]  Oliver Sawodny,et al.  Coverage Control with Information Decay in Dynamic Environments , 2008 .

[5]  Gonzalo López-Nicolás,et al.  Persistent coverage control with variable coverage action in multi-robot environment , 2013, 52nd IEEE Conference on Decision and Control.

[6]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[7]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[8]  Gonzalo López-Nicolás,et al.  Hierarchical strategy for dynamic coverage , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  George J. Vachtsevanos,et al.  Intelligent Control of Unmanned Aerial Vehicles for Improved Autonomy , 2007, Eur. J. Control.

[10]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[11]  Mac Schwager,et al.  Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments , 2011, IEEE Transactions on Robotics.

[12]  G. Dissanayake,et al.  A Force Field Method Based Multi-Robot Collaboration , 2006, 2006 IEEE Conference on Robotics, Automation and Mechatronics.

[13]  Dimos V. Dimarogonas,et al.  A feedback stabilization and collision avoidance scheme for multiple independent non-point agents, , 2006, Autom..

[14]  Christos G. Cassandras,et al.  Distributed Coverage Control and Data Collection With Mobile Sensor Networks , 2010, IEEE Transactions on Automatic Control.

[15]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[16]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

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

[18]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .

[19]  Dusan M. Stipanovic,et al.  On persistent coverage control , 2007, 2007 46th IEEE Conference on Decision and Control.

[20]  Arthur C. Sanderson,et al.  Robotic deployment of sensor networks using potential fields , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[21]  Nathan Michael,et al.  Vision-Based, Distributed Control Laws for Motion Coordination of Nonholonomic Robots , 2009, IEEE Transactions on Robotics.

[22]  Libor Preucil,et al.  Control and navigation in manoeuvres of formations of unmanned mobile vehicles , 2013, Eur. J. Control.

[23]  Mark W. Spong,et al.  Cooperative Avoidance Control for Multiagent Systems , 2007 .

[24]  Harley Flanders,et al.  Differentiation Under the Integral Sign , 1973 .

[25]  Chaomin Luo,et al.  Real-time path planning with deadlock avoidance of multiple cleaning robots , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[26]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[27]  Ehud Rivlin,et al.  TangentBug: A Range-Sensor-Based Navigation Algorithm , 1998, Int. J. Robotics Res..

[28]  Christos G. Cassandras,et al.  Sensor Networks and Cooperative Control , 2005, CDC 2005.

[29]  Roland Siegwart,et al.  Voronoi coverage of non-convex environments with a group of networked robots , 2010, 2010 IEEE International Conference on Robotics and Automation.

[30]  S. Hirche,et al.  Voronoi based coverage control with anisotropic sensors , 2008, 2008 American Control Conference.

[31]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[32]  R. Olfati-Saber,et al.  Collision avoidance for multiple agent systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).