Probabilistic verification of a decentralized policy for conflict resolution in multi-agent systems

In this paper, we consider a decentralized cooperative control policy proposed recently for steering multiple nonholonomic vehicles between assigned start and goal configurations while avoiding collisions. The policy is known to ensure safety (i.e., collision avoidance) for an arbitrarily large number of vehicles, if initial configurations satisfy certain conditions. The method is highly scalable, and effective solutions can be obtained for several tens of autonomous agents. On the other hand, the liveness properties of the policy, i.e. the capability of negotiating a solution in finite time, are not completely understood yet. In this paper, we introduce a condition on the final vehicle configurations, which we conjecture to be necessary and sufficient for guaranteeing liveness. We prove the necessity by a constructive method. Because of the overwhelming complexity of proving the sufficiency of such condition, we assess the correctness of the conjecture in probability through the analysis of the results of a large number of randomized experiments

[1]  Antonio Bicchi,et al.  Decentralized Cooperative Conflict Resolution for Multiple Nonholonomic Vehicles , 2005 .

[2]  C. Tomlin,et al.  Decentralized optimization, with application to multiple aircraft coordination , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[3]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[4]  Ian M. Mitchell,et al.  Safety verification of conflict resolution manoeuvres , 2001, IEEE Trans. Intell. Transp. Syst..

[5]  Nancy A. Lynch,et al.  Hybrid I/O Automata Revisited , 2001, HSCC.

[6]  Michael S. Branicky,et al.  Studies in hybrid systems: modeling, analysis, and control , 1996 .

[7]  S. Shankar Sastry,et al.  Conflict resolution for air traffic management: a study in multiagent hybrid systems , 1998, IEEE Trans. Autom. Control..

[8]  George J. Pappas,et al.  Flocking Agents with Varying Interconnection Topology , 2004 .

[9]  Dimos V. Dimarogonas,et al.  Decentralized feedback stabilization of multiple nonholonomic agents , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[10]  Vijay Kumar,et al.  Hierarchical modeling and analysis of embedded systems , 2003, Proc. IEEE.

[11]  Claire J. Tomlin,et al.  Maneuver design for multiple aircraft conflict resolution , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[12]  A. Jadbabaie,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[13]  Jason M. O'Kane,et al.  Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  John Lygeros,et al.  Hierarchical, Hybrid Control of Large Scale Systems , 1996 .

[15]  Eric Klavins,et al.  Communication Complexity of Multi-robot Systems , 2002, WAFR.

[16]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[17]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[18]  Srinivas Akella,et al.  Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths , 2005, Int. J. Robotics Res..

[19]  Vladimir J. Lumelsky,et al.  Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model , 1997, Auton. Robots.

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

[21]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[22]  A. Bicchi,et al.  Decentralized cooperative conflict resolution among multiple autonomous mobile agents , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[24]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[25]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.