Efficient reactive controller synthesis for a fragment of linear temporal logic

Motivated by robotic motion planning, we develop a framework for control policy synthesis for both non-deterministic transition systems and Markov decision processes that are subject to temporal logic task specifications. We introduce a fragment of linear temporal logic that can be used to specify common motion planning tasks such as safe navigation, response to the environment, persistent coverage, and surveillance. This fragment is computationally efficient; the complexity of control policy synthesis is a doubly-exponential improvement over standard linear temporal logic for both non-deterministic transition systems and Markov decision processes. This improvement is possible because we compute directly on the original system, as opposed to the automata-based approach commonly used. We give simulation results for representative motion planning tasks and compare to generalized reactivity(1).

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

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

[3]  Ufuk Topcu,et al.  Receding Horizon Temporal Logic Planning , 2012, IEEE Transactions on Automatic Control.

[4]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[5]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[6]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

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

[8]  Rüdiger Ehlers,et al.  Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis , 2011, NASA Formal Methods.

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

[10]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[11]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[12]  Emilio Frazzoli,et al.  Sampling-based motion planning with deterministic μ-calculus specifications , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[13]  Christel Baier,et al.  PROBMELA: a modeling language for communicating probabilistic processes , 2004, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04..

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

[15]  Lydia E. Kavraki,et al.  Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning , 2010, IEEE Transactions on Robotics.

[16]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[17]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[18]  Calin Belta,et al.  LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees , 2011, ArXiv.

[19]  Hadas Kress-Gazit,et al.  Temporal-Logic-Based Reactive Mission and Motion Planning , 2009, IEEE Transactions on Robotics.

[20]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[21]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[22]  Robin Milner,et al.  Handbook of Theoretical Computer Science (Vol. B) , 1990 .

[23]  Calin Belta,et al.  Temporal Logic Motion Planning and Control With Probabilistic Satisfaction Guarantees , 2012, IEEE Transactions on Robotics.

[24]  C. Belta,et al.  Controlling a class of non-linear systems on rectangles , 2006 .

[25]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[26]  Christel Baier,et al.  Principles of model checking , 2008 .

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

[28]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[29]  Ufuk Topcu,et al.  TuLiP: a software toolbox for receding horizon temporal logic planning , 2011, HSCC '11.

[30]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[31]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.