Patching task-level robot controllers based on a local μ-calculus formula

We present a method for mending strategies for GR(1) specifications. Given the addition or removal of edges from the game graph describing a problem (essentially transition rules in a GR(1) specification), we apply a μ-calculus formula to a neighborhood of states to obtain a “local strategy” that navigates around the invalidated parts of an original synthesized strategy. Our method may thus avoid global resynthesis while recovering correctness with respect to the new specification. We illustrate the results both in simulation and on physical hardware for a planar robot surveillance task.

[1]  Michael S. Branicky,et al.  Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..

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

[3]  A. Nerode,et al.  Logics for hybrid systems , 2000, Proceedings of the IEEE.

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

[5]  S. Shankar Sastry,et al.  O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..

[6]  Amir Pnueli,et al.  Bridging the gap between fair simulation and trace inclusion , 2005, Inf. Comput..

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

[8]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

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

[10]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

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

[12]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[13]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[14]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

[15]  Michael H. Dickinson,et al.  Motmot, an open-source toolkit for realtime video acquisition and analysis , 2009, Source Code for Biology and Medicine.

[16]  Paulo Tabuada,et al.  Robust discrete synthesis against unspecified disturbances , 2011, HSCC '11.

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

[18]  W. M. Wonham,et al.  Control problems in a temporal logic framework , 1986 .

[19]  Joel W. Burdick,et al.  Backtracking temporal logic synthesis for uncertain environments , 2012, 2012 IEEE International Conference on Robotics and Automation.

[20]  Tichakorn Wongpiromsarn,et al.  Formal Methods for Design and Verification of Embedded Control Systems: Application to an Autonomous Vehicle , 2010 .