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
Journal ArticleDOI

Adaptive and intelligent robot task planning for home service: A review

TL;DR: In this article , the authors explored primary sources of uncertainty in-depth and summarized three challenges, i.e., reliable planning under uncertain and incomplete information, efficient planning for complex tasks, and scalable planning for task generalization.
Journal ArticleDOI

Logic programming for deliberative robotic task planning

TL;DR: A survey on recent advances in the application of logic programming to the problem of task planning can be found in this paper , where the authors analyze different planners and their suitability for specific robotic applications, based on expressivity in domain representation, computational efficiency and software implementation.

The Visual Narrative Engine: A Computational Model of the Visual Narrative Parallel Architecture.

TL;DR: In this article, the authors introduce a computational model of a proposed set of cognitive structures and processes involved in interpreting visual narratives (specifically, comics), including spatial semantics and event structure semantics.

Hierarchical Planning in the IPC

TL;DR: This paper proposes to create a new track for the IPC in which hierarchical planners will compete, which will result in a standardised description language, broader support for core features of that language among planners, a set of benchmark problems, a means to fairly and objectively compare HTN planners, and for new challenges for planners.
Proceedings Article

Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning.

TL;DR: This work provides a way to accomplish focusing information directly into the planning domain’s operators, without any need to modify the planning algorithm itself, which enables the above planners to solve larger problems and to solve them much more quickly.
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)