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

Motion recognition by natural language including success and failure of tasks for co-working robot with human

TL;DR: The proposed framework for robots including a success/failure classification of tasks based on natural language representation was implemented and experiments confirmed that the proposed method identifies various motion types and provides natural language expressions.
Journal ArticleDOI

Human-guided Collaborative Problem Solving: A Natural Language based Framework

TL;DR: The ability of this framework to address the key challenges of collaborative problem solving is illustrated by demonstrat-ing it on a collaborative building task in a Minecraft-based blocksworld domain.
Dissertation

Episodic Memory: Foundation of Explainable Autonomy

TL;DR: A theory of episodic memory is presented that enables intelligent agents to remember their personal experience and make known their internal decision making process to the users.
Dissertation

Generación automática de diseños de aprendizaje: diferentes enfoques de planificación

TL;DR: In this article, a tesis propone e implementa diversos algoritmos for the generation of the información necesaria for the planificación inteligente and automatizada of secuencias adaptadas de aprendizaje adaptadas a diversos perfiles of todos los estudiantes of a curso, without necesidad of the intervencion manual de un experto en planificacion.

Learning hierarchical task networks from traces and semantically annotated tasks

TL;DR: This dissertation presents and evaluates a framework in which HTN methods can be automatically learned from a classical planning domain description, a set of example pairs of planning states from that domain with plans applicable in those states, and aset of annotated tasks for that domain.
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)