Sciweavers

42 search results - page 3 / 9
» Hierarchical Heuristic Forward Search in Stochastic Domains
Sort
View
AIPS
2000
13 years 6 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
13 years 11 months ago
Continuous lunches are free!
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
Anne Auger, Olivier Teytaud
JAIR
2008
107views more  JAIR 2008»
13 years 4 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
IJCAI
2001
13 years 6 months ago
Planning with Resources and Concurrency: A Forward Chaining Approach
Recently tremendous advances have been made in the performance of AI planning systems. However increased performance is only one of the prerequisites for bringing planning into th...
Fahiem Bacchus, Michael Ady
AIPS
2009
13 years 6 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith