Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/an-upper-bound-on-the-time-complexity-of-iterative-deepening-a-4rP9DuvBp1
References (29)
-
Bai Zhijiang, Han Wei (2005)
Analysis of iterative-deepening-A~*Journal of Shanghai, Maritime University
-
D. Gelperin (1977)
On the optimality of A*Art. Int., 8
-
J. Pearl (1983)
Knowledge Versus Search: A Quantitative Analysis Using A*Artif. Intell., 20
-
A. Bagchi, A. Mahanti (1985)
Three approaches to heuristic search in networksJ. ACM, 32
-
P.E. Hart, N.J. Nilsson, B. Raphael (1972)
A formal basis for the heuristic determination of minimum cost pathsSIGART Newsletter, 37
-
A. Bagchi, A. Mahanti (1983)
Search Algorithms Under Different Kinds of Heuristics—A Comparative StudyJ. ACM, 30
-
A. Martelli (1977)
On the Complexity of Admissible Search AlgorithmsArtif. Intell., 8
-
L. Méro (1984)
A Heuristic Search Algorithm with Modifiable EstimateArtif. Intell., 23
-
J. Gaschnig (1979)
Performance measurement and analysis of certain search algorithms. -
I. Pohl (1973)
The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving -
N. Nilsson (1971)
Problem-solving methods in artificial intelligence -
(1977)
Practical and theoretical considerations in heuristic search algorithms -
A. Bagchi, A. Sen (1988)
Average-case analysis of heuristic search in tree-like networks -
B.G. Patrick (1991)
Ph.D. dissertation -
R. Dechter, J. Pearl (1985)
Generalized best-first search strategies and the optimality of A*J. ACM, 32
-
A. Mahanti, K. Ray (1988)
Search in Artificial Intelligence -
I. Pohl (1977)
Machine Intelligence 8 -
N. Nilsson (1980)
Principles of Artificial IntelligenceIEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-3
-
R. Dechter, J. Pearl (1988)
The optimality of A -
I. Pohl (1970)
Heuristic Search Viewed as Path Finding in a GraphArtif. Intell., 1
-
R. Korf (1988)
Optimal path-finding algorithms* -
P. Hart, N. Nilsson, B. Raphael (1968)
A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Trans. Syst. Sci. Cybern., 4
-
J. Pearl (1984)
Intelligent Search Strategies for Computer Problem Solving -
(1970)
First results on the effect of error in heuristic search -
N. Huyn, R. Dechter, J. Pearl (1980)
Probabilistic Analysis of the Complexity of A*Artif. Intell., 15
-
J. Pearl (1984)
Heuristics - intelligent search strategies for computer problem solving -
A. Mahanti, K. Ray (1988)
Network search algorithms with modifiable heuristics -
R. Dechter, J. Pearl (1983)
The Optimality of A* Revisited -
R. Korf (1985)
Depth-First Iterative-Deepening: An Optimal Admissible Tree SearchArtif. Intell., 27
- Publisher
- Springer Journals
- Copyright
- Copyright
- Subject
- Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/BF01543478
- Publisher site
- See Article on Publisher Site
Abstract
This paper establishes an upper bound on the time complexity of iterative-deepening-A* (IDA*) in terms of the number of states that are surely-expanded by A* during a state space tree search. It is shown that given an admissible evaluation function, IDA* surely-expands in the worst caseN(N+1)/2 states, whereN is the number of states that are surely-expanded by A*. The conditions that give rise to the worst case performance of IDA* on any state space tree are described. Worst case examples are also given for uniform and non-uniform state space trees.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 6, 2005