Robust multi-robot optimal path planning with temporal logic constraints

In this paper we present a method for automatically planning robust optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied even with uncertainty in the robots' traveling times. We characterize a class of LTL formulas that are robust to robot timing errors, for which we generate optimal paths if no timing errors are present, and we present bounds on the deviation from the optimal values in the presence of errors. We implement and experimentally evaluate our method considering a persistent monitoring task in a road network environment.

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

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

[3]  Steven M. LaValle,et al.  Controlling Wild Bodies Using Linear Temporal Logic , 2011, Robotics: Science and Systems.

[4]  Anuj Puri.  Dynamical Properties of Timed Automata , 2000, Discret. Event Dyn. Syst..

[5]  Calin Belta,et al.  Optimal path planning under temporal logic constraints , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

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

[9]  Anuj Puri,et al.  An Undecidable Problem for Timed Automata , 1999, Discret. Event Dyn. Syst..

[10]  Pierre Wolper,et al.  An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages , 1998, Theor. Comput. Sci..

[11]  Calin Belta,et al.  Automatic Deployment of Distributed Teams of Robots From Temporal Logic Motion Specifications , 2010, IEEE Transactions on Robotics.

[12]  Yushan Chen,et al.  Formal Approach to the Deployment of Distributed Robotic Teams , 2012, IEEE Transactions on Robotics.

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

[14]  Lydia E. Kavraki,et al.  Motion planning with hybrid dynamics and temporal goals , 2010, 49th IEEE Conference on Decision and Control (CDC).

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

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

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

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