On the value of good advice: the complexity of A* search with accurate heuristics

Authors:
Hang Dinh;Alexander Russell;Yuan Su
Affiliations:
Department of Computer Science & Engineering, University of Connecticut, Storrs, CT;Department of Computer Science & Engineering, University of Connecticut, Storrs, CT;Department of Computer Science & Engineering, University of Connecticut, Storrs, CT
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 10
Cited 4

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Generalized best-first search strategies and the optimality of A*

Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Randomized algorithms

Randomized algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Complexity analysis admissible heuristic search

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Time complexity of iterative-deepening-A

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Approximation algorithms

Approximation algorithms
Primal-dual schema based approximation algorithms

Theoretical aspects of computer science
Lower bounds for local search by quantum arguments

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

How good is almost perfect?

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Predicting the performance of IDA* using conditional distributions

Journal of Artificial Intelligence Research
Predicting the size of IDA*'s search tree

Artificial Intelligence
The time complexity of A* with approximate heuristics on multiple-solution search spaces

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 distance to a solution. We prove general upper bounds on the complexity of A* search, for both admissible and unconstrained heuristic functions, that depend only on the distribution of solution objective values. We go on to provide nearly matching lower bounds that are attained even by non-adversarially chosen solution sets induced by a simple stochastic model.