Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints

We study the characterization and computation of general policies for families of problems that share a structure characterized by a common reduction into a single abstract problem. Policies $\mu$ that solve the abstract problem P have been shown to solve all problems Q that reduce to P provided that $\mu$ terminates in Q. In this work, we shed light on why this termination condition is needed and how it can be removed. The key observation is that the abstract problem P captures the common structure among the concrete problems Q that is local (Markovian) but misses common structure that is global. We show how such global structure can be captured by means of trajectory constraints that in many cases can be expressed as LTL formulas, thus reducing generalized planning to LTL synthesis. Moreover, for a broad class of problems that involve integer variables that can be increased or decreased, trajectory constraints can be compiled away, reducing generalized planning to fully observable non-deterministic planning.

[1]  Pieter Abbeel,et al.  Tractability of Planning with Loops , 2015, AAAI.

[2]  Neil Immerman,et al.  Learning Generalized Plans Using Abstract Counting , 2008, AAAI.

[3]  Hector J. Levesque,et al.  Planning with Loops , 2005, IJCAI.

[4]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[5]  Blai Bonet,et al.  Policies that Generalize: Solving Many Planning Problems with the Same Policy , 2015, IJCAI.

[6]  Nir Piterman.  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[7]  Yuxiao Hu,et al.  Generalized Planning: Synthesizing Plans that Work for Multiple Environments , 2011, IJCAI.

[8]  Yuxiao Hu,et al.  A Correctness Result for Reasoning about One-Dimensional Planning Problems , 2010, IJCAI.

[9]  Marco Pistore,et al.  Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..

[10]  Blai Bonet,et al.  Solving POMDPs: RTDP-Bel vs. Point-based Algorithms , 2009, IJCAI.

[11]  Blai Bonet,et al.  Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners , 2009, ICAPS.

[12]  Neil Immerman,et al.  Qualitative Numeric Planning , 2011, AAAI.

[13]  Hector J. Levesque,et al.  On the Limits of Planning over Belief States under Strict Uncertainty , 2006, KR.

[14]  Neil Immerman,et al.  A new representation and associated algorithms for generalized planning , 2011, Artif. Intell..

[15]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[16]  Hector J. Levesque,et al.  Foundations for Generalized Planning in Unbounded Stochastic Domains , 2016, KR.

[17]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..