Rendezvous without coordinates

We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presence of another agent within some sector of its windshield. Using a very simple quantized control law with three values, each agent tracks another agent assigned to it by maintaining that agent within this windshield sector. We use Lyapunov analysis to show that by acting autonomously in this way, the agents will achieve rendezvous if the initial assignment graph is connected. A distinguishing feature of our approach is that it does not involve any estimation procedure aimed at reconstructing coordinate information. Our scenario thus appears to be the first example in which an interesting task is performed with extremely coarse sensing and control, and without state estimation. The system was implemented in computer simulation, accessible through the Web, of which the results are presented in the paper.

[1]  Daniel Liberzon,et al.  Quantized feedback stabilization of linear systems , 2000, IEEE Trans. Autom. Control..

[2]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[3]  Mireille E. Broucke,et al.  Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots , 2006, IEEE Transactions on Automatic Control.

[4]  Alfred M. Bruckstein,et al.  Ants, Crickets and Frogs in Cyclic Pursuit , 1991 .

[5]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, IEEE J. Robotics Autom..

[6]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[7]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.

[8]  W. Cooley.  Elementary Geometry , 1871, Nature.

[9]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[10]  Sekhar Tatikonda,et al.  Control under communication constraints , 2004, IEEE Transactions on Automatic Control.

[11]  Robin J. Evans,et al.  Stabilizability of Stochastic Linear Systems with Finite Feedback Data Rates , 2004, SIAM J. Control. Optim..

[12]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  I. Petersen,et al.  Multi-rate stabilization of multivariable discrete-time linear systems via a limited capacity communication channel , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[14]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[15]  Mireille E. Broucke,et al.  Formations of vehicles in cyclic pursuit , 2004, IEEE Transactions on Automatic Control.

[16]  Yuandan Lin,et al.  A Smooth Converse Lyapunov Theorem for Robust Stability , 1996 .

[17]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case , 2007, SIAM J. Control. Optim..

[18]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[19]  Veysel Gazi,et al.  Asynchronous Cyclic Pursuit , 2006, SAB.

[20]  Bruce A. Francis,et al.  Stabilizing a linear system by switching control with dwell time , 2002, IEEE Trans. Autom. Control..

[21]  J. Hespanha,et al.  Towards the Control of Linear Systems with Minimum Bit-Rate , 2002 .

[22]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[23]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case , 2007, SIAM J. Control. Optim..

[24]  Fernando Paganini,et al.  IEEE Transactions on Automatic Control , 2006 .

[25]  Nicola Elia,et al.  Stabilization of linear systems with limited information , 2001, IEEE Trans. Autom. Control..

[26]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.

[27]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[28]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. An Extended Summary , 2005 .

[29]  Emilio Frazzoli,et al.  Decentralized Policies for Geometric Pattern Formation and Path Coverage , 2007 .

[30]  Andrey V. Savkin,et al.  Bearings-Only Guidance of a Unicycle-Like Vehicle Following a Moving Target With a Smaller Minimum Turning Radius , 2010, IEEE Transactions on Automatic Control.

[31]  Wing Shing Wong,et al.  Systems with finite communication bandwidth constraints. II. Stabilization with limited information feedback , 1999, IEEE Trans. Autom. Control..

[32]  Steven M. LaValle,et al.  Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances , 2007, IEEE Transactions on Robotics.

[33]  Tom J. Richardson,et al.  Stable polygons of cyclic pursuit , 2001, Annals of Mathematics and Artificial Intelligence.

[34]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[35]  Daniel Liberzon,et al.  Switching in Systems and Control , 2003, Systems & Control: Foundations & Applications.

[36]  Heinrich W. E. Jung.  Über den kleinsten Kreis, der eine ebene Figur einschließt. , 1910 .

[37]  Rafael Murrieta-Cid,et al.  Optimal Paths for Landmark-Based Navigation by Differential-Drive Vehicles With Field-of-View Constraints , 2007, IEEE Transactions on Robotics.

[38]  Debasish Ghose,et al.  Generalization of Linear Cyclic Pursuit With Application to Rendezvous of Multiple Autonomous Agents , 2006, IEEE Transactions on Automatic Control.

[39]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[40]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.