Towards Decentralization of Multi-robot Navigation Functions

We present a navigation function through which a group of mobile agents can be coordinated to achieve a particular formation, both in terms of shape and orientation, while avoiding collisions between themselves and with obstacles in the environment. Convergence is global and complete, subject to the constraints of the navigation function methodology. Algebraic graph theoretic properties associated with the interconnection graph are shown to affect the shape of the navigation function. The approach is centralized but the potential function is constructed in a way that facilitates complete decentralization. The strategy presented will also serve as a point of reference and comparison in quantifying the cost of decentralization in terms of performance.

[1]  Richard M. Murray,et al.  Flocking with obstacle avoidance: cooperation with limited communication in mobile networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  R. Sandoval-Rodriguez,et al.  Internet-like protocols for the control and coordination of multiple agents with time delay , 2003, Proceedings of the 2003 IEEE International Symposium on Intelligent Control.

[3]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[4]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[5]  J.P. Hespanha,et al.  Cooperative radar jamming for groups of unmanned air vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[6]  Dimos V. Dimarogonas,et al.  Decentralized motion control of multiple holonomic agents under input constraints , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  Kostas J. Kyriakopoulos,et al.  Closed loop navigation for multiple holonomic vehicles , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  Randal W. Beard,et al.  Decentralized Scheme for Spacecraft Formation Flying via the Virtual Structure Approach , 2004 .

[9]  Marios M. Polycarpou,et al.  Stability analysis of M-dimensional asynchronous swarms with a fixed communication topology , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[10]  D. Koditschek,et al.  Robot navigation functions on manifolds with boundary , 1990 .

[11]  Herbert G. Tanner.  Flocking with obstacle avoidance in switching networks of interconnected vehicles , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[12]  Randal W. Beard,et al.  A decentralized scheme for spacecraft formation flying via the virtual structure approach , 2003, Proceedings of the 2003 American Control Conference, 2003..

[13]  Naomi Ehrich Leonard,et al.  Virtual leaders, artificial potentials and coordinated control of groups , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[14]  Kostas J. Kyriakopoulos,et al.  Nonholonomic navigation and control of cooperating mobile manipulators , 2003, IEEE Trans. Robotics Autom..

[15]  Vijay Kumar,et al.  Leader-to-formation stability , 2004, IEEE Transactions on Robotics and Automation.

[16]  George J. Pappas,et al.  Stable flocking of mobile agents, part I: fixed topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[17]  Petter Ögren,et al.  Obstacle avoidance in formation , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[18]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[19]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.