On the minimal revision problem of specification automata

As robots are being integrated into our daily lives, it becomes necessary to provide guarantees on their safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as “close” as possible to the initial user intent. This paper establishes that the latter problem, which is referred to as the minimal specification revision problem, is NP-complete. A heuristic algorithm is presented that can compute good approximations to the Minimal Revision Problem (MRP) in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

[1]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[2]  Dimos V. Dimarogonas,et al.  Distributed plan reconfiguration via knowledge transfer in multi-agent systems under local LTL specifications , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[3]  M. Sniedovich.  Dijkstra's algorithm revisited: the dynamic programming connexion , 2006 .

[4]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

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

[6]  Emilio Frazzoli,et al.  Minimum-violating Planning with Conflicting Specifications , 2013 .

[7]  D. Dimarogonas,et al.  Decentralized multi-agent control from local LTL specifications , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[8]  Bernhard Nebel,et al.  Coming up With Good Excuses: What to do When no Plan Can be Found , 2010, Cognitive Robotics.

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

[10]  Sriram Sankaranarayanan,et al.  On the revision problem of specification automata , 2012, 2012 IEEE International Conference on Robotics and Automation.

[11]  Marsha Chechik,et al.  Model exploration with temporal logic query checking , 2002, SIGSOFT '02/FSE-10.

[12]  Yan Zhang,et al.  A Logic Approach for LTL System Modification , 2005, ISMIS.

[13]  Emilio Frazzoli,et al.  Minimum-violation LTL planning with conflicting specifications , 2013, 2013 American Control Conference.

[14]  N. Given.  Revising Specifications with CTL Properties using Bounded Model Checking , 2008 .

[15]  Hadas Kress-Gazit,et al.  Translating Structured English to Robot Controllers , 2008, Adv. Robotics.

[16]  Paulo Tabuada,et al.  Pessoa 2.0: a controller synthesis tool for cyber-physical systems , 2011, HSCC '11.

[17]  Georgios E. Fainekos,et al.  Revision of specification automata under quantitative preferences , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[18]  Amy LaViers,et al.  Automatic Generation of Balletic Motions , 2011, 2011 IEEE/ACM Second International Conference on Cyber-Physical Systems.

[19]  Ricardo G. Sanfelice,et al.  Optimal control of Mixed Logical Dynamical systems with Linear Temporal Logic specifications , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[21]  Georgios E. Fainekos,et al.  Revising temporal logic specifications for motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[22]  Nicholas Roy,et al.  Controlling Wild Bodies Using Linear Temporal Logic , 2012 .

[23]  Sanjit A. Seshia,et al.  A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance , 2008, 2008 Formal Methods in Computer-Aided Design.

[24]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[25]  Nicholas Roy,et al.  Designing Petri Net Supervisors from LTL Specifications , 2012 .

[26]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[27]  Subbarao Kambhampati,et al.  Effective Approaches for Partial Satisfaction (Over-Subscription) Planning , 2004, AAAI.

[28]  W. M. Wonham,et al.  Supervision of Infinite Behavior of Discrete-Event Systems , 1994 .

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

[30]  Calin Belta,et al.  Negotiating the probabilistic satisfaction of temporal logic motion specifications , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[32]  Hadas Kress-Gazit,et al.  Analyzing Unsynthesizable Specifications for High-Level Robot Behavior Using LTLMoP , 2011, CAV.

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

[34]  Karl Henrik Johansson,et al.  Revising motion planning under Linear Temporal Logic specifications in partially known workspaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[35]  Lydia E. Kavraki,et al.  Sampling-based motion planning with temporal goals , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[37]  Roderick Bloem,et al.  Debugging formal specifications using simple counterstrategies , 2009, 2009 Formal Methods in Computer-Aided Design.

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

[39]  Hadas Kress-Gazit,et al.  Sorry Dave, I'm Afraid I Can't Do That: Explaining Unachievable Robot Tasks Using Natural Language , 2013, Robotics: Science and Systems.

[40]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[41]  Lydia E. Kavraki,et al.  This Time the Robot Settles for a Cost: A Quantitative Approach to Temporal Logic Planning with Partial Satisfaction , 2015, AAAI.

[42]  Hadas Kress-Gazit,et al.  Towards minimal explanations of unsynthesizability for high-level robot behaviors , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[43]  Viktor Schuppan,et al.  Diagnostic Information for Realizability , 2008, VMCAI.

[44]  Georgios E. Fainekos,et al.  Approximate solutions for the minimal revision problem of specification automata , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[45]  Marsha Chechik,et al.  TLQSolver: A Temporal Logic Query Checker , 2003, CAV.

[46]  Dimos V. Dimarogonas,et al.  Reconfiguration in motion planning of single- and multi-agent systems under infeasible local LTL specifications , 2013, 52nd IEEE Conference on Decision and Control.

[47]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[48]  Matthias Scheutz,et al.  What to do and how to do it: Translating natural language directives into temporal and dynamic logic representation for goal management and action execution , 2009, 2009 IEEE International Conference on Robotics and Automation.

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

[50]  Calin Belta,et al.  Optimal multi-robot path planning with temporal logic constraints , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.