{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:57Z","timestamp":1747546917611},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01543478","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T02:14:28Z","timestamp":1113963268000},"page":"265-277","source":"Crossref","is-referenced-by-count":6,"title":["An upper bound on the time complexity of iterative-deepening-A*"],"prefix":"10.1007","volume":"5","author":[{"given":"Brian G.","family":"Patrick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Almulla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monroe M.","family":"Newborn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322359","volume":"30","author":"A. Bagchi","year":"1983","unstructured":"A. Bagchi and A. Mahanti, Search algorithms under different kinds of heuristics ? A comparative study, J. ACM 30 (1983) 1?21.","journal-title":"J. ACM"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","volume":"32","author":"A. Bagchi","year":"1985","unstructured":"A. Bagchi and A. Mahanti, Three approaches to heuristic search in networks, J. ACM 32 (1985) 1?27.","journal-title":"J. ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-8788-6_4","volume-title":"Search in Artificial Intelligence","author":"A. Bagchi","year":"1988","unstructured":"A. Bagchi and A.K. Sen, Average-case analysis of heuristic search in tree-like networks, in:Search in Artificial Intelligence, eds. L. Kanal and V. Kumar (Springer, New York, 1988) pp. 131?165."},{"key":"CR4","unstructured":"R. Dechter and J. Pearl, The optimality of A* revisited,Proc. 3rd AAAI Conf., Washington, DC (1983) pp. 95?99."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1989","unstructured":"R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality of A*, J. ACM 32 (1989) 505?536.","journal-title":"J. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-1-4613-8788-6_5","volume-title":"Search in Artificial Intelligence","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl, The optimality of A*, in:Search in Artificial Intelligence, eds. L. Kanal and V. Kumar (Springer, New York, 1988) pp. 166?199."},{"key":"CR7","series-title":"Technical Report CMU-CS-79-124","volume-title":"Ph.D. dissertation","author":"J. Gaschnig","year":"1979","unstructured":"J. Gaschnig, Performance measurement and analysis of certain search algorithms, Ph.D. dissertation, Technical Report CMU-CS-79-124, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA (1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0004-3702(77)90005-4","volume":"8","author":"D. Gelperin","year":"1977","unstructured":"D. Gelperin, On the optimality of A*, Art. Int. 8 (1977) 69?76.","journal-title":"Art. Int."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P.E. Hart","year":"1968","unstructured":"P.E. Hart, N.J. Nilsson and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Systems Sci. Cyber. SSC-4 (1968) 100?107.","journal-title":"IEEE Trans. Systems Sci. Cyber."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","volume":"37","author":"P.E. Hart","year":"1972","unstructured":"P.E. Hart, N.J. Nilsson and B. Raphael, Correction to ?A formal basis for the heuristic determination of minimum cost paths?, SIGART Newsletter 37 (1972) 28?29.","journal-title":"SIGART Newsletter"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(80)90045-4","volume":"15","author":"N. Huyn","year":"1980","unstructured":"N. Huyn, R. Dechter and J. Pearl, Probabilistic analysis of the complexity of A*, Art. Int. 15 (1980) 241?254.","journal-title":"Art. Int."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"R.E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Art. Int. 27 (1985) 97?109.","journal-title":"Art. Int."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-1-4613-8788-6_7","volume-title":"Search in Artificial Intelligence","author":"R.E. Korf","year":"1988","unstructured":"R.E. Korf, Optimal path-finding algorithms, in:Search in Artificial Intelligence, eds. L. Kanal and V. Kumar (Springer, New York, 1988) pp. 223?267."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-1-4613-8788-6_6","volume-title":"Search in Artificial Intelligence","author":"A. Mahanti","year":"1988","unstructured":"A. Mahanti and K. Ray, Network search algorithms with modifiable heuristics, in:Search in Artificial Intelligence, eds. L. Kanal and V. Kumar (Springer, New York, 1988) pp. 200?222."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90002-9","volume":"8","author":"A. Martelli","year":"1977","unstructured":"A. Martelli, On the complexity of admissible search algorithms, Art. Int. 8 (1977) 1?13.","journal-title":"Art. Int."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(84)90003-1","volume":"23","author":"L. M\u00e9r\u00f5","year":"1984","unstructured":"L. M\u00e9r\u00f5, A heuristic search algorithm with modifiable estimate, Art. Int. 23 (1984) 13?27.","journal-title":"Art. Int."},{"key":"CR17","volume-title":"Problem Solving Methods in Artificial Intelligence","author":"N.J. Nilsson","year":"1971","unstructured":"N.J. Nilsson,Problem Solving Methods in Artificial Intelligence (McGraw-Hill, New York, 1971)."},{"key":"CR18","unstructured":"N.J. Nilsson,Principles of Artificial Intelligence (Tioga, Palo Alto, CA, 1980)."},{"key":"CR19","volume-title":"Ph.D. dissertation","author":"B.G. Patrick","year":"1991","unstructured":"B.G. Patrick, An analysis of iterative-deepening-A*, Ph.D. dissertation, School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada (1991)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(83)90013-9","volume":"20","author":"J. Pearl","year":"1983","unstructured":"J. Pearl, Knowledge versus search: A quantitative analysis using A*, Art. Int. 20 (1983) 1?13.","journal-title":"Art. Int."},{"key":"CR21","volume-title":"Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"J. Pearl,Intelligent Search Strategies for Computer Problem Solving (Addison-Wesley, Menlo Park, CA, 1984)."},{"key":"CR22","first-page":"219","volume-title":"Machine Intelligence 5","author":"I. Pohl","year":"1970","unstructured":"I. Pohl, First results on the effect of error in heuristic search, in:Machine Intelligence 5, eds. B. Meltzer and D. Michie (American Elsevier, New York, 1970) pp. 219?236."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I. Pohl","year":"1970","unstructured":"I. Pohl, Heuristic search viewed as path finding in a graph, Art. Int. 1 (1970) 193?204.","journal-title":"Art. Int."},{"key":"CR24","unstructured":"I. Pohl, The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving,Proc. IJCAI 3, Stanford, CA (1973) pp. 20?23."},{"key":"CR25","first-page":"55","volume-title":"Machine Intelligence 8","author":"I. Pohl","year":"1977","unstructured":"I. Pohl, Practical and theoretical considerations in heuristic search algorithms, in:Machine Intelligence 8, eds. E.W. Elcock and D. Michie (Wiley, New York, 1977) pp. 55?72."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543478.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01543478\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:03:42Z","timestamp":1556892222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01543478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":25,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01543478"],"URL":"https:\/\/doi.org\/10.1007\/bf01543478","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}