Sciweavers

46 search results - page 1 / 10
» Complexity Analysis of Admissible Heuristic Search
Sort
View
IJCAI
1989
14 years 16 hour ago
Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...
Shie-rei Huang, Larry S. Davis
AAAI
2007
14 years 1 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su
AIPS
2007
14 years 1 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
AIPS
2008
14 years 1 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein