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
Transfer Learning in Integrated Cognitive Systems
Daniel G. Shapiro,Pat Langley,David J. Stracuzzi,Dana Nau,Alan Fern,Raymond J. Mooney,Peter Stone,Pedro Domingos +7 more
TL;DR: The ISLE Transfer Learning project was a three year DARPA-funded research effort whose goal was to enable machines to acquire knowledge in one domain and use it to improve performance in another.
Book ChapterDOI
Multi-task Planning with the Consideration of Task Priority
TL;DR: This paper improves JSHOP2 planner by adding priorities to different task lists and task items, and adjusting the order of task execution according to priority, and gets the results validate the effectiveness of the method.
Approach Based on Visual Perception
TL;DR: A visual perception system for non-player characters (NPCs) along with a short-term memory (working memory) are implemented so that NPCs will have access to only limited information and have to build their plans and make their decisions based on what they can perceive from their surrounding environment.
FLOOD: A Planning Framework for Reasoning with Linguistic Data
TL;DR: This paper presents the FLOOD Planning Platform, an environment for authoring and utilizing simple linguistic planning domains and algorithms, and the current implementation is based on the FLECS algorithm and performs simple inference and subquerying tasksbased on the output of the text processor.
Creating a Cognitive Agent in a Virtual World: Planning, Navigation, and Natural Language Generation
TL;DR: This dissertation develops human agents that make plans, navigate through complex environments, and communicate with one another that can be tightly controlled by content designers who wish to script their virtual world behavior.
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.