Open AccessProceedings Article
SHOP: Simple Hierarchical Ordered Planner
Dana S. Nau,Yue Cao,Amnon Lotem,Héctor Muñoz-Avila +3 more
- pp 968-975
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
Citations
More filters
Proceedings ArticleDOI
Iterative Bounding LAO
TL;DR: The Iterative Bounding LAO* algorithm is a new algorithm for e-optimal probabilistic planning problems where an absorbing goal state should be reached at a minimum expected cost from a given ini tial state.
Proceedings ArticleDOI
Development of a virtual coach scenario for hand therapy using LEAP motion
TL;DR: A virtual therapist (VT) was implemented to help the patient do his exercises at home in an engaging gamified environment and the idea of being coached by a VT was very welcomed by the test subjects.
Journal ArticleDOI
The ontology of drama
TL;DR: The ontology of drama is described, providing a formal systematization of the core notions about drama that leverages the theories and models of agency in the tradition of Artificial Intelligence.
Book ChapterDOI
A new HTN planning framework for agents in dynamic environments
TL;DR: The agent life cycle is extended so that the agent can handle partial-order plans and the plans are always kept valid according to the most recent knowledge and situation.
Proceedings Article
Plan-Based Configuration of a Group of Robots
TL;DR: This paper defines the idea of functional configuration, and proposes a plan-based approach to automatically generate a preferred configuration for a given task, environment, and set of resources.
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
Fahiem Bacchus,Froduald Kabanza +1 more
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.