226 search results - page 16 / 46 » Heuristic Search Planning with BDDs |
AIPS
2010
15 years 2 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
IJCAI
2007
15 years 1 months ago
2007
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
94
Voted
JAIR
2006
14 years 11 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
101
click to vote
NIPS
2007
15 years 1 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
129
click to vote
PUK
2003
15 years 1 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...