{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T11:46:20Z","timestamp":1772797580236,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,5]],"date-time":"2008-09-05T00:00:00Z","timestamp":1220572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10458-008-9061-x","type":"journal-article","created":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T07:40:23Z","timestamp":1220514023000},"page":"313-341","source":"Crossref","is-referenced-by-count":29,"title":["Comparing real-time and incremental heuristic search for real-time situated agents"],"prefix":"10.1007","volume":"18","author":[{"given":"Sven","family":"Koenig","sequence":"first","affiliation":[]},{"given":"Xiaoxun","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,5]]},"reference":[{"issue":"1","key":"9061_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"73","author":"A. Barto","year":"1995","unstructured":"Barto A., Bradtke S. and Singh S. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence 73(1): 81\u2013138","journal-title":"Artificial Intelligence"},{"key":"9061_CR2","unstructured":"Bjornsson, M., Enzenberger, M., Holte, R., Schaeffer, J., & Yap, P. (2003). Comparison of different abstractions for pathfinding on maps. In Proceedings of the International Joint Conference on Artificial Intelligence (pp. 1511\u20131512)."},{"key":"9061_CR3","unstructured":"Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (pp. 52\u201361)."},{"key":"9061_CR4","unstructured":"Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism. In Proceedings of the National Conference on Artificial Intelligence (pp. 714\u2013719)."},{"key":"9061_CR5","unstructured":"Bulitko, V. (2003). Lookahead pathologies and meta-level control in real-time heuristic search. In Proceedings of the Euromicro Conference on Real-Time Systems (pp. 13\u201316)."},{"key":"9061_CR6","unstructured":"Bulitko, V., Bjornsson, Y., Luvstrek, M., Schaeffer, J., & Sigmundarson, S. (2007). Dynamic control in path-planning with real-time heuristic search. In Proceedings of the International Conference on Automated Planning and Scheduling (pp. 49\u201356)."},{"key":"9061_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1613\/jair.1789","volume":"25","author":"V. Bulitko","year":"2006","unstructured":"Bulitko V. and Lee G. (2006). Learning in real-time search: A unifying framework. Journal of Artificial Intelligence Research 25: 119\u2013157","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9061_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik 1: 269\u2013271","journal-title":"Numerische Mathematik"},{"key":"9061_CR9","unstructured":"Edelkamp, S. (1998). Updating shortest paths. In Proceedings of the European Conference on Artificial Intelligence (pp. 655\u2013659)."},{"key":"9061_CR10","unstructured":"Furcy, D., & Koenig, S. (2000). Speeding up the convergence of real-time search. In Proceedings of the National Conference on Artificial Intelligence (pp. 891\u2013897)."},{"key":"9061_CR11","unstructured":"Goldenberg, M., Kovarksy, A., Wu, X., & Schaeffer, J. (2003). Multiple agents moving target search. In Proceedings of the International Joint Conference on Artificial Intelligence (pp. 1538\u20131538)."},{"key":"9061_CR12","doi-asserted-by":"crossref","unstructured":"Hart, P., Nilsson, N., & Raphael, N. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC4(2), 100\u2013107.","DOI":"10.1109\/TSSC.1968.300136"},{"key":"9061_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","volume":"37","author":"P. Hart","year":"1972","unstructured":"Hart P., Nilsson N. and Raphael B. (1972). Correction to \u2018a formal basis for the heuristic determination of minimum cost paths\u2019. SIGART Newsletter 37: 28\u201329","journal-title":"SIGART Newsletter"},{"key":"9061_CR14","doi-asserted-by":"crossref","unstructured":"Hebert, M., McLachlan, R., & Chang, P. (1999). Experiments with driving modes for urban robots. In Proceedings of the SPIE Mobile Robots.","DOI":"10.1117\/12.369249"},{"issue":"1\u20132","key":"9061_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(95)00111-5","volume":"85","author":"R. Holte","year":"1996","unstructured":"Holte R., Mkadmi T., Zimmer R. and MacDonald A. (1996). Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence 85(1\u20132): 321\u2013361","journal-title":"Artificial Intelligence"},{"key":"9061_CR16","unstructured":"Ishida, T. (1992). Moving target search with intelligence. In Proceedings of the National Conference on Artificial Intelligence (pp. 525\u2013532)."},{"key":"9061_CR17","unstructured":"Ishida, T. (1997). Real-Time search for learning autonomous agents. Kluwer Academic Publishers."},{"issue":"4","key":"9061_CR18","first-page":"109","volume":"22","author":"S. Koenig","year":"2001","unstructured":"Koenig S. (2001). Agent-centered search. Artificial Intelligence Magazine 22(4): 109\u2013131","journal-title":"Artificial Intelligence Magazine"},{"key":"9061_CR19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0004-3702(01)00103-5","volume":"129","author":"S. Koenig","year":"2001","unstructured":"Koenig S. (2001). Minimax real-time heuristic search. Artificial Intelligence 129: 165\u2013197","journal-title":"Artificial Intelligence"},{"key":"9061_CR20","unstructured":"Koenig, S. (2004). A comparison of fast search methods for real-time situated agents. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (pp. 864\u2013871)."},{"key":"9061_CR21","unstructured":"Koenig, S., & Likhachev, M. (2002). D* Lite. In Proceedings of the National Conference on Artificial Intelligence (pp. 476\u2013483)."},{"issue":"3","key":"9061_CR22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","volume":"21","author":"S. Koenig","year":"2005","unstructured":"Koenig S. and Likhachev M. (2005). Fast replanning for navigation in unknown terrain. Transactions on Robotics 21(3): 354\u2013363","journal-title":"Transactions on Robotics"},{"key":"9061_CR23","unstructured":"Koenig, S., & Likhachev, M. (2006). A new principle for incremental heuristic search: Theoretical results. In Proceedings of the International Conference on Autonomous Planning and Scheduling (pp. 402\u2013405)."},{"issue":"1\u20132","key":"9061_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koenig","year":"2004","unstructured":"Koenig S., Likhachev M. and Furcy D. (2004). Lifelong Planning A*. Artificial Intelligence Journal 155(1\u20132): 93\u2013146","journal-title":"Artificial Intelligence Journal"},{"issue":"2","key":"9061_CR25","first-page":"99","volume":"25","author":"S. Koenig","year":"2004","unstructured":"Koenig S., Likhachev M., Liu Y. and Furcy D. (2004). Incremental heuristic search in Artificial Intelligence. Artificial Intelligence Magazine 25(2): 99\u2013112","journal-title":"Artificial Intelligence Magazine"},{"key":"9061_CR26","unstructured":"Koenig, S., & Simmons, R. G. (1996). Easy and hard testbeds for real-time search algorithms. In Proceedings of the National Conference on Artificial Intelligence (pp. 279\u2013285)."},{"key":"9061_CR27","unstructured":"Koenig, S., & Szymanski, B. (1999). Value-update rules for real-time search. In Proceedings of the National Conference on Artificial Intelligence (pp. 718\u2013724)."},{"key":"9061_CR28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0004-3702(03)00062-6","volume":"147","author":"S. Koenig","year":"2003","unstructured":"Koenig S., Tovey C. and Smirnov Y. (2003). Performance bounds for planning in unknown terrain. Artificial Intelligence 147: 253\u2013279","journal-title":"Artificial Intelligence"},{"issue":"2\u20133","key":"9061_CR29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R. Korf","year":"1990","unstructured":"Korf R. (1990). Real-time heuristic search. Artificial Intelligence 42(2\u20133): 189\u2013211","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9061_CR30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. Korf","year":"1993","unstructured":"Korf R. (1993). Linear-space best-first search. Artificial Intelligence 62(1): 41\u201378","journal-title":"Artificial Intelligence"},{"key":"9061_CR31","unstructured":"Mudgal, A., Tovey, C., & Koenig, S. (2004). Analysis of greedy robot-navigation methods. In Proceedings of the Conference on Artificial Intelligence and Mathematics."},{"key":"9061_CR32","unstructured":"Pearl, J. (1985). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley."},{"key":"9061_CR33","unstructured":"Pemberton, J., & Korf, R. (1992). Making locally optimal decisions on graphs with cycles. Technical Report 920004. Los Angeles, CA: Computer Science Department, University of California at Los Angeles."},{"key":"9061_CR34","unstructured":"Russell, S., & Wefald, E. (1991). Do the right thing\u2014Studies in limited rationality. MIT Press."},{"key":"9061_CR35","unstructured":"Shue, L., Li, S., & Zamani, R. (2001). An intelligent heuristic algorithm for project scheduling problems. In Proceedings of the Annual Meeting of the Decision Sciences Institute."},{"key":"9061_CR36","doi-asserted-by":"crossref","unstructured":"Shue, L., & Zamani, R. (1993). An admissible heuristic search algorithm. In Proceedings of the International Symposium on Methodologies for Intelligent Systems (pp. 69\u201375).","DOI":"10.1007\/3-540-56804-2_7"},{"key":"9061_CR37","unstructured":"Stentz, A. (1995). The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence (pp. 1652\u20131659)."},{"key":"9061_CR38","unstructured":"Sun, X., & Koenig, S. (2007). The Fringe-Saving A* search algorithm\u2014A feasibility study. In Proceedings of the International Joint Conference on Artificial Intelligence (pp. 2391\u20132397)."},{"issue":"3","key":"9061_CR39","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:AURO.0000025793.46961.f6","volume":"16","author":"J. Svennebring","year":"2004","unstructured":"Svennebring J. and Koenig S. (2004). Building terrain-covering ant robots. Autonomous Robots 16(3): 313\u2013332","journal-title":"Autonomous Robots"},{"key":"9061_CR40","unstructured":"Thayer, S., Digney, B., Diaz, M., Stentz, A., Nabbe, B., & Hebert, M. (2000). Distributed robotic mapping of extreme environments. In Proceedings of the SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII (Vol. 4195, pp. 84\u201395)."},{"issue":"2","key":"9061_CR41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S0218001490000174","volume":"4","author":"K. Trovato","year":"1990","unstructured":"Trovato K. (1990). Differential A*: An adaptive search method illustrated with robot path planning for moving obstacles and goals and an uncertain environment. Journal of Pattern Recognition and Artificial Intelligence 4(2): 245\u2013268","journal-title":"Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"5","key":"9061_CR42","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"I. Wagner","year":"1999","unstructured":"Wagner I., Lindenbaum M. and Bruckstein A. (1999). Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15(5): 918\u2013933","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"9061_CR43","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V. Yanovski","year":"2003","unstructured":"Yanovski V., Wagner I. and Bruckstein A. (2003). A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37: 165\u2013186","journal-title":"Algorithmica"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-008-9061-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-008-9061-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-008-9061-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:28:24Z","timestamp":1559150904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-008-9061-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,5]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9061"],"URL":"https:\/\/doi.org\/10.1007\/s10458-008-9061-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,5]]}}}