Why Can't You Do That HAL? Explaining Unsolvability of Planning Tasks

Explainable planning is widely accepted as a prerequisite for autonomous agents to successfully work with humans. While there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains a largely open and under-studied problem, even though such situations can be the hardest to understand or debug. In this paper, we show that hierarchical abstractions can be used to efficiently generate reasons for unsolvability of planning problems. In contrast to related work on computing certificates of unsolvability, we show that our methods can generate compact, humanunderstandable reasons for unsolvability. Empirical analysis and user studies show the validity of our methods as well as their computational efficacy on a number of benchmark planning domains.

[1]  Moritz Tenorth,et al.  Understanding and executing instructions for everyday manipulation tasks from the World Wide Web , 2010, 2010 IEEE International Conference on Robotics and Automation.

[2]  Malte Helmert,et al.  Sound and Complete Landmarks for And/Or Graphs , 2010, ECAI.

[3]  T. Shallice,et al.  Hierarchical schemas and goals in the control of sequential behavior. , 2006, Psychological review.

[4]  Yu Zhang,et al.  Plan Explanations as Model Reconciliation: Moving Beyond Explanation as Soliloquy , 2017, IJCAI.

[5]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[6]  Hadas Kress-Gazit,et al.  LTLMoP: Experimenting with language, Temporal Logic and robot control , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Subbarao Kambhampati,et al.  Hierarchical Expertise Level Modeling for User Specific Contrastive Explanations , 2018, IJCAI.

[8]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[9]  Mausam,et al.  SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs , 2010, AAAI.

[10]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[12]  Giovanni Pezzulo,et al.  Problem Solving as Probabilistic Inference with Subgoaling: Explaining Human Successes and Pitfalls in the Tower of Hanoi , 2016, PLoS Comput. Biol..

[13]  Giuseppe De Giacomo,et al.  Synthesis for LTL and LDL on Finite Traces , 2015, IJCAI.

[14]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

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

[16]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[17]  Malte Helmert,et al.  A Proof System for Unsolvable Planning Tasks , 2018, ICAPS.

[18]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[19]  Jörg Hoffmann,et al.  Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning , 2017, IJCAI.

[20]  Jorge A. Baier,et al.  Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners , 2007, ICAPS.

[21]  Hector Muñoz-Avila,et al.  The Shop Planning System , 2001, AI Mag..

[22]  Allen Newell,et al.  Human problem solving: The state of the theory in 1970. , 1971 .

[23]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

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

[25]  Thomas Keller,et al.  Abstractions for Planning with State-Dependent Action Costs , 2016, ICAPS.

[26]  Hector Geffner,et al.  Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners , 2010, AAAI.

[27]  Jorge A. Baier,et al.  Planning with First-Order Temporally Extended Goals using Heuristic Search , 2006, AAAI.

[28]  Malte Helmert,et al.  Unsolvability Certificates for Classical Planning , 2017, ICAPS.