Sciweavers

6957 search results - page 153 / 1392
» Planning before plans
Sort
View
AIPS
2006
13 years 9 months ago
Probabilistic Planning with Nonlinear Utility Functions
Researchers often express probabilistic planning problems as Markov decision process models and then maximize the expected total reward. However, it is often rational to maximize ...
Yaxin Liu, Sven Koenig
IJCAI
2001
13 years 9 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann
IJCAI
2003
13 years 9 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
UAI
2000
13 years 9 months ago
Approximately Optimal Monitoring of Plan Preconditions
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
Craig Boutilier
CCCG
1996
13 years 9 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...