Sciweavers

176 search results - page 1 / 36
» Additive-Disjunctive Heuristics for Optimal Planning
Sort
View
AIPS
2008
13 years 7 months ago
Additive-Disjunctive Heuristics for Optimal Planning
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
CP
2007
Springer
13 years 11 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
PAAMS
2010
Springer
13 years 9 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
AAAI
2011
12 years 4 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
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
13 years 10 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...