Sciweavers

213 search results - page 6 / 43
» Heuristics for Planning with Action Costs
Sort
View
AI
2008
Springer
13 years 7 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 9 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
JAIR
2011
134views more  JAIR 2011»
13 years 2 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
WOWMOM
2006
ACM
110views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Minimum Cost Wireless Broadband Overlay Network Planning
Wireless broadband networks, especially WiMAX networks, have emerged in the industry recently and many challenging research issues arise. In this paper, we proposed a heuristic cl...
Peng Lin, Hung Q. Ngo, Chunming Qiao, Xin Wang, Ti...
JAIR
2008
111views more  JAIR 2008»
13 years 7 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak