{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:27:44Z","timestamp":1704842864386},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10458-014-9266-0","type":"journal-article","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T04:20:25Z","timestamp":1406780425000},"page":"850-895","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reusing cost-minimal paths for goal-directed navigation in partially known terrains"],"prefix":"10.1007","volume":"29","author":[{"given":"Carlos","family":"Hern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tansel","family":"Uras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge A.","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"key":"9266_CR1","unstructured":"Bjornsson, Y., Enzenberger, M., Holte, R., Schaeffer, J., & Yap, P. (2003). Comparison of different grid abstractions for pathfinding on maps. In Proceedings of the international joint conference on artificial intelligence (pp. 1511\u20131512). Acapulco, Mexico: Morgan Kaufmann"},{"key":"9266_CR2","unstructured":"Bulitko, V., Bjornsson, Y., Lustrek, 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). Providence, RI, USA: AAAI Press."},{"key":"9266_CR3","volume-title":"Principles of Robot motion: Theory, algorithms, and implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., Thrun, S., Kavraki, L., Burgard, W., & Lynch, K. (2005). Principles of Robot motion: Theory, algorithms, and implementations. Cambridge, MA: MIT Press."},{"key":"9266_CR4","volume-title":"Heuristic search\u2014Theory and applications","author":"S Edelkamp","year":"2012","unstructured":"Edelkamp, S., & Schr\u00f6dl, S. (2012). Heuristic search\u2014Theory and applications. New York: Academic Press."},{"issue":"2","key":"9266_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/rob.20109","volume":"23","author":"D Ferguson","year":"2006","unstructured":"Ferguson, D., & Stentz, A. (2006). Using interpolation to improve path planning: The Field D* algorithm. Journal of Field Robotics, 23(2), 79\u2013101.","journal-title":"Journal of Field Robotics"},{"key":"9266_CR6","first-page":"100","volume":"2","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Man, and Cybernetics, 2, 100\u2013107.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"9266_CR7","unstructured":"Hernandez, C., Baier, J., Uras, T., & Koenig, S. (2012). Position paper: Incremental search algorithms considered poorly understood. In Proceedings of the symposium on combinatorial search (pp. 159\u2013161). Niagara Falls, Canada: AAAI Press."},{"key":"9266_CR8","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1613\/jair.3590","volume":"43","author":"C Hern\u00e1ndez","year":"2012","unstructured":"Hern\u00e1ndez, C., & Baier, J. A. (2012). Avoiding and escaping depressions in real-time heuristic search. Journal of Artificial Intelligence Research, 43, 523\u2013570.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9266_CR9","unstructured":"Hern\u00e1ndez, C., Meseguer, P., Sun, X., & Koenig, S. (2009). Path-Adaptive A* for incremental heuristic search in unknown terrain [short paper]. In Proceedings of the international conference on automated planning and scheduling (pp. 358\u2013361). Thessaloniki, Greece: AAAI Press."},{"key":"9266_CR10","unstructured":"Hernandez, C., Sun, X., Koenig, S., & Meseguer, P. (2011). Tree Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 123\u2013130). Taipei, Taiwan: IFAAMAS."},{"key":"9266_CR11","unstructured":"Holte, R., Perez, M., Zimmer, R., & MacDonald, A. (1996). Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the thirteenth National conference on artificial intelligence (pp. 530\u2013535). Portland, Oregon, USA: AAAI Press."},{"key":"9266_CR12","unstructured":"Koenig, S., Furcy, D., & Bauer, C. (2002). Heuristic search-based replanning. In Proceedings of the international conference on artificial intelligence planning systems (pp. 294\u2013301). Toulouse, France: AAAI Press."},{"key":"9266_CR13","doi-asserted-by":"crossref","unstructured":"Koenig, S., & Likhachev, M. (2005). Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 1311\u20131312). Utrecht, The Netherlands: ACM.","DOI":"10.1145\/1082473.1082748"},{"key":"9266_CR14","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","volume":"21","author":"S Koenig","year":"2005","unstructured":"Koenig, S., & Likhachev, M. (2005). Fast replanning for navigation in unknown terrain. Transactions on Robotics, 21, 354\u2013363.","journal-title":"Transactions on Robotics"},{"key":"9266_CR15","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. 410\u2013413). Cumbria, UK: AAAI Press."},{"issue":"2","key":"9266_CR16","first-page":"99","volume":"25","author":"S Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Liu, Y., & Furcy, D. (2004). Incremental heuristic search in artificial intelligence. Artificial Intelligence Magazine, 25(2), 99\u2013112.","journal-title":"Artificial Intelligence Magazine"},{"issue":"1\u20132","key":"9266_CR17","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., & Smirnov, Y. (2003). Performance bounds for planning in unknown terrain. Artificial Intelligence, 147(1\u20132), 253\u2013279.","journal-title":"Artificial Intelligence"},{"key":"9266_CR18","unstructured":"Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005). Anytime Dynamic A*: An anytime, replanning algorithm. In Proceedings of the international conference on automated planning and scheduling (pp. 262\u2013271). Monterey, California, USA: AAAI Press."},{"issue":"14","key":"9266_CR19","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1016\/j.artint.2007.11.009","volume":"172","author":"M Likhachev","year":"2008","unstructured":"Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2008). Anytime search in dynamic graphs. Artificial Intelligence, 172(14), 1613\u20131643.","journal-title":"Artificial Intelligence"},{"key":"9266_CR20","unstructured":"Likhachev, M., & Koenig, S. (2006). Incremental heuristic search in games: The quest for speed. In Proceedings of the AAAI conference on artificial intelligence and interactive digital entertainment (pp. 118\u2013120). Marina del Rey, California, USA: AAAI Press. http:\/\/www.aaai.org\/Library\/AIIDE\/2006\/aiide06-025.php ."},{"key":"9266_CR21","unstructured":"Matsuta, K., Kobayashi, H., & Shinohara, A. (2010). Multi-target Adaptive A*. In Proceedings of the international conference on autonomous agents and multiagent systems (pp. 1065\u20131072). Toronto, Canada: IFAAMAS."},{"key":"9266_CR22","unstructured":"Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley."},{"key":"9266_CR23","unstructured":"Stentz, A. (1995). The Focussed D* algorithm for real-time replanning. In Proceedings of the international joint conference in artificial intelligence (pp. 1652\u20131659). Montreal, Quebec, Canada: Morgan Kaufmann."},{"issue":"2","key":"9266_CR24","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"N Sturtevant","year":"2012","unstructured":"Sturtevant, N. (2012). Benchmarks for grid-based pathfinding. Transactions on Computational Intelligence and AI in Games, 4(2), 144\u2013148.","journal-title":"Transactions on Computational Intelligence and AI in Games"},{"key":"9266_CR25","unstructured":"Sun, X., Koenig, S., & Yeoh, W. (2008). Generalized Adaptive A*. In Proceedings of the international joint conference on autonomous agents and multiagent systems (pp. 469\u2013476). Estoril, Portugal: IFAAMAS."},{"key":"9266_CR26","unstructured":"Sun, X., Yeoh, W., & Koenig, S. (2009). Efficient incremental search for moving target search. In Proceedings of the international joint conference on artificial intelligence (pp. 615\u2013620). Pasadena, California, USA: AAAI Press."},{"key":"9266_CR27","unstructured":"Yap, P. K. Y., Burch, N., Holte, R. C., & Schaeffer, J. (2011). Any-angle path planning for computer games. In Proceedings of the AAAI conference on artificial intelligence and interactive digital entertainment (pp. 201\u2013207). Palo Alto, California, USA: AAAI Press."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9266-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-014-9266-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9266-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T11:28:22Z","timestamp":1565695702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-014-9266-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,1]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9266"],"URL":"https:\/\/doi.org\/10.1007\/s10458-014-9266-0","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,1]]}}}