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
Robótica cognitiva: programação baseada em lógica para controle de robôs
TL;DR: This paper shows how a Lego® MindStorms™ robot can be used to implement a software agent capable of performing high level functions specified in IndiGolog - a logical language to write robot control programs, based on Situation Calculus.
Dissertation
Architecture for planning and execution of missions with fleets of unmanned vehicles
Muñoz Morera,Jorge Juan +1 more
TL;DR: Esta tesis presenta contribuciones en el campo de the planificacion automatica y the programacion de tareas, the rama of the inteligencia artificial that se ocupa de la realizacion of estrategias o secuencias de acciones tipicamente para su ejecucion by parte of vehiculos no tripulados, robots autonomos y/o agentes inteligent
Proceedings ArticleDOI
Upward-Backtracking Mechanism Infused HTN Planning Approach for Space Operation
TL;DR: The paper infuses upward-backtracking mechanism to improve HTN algorithm, which could extend the searching range of planner and reduce the compiling of prescription database largely.
HDIP 2011 3rd Workshop on Heuristics for Domain-independent Planning
TL;DR: This work shows how to apply label reduction – not distinguishing between certain groups of operators – without incurring any information loss, while potentially reducing bisimulation size exponentially.
Extended Abstract: Recognizing Plan/Goal Abandonment
TL;DR: This paper describes ongoing efforts to extend work on the Probabilistic Hostile Agent Task Tracker (PHATT) to handle the problem of goal abandonment, and is discussing both probabilistic intent inference and the PHATT system and assumes the reader is familiar with these areas.
References
More filters
Book
Principles of Artificial Intelligence
TL;DR: This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Book
STRIPS: a new approach to the application of theorem proving to problem solving
Richard Fikes,Nils J. Nilsson +1 more
TL;DR: In this article, the authors describe a problem solver called STRIPS that attempts to find a sequence of operators in a spcce of world models to transform a given initial world model into a model in which a given goal formula can be proven to be true.
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.
Journal ArticleDOI
Planning for Conjunctive Goals
TL;DR: Theorems that suggest that efficient general purpose planning with more expressive action representations is impossible are presented, and ways to avoid this problem are suggested.
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".