scispace - formally typeset
Open AccessProceedings Article

SHOP: Simple Hierarchical Ordered Planner

Reads0
Chats0
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.
Abstract
SHOP (Simple Hierarchical Ordered Planner) is a domain-independent HTN planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goal-interaction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planning process, it can use highly expressive domain representations. For example, it can do planning problems that require complex numeric computations. • In our 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.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Impact: A Multi-Agent Framework with Declarative Semantics

TL;DR: The IMPACT project is described, which is able to deal with heterogenous and distributed data, can be realised on top of arbitrary legacy code, is built on a clear foundational basis, and scales up for realistic applications.
Proceedings Article

Object transition sequences: a new form of abstraction for HTN planners

TL;DR: EMS as mentioned in this paper is an implemented HTN planning algorithm using a novel form of abstraction, where a plan is viewed as a set of dynamic objects taking part in sequences of transitions, and it builds up plans using an Expand then Make-Sound cycle.
Book ChapterDOI

Users acting in Mixed Reality Interactive Storytelling

TL;DR: A first experiment in the adaptation of an Interactive Storytelling technique to a Mixed Reality system is described and the specificities of user interaction in the Mixed Reality context are introduced.
Proceedings Article

POIROT: integrated learning of web service procedures

TL;DR: After its first phase of development, POIROT has demonstrated it can learn some moderately complex hierarchical task models from semantic traces of user-generated service transaction sequences at a level that is approaching human performance on the same learning task.
Proceedings Article

A domain-independent system for case-based task decomposition without domain theories

TL;DR: This work presents DInCaD (Domain-Independent System for Case-Based Task Decomposition), a system that encompasses case retrieval, refinement, and reuse, following from the idea of reusing generalized cases to solve new problems.
References
More filters
Book

A Structure for Plans and Behavior

TL;DR: Progress to date in the ability of a computer system to understand and reason about actions is described, and the structure of a plan of actions is as important for problem solving and execution monitoring as the nature of the actions themselves.
Proceedings Article

UCPOP: a sound, complete, partial order planner for ADL

TL;DR: It is proved ucpop is both sound and complete for this representation and a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem".
Proceedings Article

Generating project networks

TL;DR: 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.
Journal ArticleDOI

Using temporal logics to express search control knowledge for planning

TL;DR: This work shows how domain dependent search control knowledge can be represented in a temporal logic, and then utilized to effectively control a forward-chaining planner.
Proceedings Article

Systematic nonlinear planning

TL;DR: A simple, sound, complete, and systematic algorithm for domain independent STRIPS planning by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation.
Related Papers (5)