1639 search results - page 5 / 328 » Anytime Heuristic Search |
AI
2008
Springer
13 years 7 months ago
2008
Springer
ICTAI
1994
IEEE
13 years 11 months ago
1994
IEEE
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
IROS
2006
IEEE
14 years 25 days ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
HEURISTICS
2002
13 years 6 months ago
2002
HEURISTICS
2002
13 years 6 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...