Open AccessProceedings Article
UMCP: a sound and complete procedure for hierarchical task-network planning
Kutluhan Erol,James A. Hendler,Dana S. Nau +2 more
- pp 249-254
Reads0
Chats0
TLDR
This paper presents a formal syntax and semantics for HTn planning and is able to define an algorithm for HTN planning and prove it sound and complete.Abstract:
One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework In particular, no one has yet presented a clear and concise HTN algorithm that is sound and complete In this paper, we present a formal syntax and semantics for HTN planning Based on this syntax and semantics, we are able to define an algorithm for HTN planning and prove it sound and completeread more
Citations
More filters
Journal ArticleDOI
Sold!: auction methods for multirobot coordination
Brian P. Gerkey,Maja J. Matarić +1 more
TL;DR: The primary contribution of the paper is to show empirically that distributed negotiation mechanisms such as MURDOCH are viable and effective for coordinating physical multirobot systems.
Web Service Composition - Current Solutions and Open Problems
Biplav Srivastava,Jana Koehler +1 more
TL;DR: This work discusses what makes the Web service composition so special and derive challenges for the AI planning community and compares these approaches to the problems of modeling, composing, executing, and verifying Web services.
Proceedings Article
SHOP: Simple Hierarchical Ordered Planner
TL;DR: 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.
Journal ArticleDOI
Designing for flexible interaction between humans and automation: delegation interfaces for supervisory control.
TL;DR: It is argued that delegation requires a shared hierarchical task model between supervisor and subordinates, used to delegate tasks at various levels, and offer instruction on performing them, and an architecture for machine-based delegation systems based on the metaphor of a sports team's “playbook” is developed.
Book
Automated Planning and Acting
TL;DR: This book presents a comprehensive paradigm of planning and acting using the most recent and advanced automated-planning techniques, and explains the computational deliberation capabilities that allow an actor to reason about its actions, choose them, organize them purposefully, and act deliberately to achieve an objective.
References
More filters
Proceedings Article
Commitment strategies in planning: a comparative analysis
TL;DR: It is shown that partial-order planning can be more efficient than total- order planning, but it is also shown that this is not necessarily so.
Proceedings Article
On the complexity of domain-independent planning
TL;DR: This paper examines how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators and shows how the time complexity varies depending on a wide variety of conditions.
Proceedings Article
On the utility of systematicity: understanding tradeoffs between redundancy and commitment in partial-ordering planning
TL;DR: It is argued that the performance of a POPI planner depends more closely on the way it deals with the tradeoff between redundancy and commitment, than with the systematicity of its search.
Book ChapterDOI
When is planning decidable
TL;DR: In this paper, the authors show conditions under which planning is decidable and undecidable. But their results on this topic solve an open problem posed in (Chapman 1987), and clear up some difficulties with his undecidability theorems.
Proceedings Article
Refining and extending the procedural net
TL;DR: This paper presents a new definition for Plans, and it is suggested that Plan Net.