HiPOP: Hierarchical Partial-Order Planning

@inproceedings{Bechon2014HiPOPHP,
  title={HiPOP: Hierarchical Partial-Order Planning},
  author={Patrick Bechon and M. Barbier and G. Infantes and C. Lesire and V. Vidal},
  booktitle={STAIRS},
  year={2014}
}
This paper describes a new planner, HiPOP (Hierarchical Partial-Order Planner), which is domain-configurable and uses POP techniques to create hierarchical time-flexible plans. HiPOP takes as inputs a description of a domain, a problem, and some optional userdefined search-control knowledge. This additional knowledge takes the form of a set of abstract actions with optional methods to achieve them. HiPOP uses this knowledge to enrich the output by providing a hierarchical time-flexible partial… Expand
PYHIPOP– Hierarchical Partial-Order Planner
PYHIPOP is a hierarchical partial-order planner, aimed at solving Hierarchical Task Network (HTN) planning problems. The current planner version is a re-coding of a version originally developed byExpand
Using hybrid planning for plan reparation
TLDR
This work proposes a plan repair algorithm designed to be used in a real-life setting for a team of autonomous robots and shows that using this knowledge can help the reparation, even when some half-executed abstract actions are present in the plan. Expand
Forward Chaining Hierarchical Partial-Order Planning
TLDR
This paper presents two new planning algorithms, one of which combines full utilization of the delayed action ordering commitment of partialorder planning with grounded forward search guided by a temporally informed heuristic, and the other introduces hierarchical information in the form of abstract actions. Expand
A Hierarchical Planner based on Set-theoretic Models: Towards Automating the Automation for Autonomous Systems
TLDR
A set-theoretic approach is used to model declarative and procedural knowledge which allows for flexible hierarchies of planning tasks and presents two use-cases of an autonomous manufacturing system to highlight the capabilities of the system. Expand
FAPE: a Constraint-based Planner for Generative and Hierarchical Temporal Planning
TLDR
A temporal planner, called FAPE, is proposed, which supports many of the expressive temporal features of the ANML modeling language without loosing efficiency and is shown to be competitive with less expressive planners and often superior when hierarchical control knowledge is provided. Expand
Temporal and Hierarchical Models for Planning and Acting in Robotics
TLDR
It is argued that a successful integration with a robotic system requires the planner to have capacities for both temporal and hierarchical reasoning, and a model for temporal planning unifying the generative and hierarchical approaches is presented. Expand
Hierarchische hybride Planung für mobile Roboter
TLDR
This thesis presents the hierarchical hybrid planner CHIMP which combines the advantages of hierarchical planning and hybrid planning with different forms of knowledge as a MetaCSP [28, 104]. Expand
HEART: Using Abstract Plans as a Guarantee of Downward Refinement in Decompositional Planning
TLDR
The HEART planner is proposed, a real-time decompositional planner based on a hierarchical version of Partial Order Causal Link (POCL), which aims to leave the range of potential applications as wide as possible but the main targets are human intent recognition and assistive robotics. Expand
HTN Planning as Heuristic Progression Search
TLDR
This article introduces two novel progression algorithms that avoid unnecessary branching when the problem at hand is partially ordered and shows that both are sound and complete and introduces a method to apply arbitrary classical planning heuristics to guide the search in HTN planning. Expand
A Depth-Balanced Approach to Decompositional Planning for Problems where Hierarchical Depth is Requested
Hybrid planning with task insertion for solving classical planning problems, or decompositional planning, combines partial-order causal link planning with hierarchical task networks, where steps inExpand
...
1
2
3
...

References

SHOWING 1-10 OF 23 REFERENCES
Hybrid Planning for Partially Hierarchical Domains
TLDR
This paper provides a generalized plan-space refinement that is capable of handling non-primitive actions and provides a principled way of handling partially hierarchical domains, while preserving systematicity, and respecting the user-intent inherent in the reduction schemas. Expand
The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning
TLDR
A simple formalism that extends classical planning to include problem decomposition using methods, and a planning algorithm based on this formalism, GoDeL (Goal Decomposition with Landmarks), is defined, which is sound and complete irrespective of whether the domain knowledge is complete. Expand
Decomposition and Causality in Partial-order Planning
We describe DPOCL, a partial-order causal link planner that includes action decomposition. DPOCL builds directly on the SNLP algorithm (McAllester & Rosenblitt 1991), and hence is clear and simple,Expand
Branching and pruning: An optimal temporal POCL planner based on constraint programming
TLDR
A domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules and is competitive with the best parallel planners in the special case in which actions have all the same duration. Expand
Efficiently Handling Temporal Knowledge in an HTN Planner
TLDR
New features include a sound partial order metric structure, deadlines, temporal landmarking or synchronization capabilities built on top of a Simple Temporal Network and an efficient constraint propagation engine boosted by exploiting the causal structure of plans. Expand
VHPOP: Versatile Heuristic Partial Order Planner
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990's on flaw selection strategies for POCL planning, and combinesExpand
Durative Planning in HTNs
TLDR
This paper provides a method for encoding PDDL Level 3 durative actions in an HTN formalism compatible with the SHOP2 planner, and illustrates the utility of the technique with experimental results on the IPC 2004 AIRPORT domain. Expand
Angelic Semantics for High-Level Actions
TLDR
This work proposes an angelic semantics for HLAs, the key concept of which is the set of states reachable by some refinement of a high-level plan, representing uncertainty that will ultimately be resolved in the planning agent's own best interest. Expand
Plan Repair as an Extension of Planning
TLDR
A straightforward method to extend planning techniques such that they are able to repair plans is proposed, and a heuristic for unrefinement that can make use of an arbitrary existing planning technique is presented. Expand
Merging of Temporal Plans Supported by Plan Repairing
TLDR
This paper presents a plan merging algorithm to coordinate two temporal plans, where one plan is for the achievement of a reactive goal, and thus has more priority, while the other is for a proactive goal. Expand
...
1
2
3
...