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
Self monitoring goal driven autonomy agents
TL;DR: The techniques presented herein advance the current state of the art in self-monitoring, demonstrating improved performance in a variety of challenging domains.
Journal Article
Design, implementation and run-time evolution of a mission-based multiagent system
TL;DR: The mission is a high-level abstraction that combines the overall goal of a system, the means and the process of achieving that goal, and is the basis from which agents can be automatically generated.
Using I-X Process Panels as Intelligent To-Do Lists for Agent Coordination in Personnel Recovery
TL;DR: The result shows that an I-X application can be usefully used in so-called "Command Post Exercises" eliminating some of the basic problems that often occur.
Proceedings Article
Applying monte-carlo tree search in HTN planning
TL;DR: This work investigates Monte-Carlo tree search (MCTS) as a new algorithmic alternative in HTN planning, and implements combinations of MCTS with heuristic search in Panda and JSHOP to address lifted (non-grounded) planning.
Pre-processing planning domains containing Language Axioms
Marina Davidson,Max Garagnani +1 more
TL;DR: Preliminary experimental results seem to suggest that the approach identified is sound and may lead to improvements in planning performance, and the method presented can be generalised and used with any set of axioms of the type considered.
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.