{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T16:52:11Z","timestamp":1781628731994,"version":"3.54.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/100031478","name":"NextGenerationEU","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100031478","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10472-024-09957-3","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T04:13:42Z","timestamp":1731557622000},"page":"569-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A multi-algorithm pathfinding method: Exploiting performance variations for enhanced efficiency"],"prefix":"10.1007","volume":"93","author":[{"given":"Aya","family":"Kherrour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Robol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Roveri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Giorgini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,14]]},"reference":[{"issue":"1","key":"9957_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/736138","volume":"2015","author":"Z Abd Algfoor","year":"2015","unstructured":"Abd Algfoor, Z., Sunar, M.S., Kolivand, H.: A comprehensive study on pathfinding techniques for robotics and video games. International Journal of Computer Games Technology. 2015(1), 736138 (2015). https:\/\/doi.org\/10.1155\/2015\/736138","journal-title":"International Journal of Computer Games Technology."},{"key":"9957_CR2","doi-asserted-by":"publisher","unstructured":"Pardede, S.L., Athallah, F.R., Huda, Y.N., Zain, F.D.: A review of pathfinding in game development. Journal of Computer Engineering: Progress, Application and Technology (CEPAT). 1(01), 47 (2022).https:\/\/doi.org\/10.25124\/cepat.v1i01.4863","DOI":"10.25124\/cepat.v1i01.4863"},{"issue":"2","key":"9957_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE 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. 4(2), 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Transactions on Systems Science and Cybernetics."},{"key":"9957_CR4","doi-asserted-by":"publisher","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy. ACM Books, vol. 45, pp. 287\u2013290. ACM \/ Morgan & Claypool, New York, United States (2022). https:\/\/doi.org\/10.1145\/3544585.3544600","DOI":"10.1145\/3544585.3544600"},{"issue":"2","key":"9957_CR5","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1109\/LRA.2021.3062803","volume":"6","author":"M Damani","year":"2021","unstructured":"Damani, M., Luo, Z., Wenzel, E., Sartoretti, G.: PRIMAL2: Pathfinding via reinforcement and imitation multi-agent learning - lifelong. IEEE Robotics Autom. Lett. 6(2), 2666\u20132673 (2021). https:\/\/doi.org\/10.1109\/LRA.2021.3062803","journal-title":"IEEE Robotics Autom. Lett."},{"key":"9957_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015). https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"Artif. Intell."},{"key":"9957_CR7","doi-asserted-by":"publisher","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multi-agent path finding under the sum of costs objective. In: 22nd European Conference on Artificial Intelligence ECAI. Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 810\u2013818. IOS Press, Amsterdam, Netherlands (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-810","DOI":"10.3233\/978-1-61499-672-9-810"},{"issue":"2\u20133","key":"9957_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"RE Korf","year":"1990","unstructured":"Korf, R.E.: Real-time heuristic search. Artif. Intell. 42(2\u20133), 189\u2013211 (1990). https:\/\/doi.org\/10.1016\/0004-3702(90)90054-4","journal-title":"Artif. Intell."},{"issue":"11","key":"9957_CR9","doi-asserted-by":"publisher","first-page":"5499","DOI":"10.3390\/app12115499","volume":"12","author":"SR Lawande","year":"2022","unstructured":"Lawande, S.R., Jasmine, G., Anbarasi, J., Izhar, L.I.: A systematic review and analysis of intelligence-based pathfinding algorithms in the field of video games. Appl. Sci. 12(11), 5499 (2022). https:\/\/doi.org\/10.3390\/app12115499","journal-title":"Appl. Sci."},{"key":"9957_CR10","doi-asserted-by":"publisher","unstructured":"Permana, S.H., Bintoro, K.Y., Arifitama, B., Syahputra, A., et al.: Comparative analysis of pathfinding algorithms A*, Dijkstra, and BFS on maze runner game. IJISTECH (International J. Inf. Syst. Technol. 1(2), 1 (2018). https:\/\/doi.org\/10.30645\/ijistech.v1i2.7","DOI":"10.30645\/ijistech.v1i2.7"},{"key":"9957_CR11","doi-asserted-by":"publisher","unstructured":"Alkazzi, J., Rizk, A., Salomon, M., Makhoul, A.: MAPFASTER: A faster and simpler take on multi-agent path finding algorithm selection. In: International Conference on Intelligent Robots and Systems, IROS, pp. 10088\u201310093. IEEE, Kyoto, Japan (2022). https:\/\/doi.org\/10.1109\/IROS47612.2022.9981981","DOI":"10.1109\/IROS47612.2022.9981981"},{"key":"9957_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.4204\/eptcs.391.12","volume":"391","author":"A Kherrour","year":"2023","unstructured":"Kherrour, A., Robol, M., Roveri, M., Giorgini, P.: Evaluating heuristic search algorithms in pathfinding: A comprehensive study on performance metrics and domain parameters. Electronic Proceedings in Theoretical Computer Science. 391, 102\u2013112 (2023). https:\/\/doi.org\/10.4204\/eptcs.391.12","journal-title":"Electronic Proceedings in Theoretical Computer Science."},{"key":"9957_CR13","doi-asserted-by":"publisher","unstructured":"Stern, R., Sturtevant, N.R., Felner, A., Koenig, S., Ma, H., Walker, T.T., Li, J., Atzmon, D., Cohen, L., Kumar, T.K.S., Bart\u00e1k, R., Boyarski, E.: Multi-agent pathfinding: Definitions, variants, and benchmarks. In: Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS, pp. 151\u2013158. AAAI Press, Napa, California, USA (2019). https:\/\/doi.org\/10.1609\/SOCS.V10I1.18510","DOI":"10.1609\/SOCS.V10I1.18510"},{"key":"9957_CR14","unstructured":"Likhachev, M., Gordon, G.J., Thrun, S.: ARA*: Anytime A* search with provable bounds on sub-optimality. In: Advances in Neural Information Processing Systems 16, NIPS, pp. 767\u2013774. MIT Press, Vancouver, British Columbia, Canada (2003). https:\/\/proceedings.neurips.cc\/paper\/2003\/hash\/ee8fe9093fbbb687bef15a38facc44d2-Abstract.html"},{"key":"9957_CR15","doi-asserted-by":"publisher","unstructured":"Koenig, S., Likhachev, M.: Real-time adaptive A*. In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 281\u2013288. ACM, New York, USA (2006). https:\/\/doi.org\/10.1145\/1160633.1160682","DOI":"10.1145\/1160633.1160682"},{"key":"9957_CR16","unstructured":"Stentz, A.: The focussed d* algorithm for real-time replanning. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI, pp. 1652\u20131659. Morgan Kaufmann, Montr\u00e9al Qu\u00e9bec, Canada (1995). http:\/\/ijcai.org\/Proceedings\/95-2\/Papers\/082.pdf"},{"key":"9957_CR17","unstructured":"Koenig, S., Likhachev, M.: D*lite. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, pp. 476\u2013483. AAAI Press \/ The MIT Press, Edmonton, AB, Canada (2002). http:\/\/www.aaai.org\/Library\/AAAI\/2002\/aaai02-072.php"},{"issue":"1","key":"9957_CR18","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. 155(1), 93\u2013146 (2004). https:\/\/doi.org\/10.1016\/j.artint.2003.12.001","journal-title":"Artif. Intell."},{"key":"9957_CR19","doi-asserted-by":"publisher","unstructured":"Zarembo, I., Kodors, S.: Pathfinding algorithm efficiency analysis in 2D grid. In: ENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference, vol. 2, pp. 46\u201350 (2013). https:\/\/doi.org\/10.17770\/etr2013vol2.868","DOI":"10.17770\/etr2013vol2.868"},{"issue":"2","key":"9957_CR20","first-page":"482","volume":"2","author":"PC Iloh","year":"2022","unstructured":"Iloh, P.C.: A comprehensive and comparative study of DFS, BFS, and A* search algorithms in a solving the maze transversal problem. International Journal of Social Sciences and Scientific Studies. 2(2), 482\u2013490 (2022)","journal-title":"International Journal of Social Sciences and Scientific Studies."},{"key":"9957_CR21","unstructured":"Ren, J., Sathiyanarayanan, V., Ewing, E., Senbaslar, B., Ayanian, N.: MAPFAST: A deep algorithm selector for multi agent path finding using shortest path embeddings. In: 20th International Conference on Autonomous Agents and Multiagent Systems AAMAS, pp. 1055\u20131063. ACM, Virtual Event, United Kingdom (2021). https:\/\/www.ifaamas.org\/Proceedings\/aamas2021\/pdfs\/p1055.pdf"},{"issue":"2","key":"9957_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Transactions on Computational Intelligence and AI in Games. 4(2), 144\u2013148 (2012). https:\/\/doi.org\/10.1109\/TCIAIG.2012.2197681","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games."},{"issue":"3","key":"9957_CR23","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/S11370-024-00537-2","volume":"17","author":"M Parooei","year":"2024","unstructured":"Parooei, M., Masouleh, M.T., Kalhor, A.: MAP3F: a decentralized approach to multi-agent pathfinding and collision avoidance with scalable 1d, 2d, and 3d feature fusion. Intell. Serv. Robotics. 17(3), 401\u2013418 (2024). https:\/\/doi.org\/10.1007\/S11370-024-00537-2","journal-title":"Intell. Serv. Robotics."},{"key":"9957_CR24","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: 3rd International Conference on Learning Representations, ICLR, Conference Track Proceedings (2015). http:\/\/arxiv.org\/abs\/1409.1556"},{"key":"9957_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45, 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"9957_CR26","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"9957_CR27","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/J.PATREC.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T.: An introduction to ROC analysis. Pattern Recogn. Lett. 27(8), 861\u2013874 (2006). https:\/\/doi.org\/10.1016\/J.PATREC.2005.10.010","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"9957_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/2.30720","volume":"22","author":"A Elfes","year":"1989","unstructured":"Elfes, A.: Using occupancy grids for mobile robot perception and navigation. Computer 22(6), 46\u201357 (1989). https:\/\/doi.org\/10.1109\/2.30720","journal-title":"Computer"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-024-09957-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-024-09957-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-024-09957-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T02:12:28Z","timestamp":1758939148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-024-09957-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,14]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["9957"],"URL":"https:\/\/doi.org\/10.1007\/s10472-024-09957-3","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,14]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}