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
Book ChapterDOI
Robotic Systems Architectures and Programming
TL;DR: This presentation explains how robot systems must work to achieve tasks while monitoring for, and reacting to, unexpected situations, and how doing all this concurrently and asynchronously adds immensely to system complexity.
Journal ArticleDOI
A Call for Knowledge- Based Planning
TL;DR: The terms knowledge-based and primitive-action planning are defined and an analogy from the current focus of the planning community on disjunctive planners to the experiences of the machine learning community over the past decade is drawn.
Book ChapterDOI
Representation and Structure-Based Similarity Assessment for Agile Workflows
TL;DR: This paper presents a case-based approach to representation and index-based retrieval of past workflows in order to give authoring support for adaptation of recent workflow instances.
ReportDOI
Building explainable artificial intelligence systems
TL;DR: A modular and generic architecture for explaining the behavior of simulated entities is presented and its application to the Virtual Humans, a simulation designed to teach soft skills such as negotiation and cultural awareness is described.
Proceedings ArticleDOI
Neural Task Graphs: Generalizing to Unseen Tasks From a Single Video Demonstration
De-An Huang,Suraj Nair,Danfei Xu,Yuke Zhu,Animesh Garg,Li Fei-Fei,Silvio Savarese,Juan Carlos Niebles +7 more
TL;DR: Neural Task Graph (NTG) as mentioned in this paper uses conjugate task graph as the intermediate representation to modularize both the video demonstration and the derived policy, which achieves inter-task generalization on two complex tasks.
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.