{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T00:43:08Z","timestamp":1775349788736,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161377","type":"print"},{"value":"9783642161384","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16138-4_26","type":"book-chapter","created":{"date-parts":[[2010,10,27]],"date-time":"2010-10-27T13:56:44Z","timestamp":1288187804000},"page":"253-262","source":"Crossref","is-referenced-by-count":23,"title":["A Survey and Classification of A* Based Best-First Heuristic Search Algorithms"],"prefix":"10.1007","author":[{"given":"Luis Henrique Oliveira","family":"Rios","sequence":"first","affiliation":[]},{"given":"Luiz","family":"Chaimowicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Koenig, S., Likhachev, M.: Improved fast replanning for robot navigation in unknown terrain. In: Proc. of the Int. Conf. on Robotics and Automation, pp. 968\u2013975 (2002)","DOI":"10.1109\/ROBOT.2002.1013481"},{"key":"26_CR3","unstructured":"Korf, R.E., Reid, M.: Complexity analysis of admissible heuristic search. In: Proceedings of the National Conference on Artificial Intelligence - AAAI (1998)"},{"issue":"2","key":"26_CR4","first-page":"99","volume":"25","author":"S. Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Liu, Y., Furcy, D.: Incremental heuristic search in ai. AI Mag.\u00a025(2), 99\u2013112 (2004)","journal-title":"AI Mag."},{"key":"26_CR5","unstructured":"Sun, X., Yeoh, W., Koenig, S.: Dynamic fringe-saving a*. In: AAMAS 2009, pp. 891\u2013898 (2009)"},{"key":"26_CR6","unstructured":"Koenig, S.: Dynamic fringe-saving a* (June 2010) , http:\/\/idm-lab.org\/bib\/abstracts\/Koen09e.html (Retrieved July 2010)"},{"key":"26_CR7","unstructured":"Sun, X., Koenig, S.: The fringe-saving a* search algorithm - a feasibility study. In: IJCAI, pp. 2391\u20132397 (2007)"},{"key":"26_CR8","unstructured":"Sun, X., Koenig, S., Yeoh, W.: Generalized adaptive a*. In: Int. Foundation for Autonomous Agents and Multiagent Systems AAMAS 2008, pp. 469\u2013476 (2008)"},{"issue":"1-2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning a*. Artif. Intell.\u00a0155(1-2), 93\u2013146 (2004)","journal-title":"Artif. Intell."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Stentz, A.: Optimal and efficient path planning for partially-known environments. In: Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 3310\u20133317 (1994)","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"26_CR11","unstructured":"Ferguson, D., Stentz, A.: Field d*: An interpolation-based path planner and replanner. In: Proc. of the Int. Symposium on Robotics Research, pp. 1926\u20131931 (2005)"},{"key":"26_CR12","first-page":"203","volume-title":"Proc. of the Fifteenth Int. Florida Artif. Intell. Research Society Conf.","author":"R. Zhou","year":"2002","unstructured":"Zhou, R., Hansen, E.A.: Memory-bounded a* graph search. In: Proc. of the Fifteenth Int. Florida Artif. Intell. Research Society Conf., pp. 203\u2013209. AAAI Press, Menlo Park (2002)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artif. Intell.\u00a027, 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R.E. Korf","year":"1993","unstructured":"Korf, R.E.: Linear-space best-first search. Artif. Intell.\u00a062(1), 41\u201378 (1993)","journal-title":"Artif. Intell."},{"key":"26_CR15","first-page":"1","volume-title":"ECAI 1992","author":"S. Russell","year":"1992","unstructured":"Russell, S.: Efficient memory-bounded search methods. In: ECAI 1992, pp. 1\u20135. Wiley, Chichester (1992)"},{"key":"26_CR16","unstructured":"Yoshizumi, T., Miura, T., Ishida, T.: A* with partial expansion for large branching factor problems. In: Proc. of the Seventeenth National Conf. on Artif. Intell. and Twelfth Conf. on Innovative Applications of Artif. Intell., pp. 923\u2013929 (2000)"},{"key":"26_CR17","unstructured":"Korf, R.E.: Best-first frontier search with delayed duplicate detection. In: AAAI, pp. 650\u2013657. AAAI Press, The MIT Press (2004)"},{"issue":"5","key":"26_CR18","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"R.E. Korf","year":"2005","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. J. ACM\u00a052(5), 715\u2013748 (2005)","journal-title":"J. ACM"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Evett, M., Hendler, J., Mahanti, A., Nau, D.: Pra*: massively parallel heuristic search. Technical report (1991)","DOI":"10.21236\/ADA454848"},{"key":"26_CR20","first-page":"797","volume-title":"Proc. of the 7th Int. Parallel Processing Symposium","author":"S. Dutt","year":"1993","unstructured":"Dutt, S., Mahapatra, N.R.: Parallel A* algorithms and their performance on hypercube multiprocessors. In: Proc. of the 7th Int. Parallel Processing Symposium, pp. 797\u2013803. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Burns, E., Lemons, S., Zhou, R., Ruml, W.: Best-first heuristic search for multi-core machines. In: IJCAI, pp. 449\u2013455 (2009)","DOI":"10.1609\/icaps.v19i1.13375"},{"key":"26_CR22","first-page":"181","volume-title":"Proc. of the 14th European Conf. on Artif. Intell.","author":"A. Teije","year":"2000","unstructured":"Teije, A., Harmelen, F.: Describing problem solving methods using anytime performance profiles. In: Proc. of the 14th European Conf. on Artif. Intell., pp. 181\u2013185. IOS Press, Amsterdam (2000)"},{"key":"26_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","volume":"28","author":"E.A. Hansen","year":"2007","unstructured":"Hansen, E.A., Zhou, R.: Anytime heuristic search. J. Artif. Intell. Res (JAIR)\u00a028, 267\u2013297 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"26_CR24","volume-title":"NIPS 2003","author":"M. Likhachev","year":"2004","unstructured":"Likhachev, M., Gordon, G., Thrun, S.: Ara*: Anytime a* with provable bounds on sub-optimality. In: NIPS 2003. MIT Press, Cambridge (2004)"},{"key":"26_CR25","first-page":"975","volume-title":"Eighteenth National Conf. on Artif. Intell.","author":"R. Zhou","year":"2002","unstructured":"Zhou, R., Hansen, E.A.: Multiple sequence alignment using anytime a*. In: Eighteenth National Conf. on Artif. Intell., pp. 975\u2013976. AAAI, Menlo Park (2002)"},{"key":"26_CR26","first-page":"262","volume-title":"ICAPS 2005","author":"M. Likhachev","year":"2005","unstructured":"Likhachev, M., Ferguson, D.I., Gordon, G.J., Stentz, A., Thrun, S.: Anytime dynamic a*: An anytime, replanning algorithm. In: ICAPS 2005, pp. 262\u2013271. AAAI, Menlo Park (2005)"},{"issue":"4","key":"26_CR27","first-page":"109","volume":"22","author":"S. Koenig","year":"2001","unstructured":"Koenig, S.: Agent-centered search. AI Mag.\u00a022(4), 109\u2013131 (2001)","journal-title":"AI Mag."},{"issue":"2-3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R.E. Korf","year":"1990","unstructured":"Korf, R.E.: Real-time heuristic search. Artif. Intell.\u00a042(2-3), 189\u2013211 (1990)","journal-title":"Artif. Intell."},{"key":"26_CR29","first-page":"281","volume-title":"AAMAS 2006","author":"S. Koenig","year":"2006","unstructured":"Koenig, S., Likhachev, M.: Real-time adaptive a*. In: AAMAS 2006, pp. 281\u2013288. ACM Press, New York (2006)"},{"issue":"2","key":"26_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1026449201026","volume":"1","author":"T. Ishida","year":"1998","unstructured":"Ishida, T.: Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems\u00a01(2), 139\u2013167 (1998)","journal-title":"Autonomous Agents and Multi-Agent Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 SBIA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16138-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T01:28:42Z","timestamp":1685842122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16138-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161377","9783642161384"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16138-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}