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
Journal ArticleDOI
Landmarks in Hybrid Planning
Mohamed Elkawkagy,Heba Elbeh +1 more
TL;DR: This paper will adopt landmark concept to hybrid planning setting - a method that combines reasoning about procedural knowledge and causalities in the context of hierarchical planning with landmark technique in the classical planning to construct a transformation technique to transform the hybrid planning domain into a classical domain model.
Patent
Plan executing apparatus, method of plan execution, and computer program product therefor
TL;DR: A plan executing apparatus includes an executing unit that executes a plan which is a sequence of processes, a processing state retaining unit that retains a target object of the plan, an execution information retaining unit which is information relating to execution of a plan in execution, an interrupt instruction accepting unit that accepts interrupt instruction during execution, and an interrupt possibility determining unit that determines whether the interrupting plan is to be executed or not based on the processing state, the execution information, and the interrupt information as discussed by the authors.
Journal Article
Planning under uncertainty with abstraction hierarchies
TL;DR: This article presents a hierarchical planner to actuate in uncertain domains named HIPU – Hierarchical Planner under Uncertainty, which uses an extension of the Alpine method to act under uncertainty conditions.
Book ChapterDOI
Game AI for Domination Games
TL;DR: This chapter presents an overview of several techniques to build game AI for domination games, a game style in which teams compete for control of map locations and has been very popular over the years.
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.