Sciweavers

2655 search results - page 34 / 531
» User-Tailored Plan Presentation
Sort
View
AIPS
2010
15 years 4 days ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
AIPS
2008
15 years 4 days ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
AIPS
2003
14 years 11 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
AAAI
1994
14 years 11 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
IJCAI
1989
14 years 11 months ago
Control of Refitting during Plan Reuse
In plan reuse, refitting is the process of modifying an existing plan to make it applicable to a new problem situation. An efficient refitting strategy needs to be conservative, i...
Subbarao Kambhampati, James A. Hendler