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 Article
Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
Hisashi Hayashi,Ken Satoh +1 more
TL;DR: A dynamic hierarchical task network (HTN) planning method that considers legal and ethical norms while planning multihop data transfers and data analyses/transformations and shows that data-transfer tasks can be represented by the task-decomposition rules of total-order HTN planning.
Journal ArticleDOI
Using meta-reasoning for incremental repairs in multi-object robot manipulation tasks
TL;DR: In this paper , a meta-reasoning architecture along with robotics principles is employed to ground nominal scenarios for table-top scenario using perceptual expectations based on the concept of occupancy grids and key point representations.
Planning and Acting with Hierarchical Input/Output Automata
TL;DR: The representation is formally defined and it is proved that the two operations of parallel and hierarchical composition are distributive, which is essential for the correctness and completeness of the proposed planning algorithm.
Proceedings ArticleDOI
Action Preparation and Replanning in Manipulation
Hisashi Hayashi,Hideki Ogawa +1 more
TL;DR: A method to integrate planning, action execution, speculative next action preparation, replanning, and action suspension based on Hierarchical Task Network (HTN) planning is introduced and it is shown that this method is effective for pick-andplace manipulation in dynamic environments.
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.