Sciweavers

50 search results - page 2 / 10
» Heuristics and Symmetries in Classical Planning
Sort
View
AI
2008
Springer
13 years 10 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIPS
2006
13 years 11 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIPS
2000
13 years 11 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
AAAI
2006
13 years 11 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AIPS
2006
13 years 11 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith