Sciweavers

565 search results - page 38 / 113
» Heuristics for Planning with SAT
Sort
View
AAAI
2008
15 years 2 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
AIPS
2008
15 years 2 months ago
Useless Actions Are Useful
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 4 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
AIPS
2009
15 years 29 days ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert
CP
2005
Springer
15 years 5 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...