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

Planning and Failure Detection

TL;DR: The capacity for planful behavior is one of the major characteristics of an intelligent agent and agents can actively try to reduce their uncertainties when acting continuously in such an environment, for example by deliberative exploration, cooperation with others, and monitoring of failures.
Journal ArticleDOI

A Rudimentary Mission Planning System for Marine Autonomous Surface Ships

TL;DR: In this article , a basic mission planning system is proposed to generate a feasible and efficient sequence of high-level actions (plans) that are subsequently executed by the control system.
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)