• Corpus ID: 17749164

Hierarchical Finite State Controllers for Generalized Planning

  title={Hierarchical Finite State Controllers for Generalized Planning},
  author={Javier Segovia Aguas and Sergio Jim{\'e}nez Celorrio and Anders Jonsson},
Finite State Controllers (FSCs) are an effective way to represent sequential plans compactly. By imposing appropriate conditions on transitions, FSCs can also represent generalized plans that solve a range of planning problems from a given domain. In this paper we introduce the concept of hierarchical FSCs for planning by allowing controllers to call other controllers. We show that hierarchical FSCs can represent generalized plans more compactly than individual FSCs. Moreover, our call… 

Figures and Tables from this paper

Computing Hierarchical Finite State Controllers With Classical Planning
A classical planning compilation for computing hierarchical FSCs that solve challenging generalized planning tasks and allows controllers to call other controllers to represent generalized plans more compactly than individual F SCs.
Discovering State and Action Abstractions for Generalized Task and Motion Planning
An algorithm for learning features, abstractions, and generalized plans for continuous robotic task and motion planning (TAMP) is proposed and the unique difficulties that arise when forced to consider geometric and physical constraints as a part of the generalized plan are examined.
Learning STRIPS Action Models with Classical Planning
This paper presents a novel approach for learning STRIPS action models from examples that compiles this inductive learning task into a classical planning task that accepts partially specified action models and can be used to validate whether the observation of a plan execution follows a given STRIps action model, even if this model is not fully specified.
A review of generalized planning
The paper reviews recent advances in generalized planning and relates them to existing planning formalisms, such as planning with domain control knowledge and approaches for planning under uncertainty, that also aim at generality.
Verifiable Parameterised Behaviour Models - For Robotic and Embedded Systems
This work produces safe mechanisms to set actual and formal parameters for multiple, concurrent instances of the same behaviour, and achieves the parameterisation of behaviour models analogous to a procedural abstraction.
Generalized Planning as Heuristic Search
This paper presents a novel GP solution space that is independent of the number of planning instances in a GP problem, and the size of these instances, and adapts the planning as heuristic search paradigm to the particularities of GP.
Learning Generalized Policy Classes for Stochastic Shortest Path Problems
This paper proposes an approach that uses canonical abstractions to compute generalized policies and represents them as AND-OR graphs that translate to simple non-deterministic, memoryless con- trollers and shows that it is promising, often computing optimal policies significantly faster than state-of-art SSP solvers.
Abstraction in Situation Calculus Action Theories
A general framework for agent abstraction based on the situation calculus and the ConGolog agent programming language is developed and the notion of complete abstraction where all actions that the high level thinks can happen can in fact occur at the low level is characterized.
A I ] 2 6 M ar 2 02 1 Generalized Planning as Heuristic Search
This paper defines a novel GP solution space that is independent of the number of planning instances in a GP problem, and the size of these instances, and presents the first native heuristic search approach to GP.


Generalized Planning with Procedural Domain Control Knowledge
Experiments show that an off-the-shelf classical planner, using procedural DCK as callable procedures, can compute generalized plans in a wide range of domains including non-trivial ones, such as sorting variable-size lists or DFS traversal of binary trees with variable size.
Directed Search for Generalized Plans Using Classical Planners
The resulting hybrid approach shows that solving only a few, small, classical planning problems can be sufficient to produce a generalized plan that applies to infinitely many problems with unknown numbers of objects.
A Generic Technique for Synthesizing Bounded Finite-State Controllers
This paper proposes a generic framework and related solver for synthesizing bounded finite-state controllers, and shows its instantiations to three different applications, including generalized planning, planning programs and service composition under partial observability and controllability.
Using Finite-State Automata to Model and Solve Planning Problems
This paper presents the new formalism that is based on finitestate automata (FSA), and that represents an alternative to the SAS (state variables), providing thus a novel platform for development of the modern planners.
A Correctness Result for Reasoning about One-Dimensional Planning Problems
This paper identifies a class of infinite planning problems, which is called one-dimensional (1d), and proves a correctness result that 1d problems can be verified by finite means, and identifies a practical algorithm that does this verification practically, and a planner based on this verification algorithm efficiently generates provably correct plans for 1D problems.
Planning with Temporally Extended Goals Using Heuristic Search
This paper translates an instance of a planning problem with TEGs into an equivalent classical planning problem, and exploits heuristic search to determine a plan using propositional linear temporal logic.
Automaton Plans
A novel solution concept called automaton plans is introduced in which plans are represented using hierarchies of automata, which are strictly more expressive than macros, but strictly less expressive than HTNs and certain representations allowing efficient sequential access to the operators of the plan.
Computing Plans with Control Flow and Procedures Using a Classical Planner
A compilation that enhances a given classical planning task to compute plans that contain control flow and procedure calls is proposed that can compress classical planning solutions and that these compressed solutions can solve planning tasks with multiple tests.
Automatic Derivation of Finite-State Machines for Behavior Control
This paper presents a method for deriving controllers automatically from models that represent a class of contingent problems where actions are deterministic and some fluents are observable.
The Fast Downward Planning System
  • M. Helmert
  • Computer Science
    J. Artif. Intell. Res.
  • 2006
A full account of Fast Downward's approach to solving multivalued planning tasks is given and a new non-heuristic search algorithm called focused iterative-broadening search, which utilizes the information encoded in causal graphs in a novel way is presented.