Incremental sampling-based algorithm for minimum-violation motion planning

This paper studies the problem of control strategy synthesis for dynamical systems with differential constraints to fulfill a given reachability goal while satisfying a set of safety rules. Particular attention is devoted to goals that become feasible only if a subset of the safety rules are violated. The proposed algorithm computes a control law, that minimizes the level of unsafety while the desired goal is guaranteed to be reached. This problem is motivated by an autonomous car navigating an urban environment while following rules of the road such as “always travel in right lane” and “do not change lanes frequently”. Ideas behind sampling based motion-planning algorithms, such as Probabilistic Road Maps (PRMs) and Rapidly-exploring Random Trees (RRTs), are employed to incrementally construct a finite concretization of the dynamics as a durational Kripke structure. In conjunction with this, a weighted finite automaton that captures the safety rules is used in order to find an optimal trajectory that minimizes the violation of safety rules. We prove that the proposed algorithm guarantees asymptotic optimality, i.e., almost-sure convergence to optimal solutions. We present results of simulation experiments and an implementation on an autonomous urban mobility-on-demand system.

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

[2]  Morgan Quigley,et al.  ROS: an open-source Robot Operating System , 2009, ICRA 2009.

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

[4]  Luke Fletcher,et al.  A perception‐driven autonomous urban vehicle , 2008, J. Field Robotics.

[5]  Hadas Kress-Gazit,et al.  Automated feedback for unachievable high-level robot behaviors , 2012, 2012 IEEE International Conference on Robotics and Automation.

[6]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[7]  Calin Belta,et al.  Optimal path planning for surveillance with temporal-logic constraints* , 2011, Int. J. Robotics Res..

[8]  Calin Belta,et al.  Robust multi-robot optimal path planning with temporal logic constraints , 2012, 2012 IEEE International Conference on Robotics and Automation.

[9]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[10]  Kris K. Hauser,et al.  The minimum constraint removal problem with three robotics applications , 2014, Int. J. Robotics Res..

[11]  Luke Fletcher,et al.  A perception‐driven autonomous urban vehicle , 2008, J. Field Robotics.

[12]  Calin Belta,et al.  MDP optimal control under temporal logic constraints , 2011, IEEE Conference on Decision and Control and European Control Conference.

[13]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[14]  Paulo Tabuada,et al.  Linear Time Logic Control of Discrete-Time Linear Systems , 2006, IEEE Transactions on Automatic Control.

[15]  Emilio Frazzoli,et al.  Least-violating control strategy synthesis with safety rules , 2013, HSCC '13.

[16]  Ufuk Topcu,et al.  Receding horizon control for temporal logic specifications , 2010, HSCC '10.

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

[18]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[19]  Doron A. Peled,et al.  Temporal Debugging for Concurrent Systems , 2002, TACAS.

[20]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning with deterministic μ-calculus specifications , 2012, 2012 American Control Conference (ACC).