Optimal path planning under temporal logic constraints

In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by a general linear temporal logic formula. In addition, we require that an optimizing proposition must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot trajectory which minimizes the cost function. The problem is motivated by robotic monitoring and data gathering. In this setting, the optimizing proposition is satisfied at locations where data can be uploaded, and the formula specifies a an infinite horizon data collection mission. Our method utilizes Büchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal logic formula. We then present a graph algorithm which computes a path corresponding to the optimal robot trajectory. We also present an implementation for a robot performing a data gathering mission.

[1]  Emilio Frazzoli,et al.  Vehicle Routing Problem with Metric Temporal Logic Specifications , 2008, 2008 47th IEEE Conference on Decision and Control.

[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.  Discrete abstractions for robot motion planning and control in polygonal environments , 2005, IEEE Transactions on Robotics.

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

[5]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

[7]  Lubos Brim,et al.  DiVinE 2.0: High-Performance Model Checking , 2009, 2009 International Workshop on High Performance Computational Systems Biology.

[8]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

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

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

[11]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[12]  Ufuk Topcu,et al.  Receding horizon temporal logic planning for dynamical systems , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

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

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

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

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

[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]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

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

[20]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.