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
A Knowledge Driven Approach to Adaptive Assistance Using Preference Reasoning and Explanation.
TL;DR: A knowledge-driven approach provides transparency to reasoning about preferences, assistance, and explanations, thereby facilitating the incorporation of user feedback and allowing the robot to learn and adapt to the user.
Proceedings Article
Punch and Judy AI Playset: A Generative Farce Manifesto, Or, The Tragical Comedy or Comical Tragedy of Predicate Calculus
TL;DR: It is argued that some technical limitations of interactive narrative systems can be ameliorated through careful choice of genre and style, and a number of properties of farce that make it a particularly attractive choice.
Dissertation
CAMP-BDI: an approach for multiagent systems robustness through capability-aware agents maintaining plans
TL;DR: The primary contribution of this thesis is the algorithmic design of the CAMP-BDI (Capability Aware, Maintaining Plans) approach; a modification of the BDI reasoning cycle which provides agents with beliefs and introspective reasoning to anticipate increased risk of failure and pro-actively modify intended plans in response.
DissertationDOI
Hierarchical planning under uncertainty
TL;DR: The main goal of this thesis is to create a similar planning approach suited for planning domains that exhibit uncertainty, modeled as Partially Observable Markov Decision Processes, based on a newly introduced suitable policy representation formalism called logical finite state controllers.
Journal ArticleDOI
Learning to Plan Hierarchically from Curriculum
TL;DR: This work proposes a simple method for learning new abstract skills, using successful trajectories stemming from completing the goals of a curriculum, and shows that both conditions and abstract skills can be learned simultaneously while planning, even in stochastic domains.
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.