Sciweavers

565 search results - page 14 / 113
» Heuristics for Planning with SAT
Sort
View
CP
2007
Springer
14 years 2 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...
CP
2005
Springer
14 years 1 months ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Anbulagan, John K. Slaney
IJCAI
2001
13 years 9 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann