Sciweavers

226 search results - page 17 / 46
» Heuristic Search Planning with BDDs
Sort
View
IJCAI
2003
15 years 1 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
AAAI
2008
15 years 2 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
AAAI
2007
15 years 2 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
AIPS
2000
15 years 1 months ago
Distance-Based Goal-Ordering Heuristics for Graphplan
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
Subbarao Kambhampati, Romeo Sanchez Nigenda
IPPS
2003
IEEE
15 years 5 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...