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
Posted Content
An Overview of Hierarchical Task Network Planning
Ilce Georgievski,Marco Aiello +1 more
TL;DR: A basis for defining dierent formal models of hierarchical planning is provided, and two models that comprise a large portion of HTN planners are defined, which are analysed and compared based on a variety of properties organised in five segments, namely domain authoring, expressiveness, competence, performance and applicability.
Patent
Method and apparatus for a routing agent
TL;DR: In this article, a method and apparatus for a route calculation engine is described, which comprises identifying a plurality of locations at which the resource may be available and creating an optimal route through the plurality of location, the route assuring that the resource will be found regardless of availability at any one location.
Journal ArticleDOI
Abductive logic programming agents with destructive databases
Robert A. Kowalski,Fariba Sadri +1 more
TL;DR: An agent language that combines agent functionality with a state transition theory and model-theoretic semantics, based on abductive logic programming, but employs a simplified state-free syntax, with an operational semantics that uses destructive updates to manipulate a database, which represents the current state of the environment.
Book ChapterDOI
Goal-Driven autonomy with case-based reasoning
TL;DR: The GDA framework is described and an algorithm that uses CBR to support it is described, including an empirical study with a multiagent gaming environment in which this CBR algorithm outperformed a rule-based variant of GDA as well as a non-GDA agent that is limited to dynamic replanning.
Extending PDDL to nondeterminism, limited sensing and iterative conditional plans
TL;DR: NPDDL’s extensions are designed to retain backward compatibility with PDDL, and with an emphasis on compactness of the representation, and a powerful, user-friendly plan language to go together with NPDDL is defined.
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.