A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning

In many usage scenarios of AI Planning technology, users will want not just a plan π but an explanation of the space of possible plans, justifying π. In particular, in oversubscription planning where not all goals can be achieved, users may ask why a conjunction A of goals is not achieved by π. We propose to answer this kind of question with the goal conjunctions B excluded by A, i. e., that could not be achieved if A were to be enforced. We formalize this approach in terms of plan-property dependencies, where plan properties are propositional formulas over the goals achieved by a plan, and dependencies are entailment relations in plan space. We focus on entailment relations of the form ∧g∈A g ⇒ ⌝ ∧g∈B g, and devise analysis techniques globally identifying all such relations, or locally identifying the implications of a single given plan property (user question) ∧g∈A g. We show how, via compilation, one can analyze dependencies between a richer form of plan properties, specifying formulas over action subsets touched by the plan. We run comprehensive experiments on adapted IPC benchmarks, and find that the suggested analyses are reasonably feasible at the global level, and become significantly more effective at the local level.

[1]  Erez Karpas,et al.  Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.

[2]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[3]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[4]  Subbarao Kambhampati,et al.  Why Couldn't You do that? Explaining Unsolvability of Classical Planning Problems in the Presence of Plan Advice , 2019, ArXiv.

[5]  Jörg Hoffmann,et al.  State space search nogood learning: Online refinement of critical-path dead-end detectors in planning , 2017, Artif. Intell..

[6]  Philippe Laborie An Optimal Iterative Algorithm for Extracting MUCs in a Black-box Constraint Network , 2014, ECAI.

[7]  Michael Katz,et al.  Oversubscription Planning as Classical Planning with Multiple Cost Functions , 2019, ICAPS.

[8]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[9]  Jorge A. Baier,et al.  A Heuristic Search Approach to Planning with Temporally Extended Preferences , 2007, IJCAI.

[10]  Niklas T. Lauffer,et al.  Human-Understandable Explanations of Infeasibility for Resource-Constrained Scheduling Problems , 2019 .

[11]  J. Christopher Beck,et al.  itSIMPLE: towards an integrated design system for real planning applications , 2013, The Knowledge Engineering Review.

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

[13]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

[14]  John W. Chinneck,et al.  Feasibility And Infeasibility In Optimization , 2015 .

[15]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[16]  Carmel Domshlak,et al.  Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations , 2015, J. Artif. Intell. Res..

[17]  Stefan Edelkamp,et al.  On the Compilation of Plan Constraints and Preferences , 2006, ICAPS.

[18]  Patrik Haslum,et al.  Conflict-Based Diagnosis of Discrete Event Systems: Theory and Practice , 2012, KR.

[19]  Tim Miller,et al.  Explanation in Artificial Intelligence: Insights from the Social Sciences , 2017, Artif. Intell..

[20]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[21]  Bernhard Nebel,et al.  On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..

[22]  Maria Fox,et al.  Explainable Planning , 2017, ArXiv.

[23]  Jörg Hoffmann,et al.  Resource-Constrained Planning: A Monte Carlo Random Walk Approach , 2012, ICAPS.

[24]  David E. Smith Planning as an Iterative Process , 2012, AAAI.

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

[26]  Mark S. Boddy,et al.  Course of Action Generation for Cyber Security Using Classical Planning , 2005, ICAPS.

[27]  J. Dekleer An assumption-based TMS , 1986 .

[28]  Jörg Hoffmann,et al.  Simulated Penetration Testing: From "Dijkstra" to "Turing Test++" , 2015, ICAPS.

[29]  Jussi Rintanen,et al.  An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.

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

[31]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[32]  Cheng Fang,et al.  Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation , 2017, J. Artif. Intell. Res..

[33]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[34]  Maria Fox,et al.  AUV mission control via temporal planning , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[35]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[36]  Stephanie Rosenthal,et al.  Verbalization: Narration of Autonomous Robot Experience , 2016, IJCAI.

[37]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[38]  Malte Helmert,et al.  Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..

[39]  Patrik Haslum,et al.  Exhaustive Diagnosis of Discrete Event Systems through Exploration of the Hypothesis Space , 2011 .