Managing non-determinism in symbolic robot motion planning and control

We study the problem of designing control strategies for non-deterministic transitions systems enforcing the satisfaction of linear temporal logic (LTL) formulas over their set of states. We focus on finite transition systems with inputs, which are often encountered when solving motion planning problems by using discrete quotients induced by a given partition of the state space. Our approach solves the problem conservatively using LTL games, and consists of the following three steps: (1) the original transition system is transformed into a transition system on which an LTL game can be played, (2) a solution of the LTL game on the new transition system is obtained, and (3) an interface between this solution and the initial transition system is constructed. The correctness of the method is ensured by design. The advantages and conservativeness of our approach are discussed and illustrated by simple examples.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Rajeev Alur,et al.  Deterministic generators and games for LTL fragments , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[3]  Howie Choset,et al.  Integrated Planning and Control for Convex-bodied Nonholonomic Systems using Local Feedback Control Policies , 2006, Robotics: Science and Systems.

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

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

[6]  L.C.G.J.M. Habets,et al.  Control of Rectangular Multi-Affine Hybrid Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[7]  David E. Muller,et al.  Infinite sequences and finite machines , 1963, SWCT.

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

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

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

[11]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

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

[13]  Steven M. LaValle,et al.  Computing Smooth Feedback Plans Over Cylindrical Algebraic Decompositions , 2006, Robotics: Science and Systems.

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

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

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

[17]  Calin Belta,et al.  Hierarchical abstractions for robotic swarms , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[18]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

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

[20]  Wolfgang Thomas,et al.  Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.