LTL Planning for Groups of Robots

We approach the general problem of planning and controlling groups of robots from logical and temporal specifications over regions of interest in 2D or 3D environments. The focus of this paper is on planning, and, enabled by our previous results, we assume that the environment is partitioned and described in the form of a graph whose nodes label the partition regions and whose edges capture adjacency relations among these regions. We also assume that the robots can synchronize when penetrating from a region to another. We develop a fully automated framework for generation of robot plans from robot abstract task specifications given in terms of linear temporal logic (LTL) formulas over regions of interest. Inter-robot collision avoidance is guaranteed, and the assignment of plans to specific robots is automatic. The main tools underlying our framework are model checking and bisimilarity equivalence relations

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[5]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[6]  Daniel E. Koditschek.  The Control of Natural Motion in Mechanical Systems , 1991 .

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

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

[9]  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.

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[12]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[13]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[14]  C. Belta,et al.  Constructing decidable hybrid systems with velocity bounds , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

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

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

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

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

[20]  Hadas Kress-Gazit,et al.  Temporal Logic Motion Planning for Mobile Robots , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

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

[23]  Calin Belta,et al.  A Framework for Automatic Deployment of Robots in 2D and 3D Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  Calin Belta,et al.  A Fully Automated Framework for Control of Linear Systems from LTL Specifications , 2006, HSCC.