Extracting Lifted Mutual Exclusion Invariants from Temporal Planning Domains

We present a technique for automatically extracting mutual exclusion invariants from temporal planning instances. It first identifies a set of invariant templates by inspecting the lifted representation of the domain and then checks these templates against properties that assure invariance. Our technique builds on other approaches to invariant synthesis presented in the literature, but departs from their limited focus on instantaneous actions by addressing temporal domains. To deal with time, we formulate invariance conditions that account for the entire structure of the actions and the possible concurrent interactions between them. As a result, we construct a significantly more comprehensive technique than previous methods, which is able to find not only invariants for temporal domains, but also a broader set of invariants for non-temporal domains. The experimental results reported in this paper provide evidence that identifying a broader set of invariants results in the generation of fewer multi-valued state variables with larger domains. We show that, in turn, this reduction in the number of variables reflects positively on the performance of a number of temporal planners that use a variable/value representation by significantly reducing their running time.

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

[2]  Hector Geffner,et al.  Unifying the Causal Graph and Additive Heuristics , 2008, ICAPS.

[3]  Patrik Haslum,et al.  Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.

[4]  Vincent Vidal The YAHSP Planning System: Forward Heuristic Search with Lookahead Plans Analysis , 2004 .

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

[6]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[7]  David E. Smith,et al.  Translating PDDL2.2. into a Constraint-based Variable/Value Language , 2008 .

[8]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[9]  Yixin Chen,et al.  Long-distance mutual exclusion for planning , 2009, Artif. Intell..

[10]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..

[11]  Amedeo Cesta,et al.  Unifying planning and scheduling as timelines in a component-based perspective , 2008 .

[12]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[13]  Jussi Rintanen,et al.  Regression for Classical and Nondeterministic Planning , 2008, ECAI.

[14]  Subbarao Kambhampati,et al.  Evaluating Temporal Planning Domains , 2007, ICAPS.

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

[16]  Ivan Serina,et al.  An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events , 2011, J. Artif. Intell. Res..

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

[18]  Malte Helmert,et al.  The Model Checking Integrated Planning System (MIPS) , 2001 .

[19]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[20]  Yixin Chen,et al.  A Novel Transition Based Encoding Scheme for Planning as Satisfiability , 2010, AAAI.

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

[22]  David E. Smith,et al.  Finding Mutual Exclusion Invariants in Temporal Planning Domains , 2011 .

[23]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

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

[25]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[26]  E. Pednault Toward a mathematical theory of plan synthesis , 1987 .

[27]  David E. Smith,et al.  Developing Domain-Independent Search Control for Europa2 , 2007 .

[28]  Robert Mattmüller,et al.  Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning , 2009, ICAPS.

[29]  Jeremy Frank,et al.  Constraint-Based Attribute and Interval Planning , 2003, Constraints.

[30]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[31]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[32]  Lenhart K. Schubert,et al.  Discovering State Constraints in DISCOPLAN: Some New Results , 2000, AAAI/IAAI.

[33]  Jussi Rintanen Constraint-Based Algorithm for Computing Temporal Invariants , 2014, JELIA.

[34]  David E. Smith,et al.  Automatic Synthesis of Temporal Invariants , 2011, SARA.

[35]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[36]  Andrew Coles,et al.  Forward-Chaining Partial-Order Planning , 2010, ICAPS.

[37]  Rob Sherwood,et al.  ASPEN-Automated Planning and Scheduling for Space Mission Operation , 2000 .

[38]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[39]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..