Applications of SHOP and SHOP2

@article{Nau2005ApplicationsOS,
  title={Applications of SHOP and SHOP2},
  author={D. Nau and T. Au and O. Ilghami and U. Kuter and Hector Mu{\~n}oz-Avila and J. William Murdock and Dan Wu and F. Yaman},
  journal={IEEE Intelligent Systems},
  year={2005},
  volume={20},
  pages={34-41}
}
We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan's actions in the same order that the plan executor… Expand
Combining Heuristic Search with Hierarchical Task-Network Planning: A Preliminary Report
TLDR
H2O (short for Hierarchical Heuristic Ordered planner), a new Hierarchicals Task-Network (HTN) planning algorithm that can heuristically select the best task decompositions by using domainindependent state-based heuristics. Expand
Adaptation of Hierarchical Task Network Plans
TLDR
This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair, built on top of the HTN planner SHOP, and takes into account failed traces during plan adaptation/repair. Expand
totSAT - Totally-Ordered Hierarchical Planning Through SAT
TLDR
It is shown how totally-ordered HTN planning problems can be translated into a SAT formula, given this bound, and conducted an extensive empirical evaluation to compare the new planner against state-of-the-art HTN planners. Expand
Improving hierarchical task network planning performance by the use of domain-independent heuristic search
TLDR
It can be concluded that Pyhop-h can leverage domain independent heuristics and other techniques both to reduce the domain engineering burden and to solve more and larger problems rapidly especially for problems with a deep hierarchy of tasks. Expand
HATP: Hierarchical Agent-based Task Planner
TLDR
This paper describes the Hierarchical Agent-based Task Planner (HATP), a total-order HTN planner and gives an overview of its user-friendly language, which treats agents as distinct entities; its mechanisms for effective control over decomposition; and its integration into the larger robotics framework. Expand
Hierarchical task network planning with resources and temporal constraints
TLDR
An HTN planning algorithm named GSCCB-SHOP2 is proposed to handle multi-capacity discrete resources and complex temporal constraints simultaneously during planning to handle hierarchical task decomposition principle and expressiveness for domain knowledge representation. Expand
Verifying solutions of hierarchical planning problems
Plan-Verification is the task of determining whether a plan is a solution to a given planning problem. Any plan verifier has, apart from showing that verifying plans is possible in practice, a wideExpand
A hierarchical goal-based formalism and algorithm for single-agent planning
TLDR
A hierarchical goal-based planning formalism and a planning algorithm, GDP (Goal-Decomposition Planner), that combines some aspects of both HTN planning and domain-independent planning and allows the planning agent to use domain- independent heuristic functions to guide the application of both methods and actions. Expand
Hierarchical Goal Network Planning: Initial Results
TLDR
The HGN formalism is defined, how to prove correctness of HGN methods is illustrated, a planning algorithm called GNP (Goal Network Planner) is provided, and experimental results showing that GNP’s performance compares favorably to that of SHOP2 are presented. Expand
Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems
TLDR
This work proposes the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems, and outperforms existing HTN planners significantly. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
SHOP: Simple Hierarchical Ordered Planner
TLDR
In the authors' tests, SHOP was several orders of magnitude faster man Blackbox and several times faster than TLpian, even though SHOP is coded in Lisp and the other planners are coded in C. Expand
Automating DAML-S Web Services Composition Using SHOP2
TLDR
This work has proven the correspondence between the semantics of SHOP2 and the situation calculus semantics of the Process Model, and implemented a system which soundly and completely plans over sets of DAML-S descriptions using a SHop2 planner, and then executes the resulting plans over the Web. Expand
SHOP2: An HTN Planning System
TLDR
The features of SHOP2 which enabled it to excel in the competition are described, especially those aspects of SHop2 that deal with temporal and metric planning domains. Expand
HTN planning for Web Service composition using SHOP2
TLDR
A sound and complete algorithm is provided to translate OWL-S service descriptions to a SHOP2 domain and it is proved the correctness of the algorithm by showing the correspondence to the situation calculus semantics of OWl-S. Expand
Generating Project Networks
TLDR
The planner (NONLIN) and the Task Formalism (TF) used to hierarchically specify a domain are described, which can aid in the generation of project networks. Expand
Forward-Chaining Planning in Nondeterministic Domains
TLDR
The results suggest that the general technique for taking forward-chaining planners for deterministic domains and adapting them to work in nondeterministic domains preserves many of the desirable properties of these planners, such as the ability to use heuristic techniques to achieve highly efficient planning. Expand
The Nonlinear Nature of Plans
TLDR
A new information structure is described, called the procedural net, that represents a plan as a partial ordering of actions with respec to time, so that a problem-solving system using this representation can deal easily and directly with problems that are otherwise very difficult to solve. Expand
TALplanner: A temporal logic based forward chaining planner
We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented as formulas in the Temporal Action Logic (TAL). TAL is a narrative basedExpand
Utilizing Volatile External Information During Planning
TLDR
The results show conditions under which different query management strategies are preferable, and demonstrate that certain kinds of planning paradigms are more suited than others for planning with volatile information. Expand
Information Gathering During Planning for Web Service Composition
TLDR
This paper presents ENQUIRER, an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries. Expand
...
1
2
3
4
...