Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces

Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of non-deterministic planning with temporally extended goals specified in linear temporal logic (LTL), interpreted over either finite or infinite traces. Unlike existing LTL planners, we place no restrictions on our LTL formulae beyond those necessary to distinguish finite from infinite interpretations. We generate plans by compiling LTL temporally extended goals into problem instances described in the Planning Domain Definition Language that are solved by a state-of-the-art fully observable non-deterministic planner. We propose several different compilations based on translations of LTL to alternating or non-deterministic (Büchi) automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques, and do so in a manner that demonstrates highly competitive performance.

[1]  A. Gerevini,et al.  Plan Constraints and Preferences in PDDL 3 The Language of the Fifth International Planning Competition , 2005 .

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

[3]  Michel Barbeau,et al.  Planning Control Rules for Reactive Agents , 1997, Artif. Intell..

[4]  Marco Pistore,et al.  Fusing Procedural and Declarative Planning Goals for Nondeterministic Domains , 2008, AAAI.

[5]  Patrick Doherty,et al.  TALplanner: A Temporal Logic-Based Planner , 2001, AI Mag..

[6]  Giuseppe De Giacomo,et al.  Computing Infinite Plans for LTL Goals Using a Classical Planner , 2011, IJCAI.

[7]  Jorge A. Baier,et al.  On the Use of Planning Technology for Verification Aws Albarghouthi , 2009 .

[8]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[9]  Jussi Rintanen,et al.  Incorporation of Temporal Logic Control into Plan Operators , 2000, ECAI.

[10]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[11]  Erion Plaku.  Planning in Discrete and Continuous Spaces: From LTL Tasks to Robot Motions , 2012, TAROS.

[12]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[13]  Jorge A. Baier,et al.  Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals , 2015, IJCAI.

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

[15]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[16]  Stephen Cresswell,et al.  Compilation of LTL Goal Formulas into PDDL , 2004, ECAI.

[17]  Patrik Haslum,et al.  Narrative Planning: Compilations to Classical Planning , 2012, J. Artif. Intell. Res..

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

[19]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[20]  Marco Montali,et al.  Monitoring Business Metaconstraints Based on LTL and LDL for Finite Traces , 2014, BPM.

[21]  Christian J. Muise,et al.  Improved Non-Deterministic Planning by Exploiting State Relevance , 2012, ICAPS.

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

[23]  Marco Pistore,et al.  Planning with a language for extended goals , 2002, AAAI/IAAI.

[24]  S. Edelkamp.  Optimal Symbolic PDDL 3 Planning with MIPS-BDD , 2006 .

[25]  Orna Kupferman,et al.  The Blowup in Translating LTL to Deterministic Automata , 2010, MoChArt.

[26]  Giuseppe De Giacomo,et al.  Linear Temporal Logic and Linear Dynamic Logic on Finite Traces , 2013, IJCAI.

[27]  Marco Pistore,et al.  Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.

[28]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[29]  Alberto Camacho,et al.  Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version) , 2016, KnowProS@IJCAI.

[30]  Esra Erdem,et al.  Genome Rearrangement: A Planning Approach , 2010, AAAI.

[31]  Hector Geffner,et al.  Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners , 2013, IJCAI.