Sciweavers

655 search results - page 13 / 131
» Evolving Heuristics for Planning
Sort
View
AAAI
2000
15 years 1 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
AIPS
2010
15 years 2 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
IJCAI
2007
15 years 1 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan
GIS
2007
ACM
16 years 25 days ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
AAAI
2011
13 years 11 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis