Automatic Deployment of Distributed Teams of Robots From Temporal Logic Motion Specifications

We present a computational framework for automatic synthesis of decentralized communication and control strategies for a robotic team from global specifications, which are given as temporal and logic statements about visiting regions of interest in a partitioned environment. We consider a purely discrete scenario, where the robots move among the vertices of a graph. However, by employing recent results on invariance and facet reachability for dynamical systems in environments with polyhedral partitions, the framework from this paper can be directly implemented for robots with continuous dynamics. While allowing for a rich specification language and guaranteeing the correctness of the solution, our approach is conservative in the sense that we might not find a solution, even if one exists. The overall amount of required computation is large. However, most of it is performed offline before the deployment. Illustrative simulations and experimental results are included.

[1]  Madhavan Mukund,et al.  From Global Specifications to Distributed Implementations , 2002 .

[2]  Jan H. van Schuppen,et al.  A control problem for affine dynamical systems on a full-dimensional polytope , 2004, Autom..

[3]  Calin Belta,et al.  A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications , 2008, IEEE Transactions on Automatic Control.

[4]  Bud Mishra,et al.  Discrete event models+temporal logic=supervisory controller: automatic synthesis of locomotion controllers , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[5]  Calin Belta,et al.  Distributed implementations of global temporal logic motion specifications , 2008, 2008 IEEE International Conference on Robotics and Automation.

[6]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[7]  Calin Belta,et al.  Discrete abstractions for robot motion planning and control in polygonal environments , 2005, IEEE Transactions on Robotics.

[8]  George J. Pappas,et al.  Translating Temporal Logic to Controller Specifications , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[10]  Vijay Kumar,et al.  Controlling formations of multiple mobile robots , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[11]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[12]  Thomas Bak,et al.  Multi-Robot Motion Planning: A Timed Automata Approach , 2004 .

[13]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[14]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[15]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[16]  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).

[17]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[18]  Richard M. Murray,et al.  DISTRIBUTED COOPERATIVE CONTROL OF MULTIPLE VEHICLE FORMATIONS USING STRUCTURAL POTENTIAL FUNCTIONS , 2002 .

[19]  Kevin M. Passino,et al.  Stability analysis of swarms , 2003, IEEE Trans. Autom. Control..

[20]  Hadas Kress-Gazit,et al.  Where's Waldo? Sensor-Based Temporal Logic Motion Planning , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[21]  George J. Pappas,et al.  Hybrid Controllers for Path Planning: A Temporal Logic Approach , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[22]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[23]  Amir Pnueli,et al.  Synthesis of Reactive(1) Designs , 2006, VMCAI.

[24]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[25]  Dennis Dams.  Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers , 1999, Log. J. IGPL.

[26]  Jaco Geldenhuys,et al.  More efficient on-the-fly LTL verification with Tarjan's algorithm , 2005, Theor. Comput. Sci..

[27]  K.J. Kyriakopoulos,et al.  Automatic synthesis of multi-agent motion tasks based on LTL specifications , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[28]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[29]  Thomas Bak,et al.  Planning : A Timed Automata Approach , 2004 .

[30]  Jan H. van Schuppen,et al.  Reachability and control synthesis for piecewise-affine hybrid systems on simplices , 2006, IEEE Transactions on Automatic Control.

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

[32]  C. Belta,et al.  LTL Planning for Groups of Robots , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.

[33]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[34]  Calin Belta,et al.  Controlling a Class of Nonlinear Systems on Rectangles , 2006, IEEE Transactions on Automatic Control.