{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:57:57Z","timestamp":1768773477360,"version":"3.49.0"},"reference-count":78,"publisher":"MDPI AG","issue":"15","license":[{"start":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:00:00Z","timestamp":1753401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Funds through the Portuguese funding agency, FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UID\/06121\/2023"],"award-info":[{"award-number":["UID\/06121\/2023"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Sciences"],"abstract":"<jats:p>NetworkX is a free Python library for graphs and networks and is used in many applications and projects to find the shortest path in path planning scenarios. For dense graphs, the library provides the Floyd\u2013Warshall algorithm for shortest paths and the A* (\u201cA-Star\u201d) algorithm for shortest paths and path lengths. However, several extensions have been proposed to improve the A*, but they are not included in the library. In this context, this paper presents a set of implementations improving the A*, such as the IDA*, D* Lite, SMA*, Bidirectional A* and RTA*. The goal or challenge is to address the limitations of the A* in specific scenarios, such as searching for an optimal path repeatedly or when confronted with memory limitations, as exemplified by the NetworkX library. To do this, we first review the literature of the usage and general application of NetworkX in different domains of applicability and then explore their usage in a shortest path context. By reviewing and validating the usage of A* and extensions in Python using the NetworkX framework, the implementations were submitted to the network environment validation and passed the tests. We have also done the benchmarking of the A*, comparing it with the new ones, and concluded the better efficiency of the A* extensions in tri-objective scenario parameters (length, cost and toll). Despite the extensive utilisation of A* and its notable efficacy in identifying optimal paths, its performance is suboptimal in specific scenarios, such as when confronted with memory constraints and dynamic environments. Almost every algorithm outperformed or matched the A* in the fields that were developed to have an advantage, demonstrating the quality and robustness of the implemented algorithms. As a contribution and to foster further research in this shortest path specific context field, the dataset and Python code of the algorithms are available in a GitHub opensource repository.<\/jats:p>","DOI":"10.3390\/app15158273","type":"journal-article","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T11:38:41Z","timestamp":1753443521000},"page":"8273","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Contribution of Shortest Paths Algorithms to the NetworkX Python Library"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-7906-1255","authenticated-orcid":false,"given":"Miguel","family":"Cruz","sequence":"first","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3422-4624","authenticated-orcid":false,"given":"Rui","family":"Carvalho","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"given":"Andr\u00e9","family":"Costa","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"given":"Luis","family":"Pinto","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"given":"Luis","family":"Dias","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2165-0666","authenticated-orcid":false,"given":"Paulino","family":"Cerqueira","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"given":"Rodrigo","family":"Machado","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2783-6377","authenticated-orcid":false,"given":"Tiago","family":"Batista","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6525-7040","authenticated-orcid":false,"given":"Pedro","family":"Castro","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"},{"name":"ADiT-Lab\u2014Applied Digital Transformation Laboratory, Instituto Polit\u00e9cnico de Viana do Castelo, 4900-347 Viana do Castelo, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1874-7340","authenticated-orcid":false,"given":"Jorge","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Instituto Polit\u00e9cnico de Viana do Castelo, Rua Escola Industrial e Comercial Nun\u2019\u00c1lvares, 4900-347 Viana do Castelo, Portugal"},{"name":"ADiT-Lab\u2014Applied Digital Transformation Laboratory, Instituto Polit\u00e9cnico de Viana do Castelo, 4900-347 Viana do Castelo, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/261342.261352","article-title":"Recent results on the single-source shortest paths problem","volume":"28","author":"Rajeev","year":"1997","journal-title":"SIGACT News"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., and Italiano, G. (2004). Engineering Shortest Path Algorithms. Experimental and Efficient Algorithms, Springer.","DOI":"10.1007\/978-3-540-24838-5_14"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Qureshi, M., Hassan, M., Safdar, S., and Akbar, R. (2011, January 20\u201323). A near linear shortest path algorithm for weighted undirected graphs. Proceedings of the IEEE Symposium on Computers & Informatics, Kuala Lumpur, Malaysia.","DOI":"10.1109\/ISCI.2011.5958895"},{"key":"ref_4","unstructured":"Amgad, M., Aref, W., Rehman, F., Rahman, A., and Basalamah, S. (2017). A Survey of Shortest-Path Algorithms. arXiv."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Korte, B., and Vygen, J. (2018). Shortest Paths. Combinatorial Optimization. Algorithms and Combinatorics, Springer.","DOI":"10.1007\/978-3-662-56039-6"},{"key":"ref_6","first-page":"46","article-title":"Survey of Shortest Path Algorithms","volume":"10","author":"Barkund","year":"2022","journal-title":"Int. J. Renew. Energy Exch."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"392","DOI":"10.32628\/IJSRSET2411261","article-title":"Implementation of Shortest Path Algorithms","volume":"11","author":"Amruta","year":"2024","journal-title":"Int. J. Sci. Res. Sci. Eng. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Cassis, A., and Fischer, N. (2023, January 6\u20139). Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!. Proceedings of the IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), Santa Cruz, CA, USA.","DOI":"10.1109\/FOCS57990.2023.00038"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Duan, R., Mao, J., Shu, J., and Yin, L. (2023, January 6\u20139). A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs. Proceedings of the IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), Santa Cruz, CA, USA.","DOI":"10.1109\/FOCS57990.2023.00035"},{"key":"ref_10","unstructured":"Andrew, G., and Harrelson, C. (2005, January 23\u201325). Computing the shortest path: A search meets graph theory. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201805), Vancouver, BC, Canada."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wu, J., Srinivasan, V., and Thomo, A. (2019, January 15\u201317). Graph-XLL: A Graph Library for Extra Large Graph Analytics on a Single Machine. Proceedings of the 2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA), Patras, Greece.","DOI":"10.1109\/IISA.2019.8900744"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"9661411","DOI":"10.1155\/2022\/9661411","article-title":"A robust graph theoretic solution of routing in intelligent networks","volume":"2022","author":"Qureshi","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Diestel, R. (2025). Graph Theory, Springer. [6th ed.]. Available online: https:\/\/link.springer.com\/book\/10.1007\/978-3-662-70107-2.","DOI":"10.1007\/978-3-662-70107-2"},{"key":"ref_14","unstructured":"Faysal, M., and Arifuzzaman, S. (2018, January 10\u201313). A Comparative Analysis of Large-scale Network Visualization Tools. Proceedings of the IEEE International Conference on Big Data (Big Data), Seattle, WA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3200764","article-title":"Interactive Visual Graph Mining and Learning","volume":"9","author":"Rossi","year":"2018","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Hagberg, A., Schult, D., and Swart, P. (2008, January 1). Exploring Network Structure, Dynamics, and Function using NetworkX. Proceedings of the 7th Python in Science Conference, Los Alamos, NM, USA.","DOI":"10.25080\/TCWV9851"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.18335\/region.v6i3.278","article-title":"Urban Street Network Analysis in a Computational Notebook","volume":"6","author":"Boeing","year":"2020","journal-title":"Region"},{"key":"ref_18","unstructured":"Bontonou, M., Farrugia, N., and Gripon, V. (2021). Graph-LDA: Graph Structure Priors to Improve the Accuracy in Few-Shot Classification. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Gao, J., Li, S.T., Tao, C., He, Y., Anumalasetty, A.P., Joseph, E.W., Sripathi, A.H., and Nayani, H. (2022, January 15\u201318). An Approach to GUI Test Scenario Generation Using Machine Learning. Proceedings of the IEEE International Conference On Artificial Intelligence Testing, Newark, CA, USA.","DOI":"10.1109\/AITest55621.2022.00020"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"012045","DOI":"10.1088\/1742-6596\/2438\/1\/012045","article-title":"Graph-based algorithm for the understanding of failures in the ATLAS infrastructure","volume":"2438","author":"Uribe","year":"2023","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"154","DOI":"10.54097\/hset.v46i.7697","article-title":"Research on the A Star Algorithm for Finding Shortest Path","volume":"46","author":"Yumeng","year":"2023","journal-title":"Highlights Sci. Eng. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ortega-Arranz, H., Llanos, D., and Gonzalez-Escribano, A. (2015). The Shortest-Path Problem, Analysis and Comparison of Methods, Springer International Publishing.","DOI":"10.1007\/978-3-031-02574-7"},{"key":"ref_24","unstructured":"Ford, L. (1956). Network Flow Theory, The RAND Corporation."},{"key":"ref_25","unstructured":"Goldberg, A., and Radzik, T. (2025, May 19). A Heuristic Improvement of the Bellman-Ford Algorithm. Available online: https:\/\/apps.dtic.mil\/sti\/citations\/ADA322742."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","article-title":"Efficient Algorithms for Shortest Paths in Sparse Networks","volume":"24","author":"Johnson","year":"1977","journal-title":"J. ACM"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Robert","year":"1962","journal-title":"Commun. ACM"},{"key":"ref_28","unstructured":"Anjary, T. (2023). The Floyd-Warshall Algorithm Re-implemented Using 3D-Tensors and Hardware Acceleration. arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.ejor.2008.09.032","article-title":"A new bidirectional search algorithm with shortened postprocessing","volume":"198","author":"Pijls","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"ref_32","unstructured":"Russell, S., Norvig, P., and Davis, E. (2010). Artificial Intelligence: A Modern Approach, Prentice Hall. [3rd ed.]."},{"key":"ref_33","unstructured":"Stentz, A. (2011). The D* Algorithm for Real-Time Planning of Optimal Traverses, Carnegie Mellon University. Available online: https:\/\/www.researchgate.net\/publication\/247824868_The_D_Algorithm_for_Real-Time_Planning_of_Optimal_Traverses."},{"key":"ref_34","unstructured":"Koenig, S., and Likhachev, M. (August, January 28). D* lite. Proceedings of the Eighteenth National Conference on Artificial Intelligence, Edmonton, AB, Canada. Available online: https:\/\/cdn.aaai.org\/AAAI\/2002\/AAAI02-072.pdf."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1613\/jair.1789","article-title":"Learning in Real-Time Search: A Unifying Framework","volume":"25","author":"Bulitko","year":"2006","journal-title":"J. Artif. Intell. Res."},{"key":"ref_36","unstructured":"Hutson, G., and Jackson, M. (2023). Graph Data Modeling in Python: A Practical Guide to Curating, Analyzing, and Modeling Data with Graphs, Packt Publishing. Available online: https:\/\/ieeexplore.ieee.org\/document\/10251259."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Abdelhamid, S., Alo, R., Arifuzzaman, S.M., Beckman, P., Bhuiyan, H., Bisset, K., Fox, E.A., Fox, G.C., Hall, K., and Hasan, S.M.S. (2012, January 8\u201312). CINET: A cyberinfrastructure for network science. Proceedings of the 2012 IEEE 8th International Conference on E-Science, Chicago, IL, USA.","DOI":"10.1109\/eScience.2012.6404422"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Pacer, M. (2015, January 6\u201312). Causal Bayesian NetworkX. Proceedings of the 14th Python in Science Conference, Austin, TX, USA.","DOI":"10.25080\/Majora-7b98e3ed-016"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Gharibi, G., Rashmi, T., and Yugyung, L. (2018, January 3\u20137). Code2graph: Automatic Generation of Static Call Graphs for Python Source Code. Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, Montpellier, France.","DOI":"10.1145\/3238147.3240484"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Yang, L., Oyen, D., and Wohlberg, B. (2019, January 16\u201317). A Novel Algorithm for Skeleton Extraction From Images Using Topological Graph Analysis. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), Long Beach, CA, USA.","DOI":"10.1109\/CVPRW.2019.00152"},{"key":"ref_41","first-page":"599","article-title":"Dijkstra\u2019s algorithm revisited: The dynamic programming connexion","volume":"35","author":"Sniedovich","year":"2006","journal-title":"Control. Cybern."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.procs.2021.01.034","article-title":"A Systematic Literature Review of A* Pathfinding","volume":"179","author":"Foead","year":"2021","journal-title":"Procedia Comput. Sci."},{"key":"ref_43","first-page":"47","article-title":"A Review of Pathfinding in Game Development","volume":"1","author":"Pardede","year":"2022","journal-title":"J. Comput. Eng. Prog. Appl. Technol."},{"key":"ref_44","first-page":"315","article-title":"Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms","volume":"23","author":"Muthuvel","year":"2024","journal-title":"Int. J. Intell. Transp. Syst. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","article-title":"Heuristic search in restricted memory","volume":"41","author":"Partha","year":"1989","journal-title":"Artif. Intell."},{"key":"ref_46","unstructured":"Lovinger, J., and Zhang, X. (2017, January 18\u201322). Enhanced Simplified Memory-bounded A Star (SMA*+). Proceedings of the Global Conference on Artificial Intelligence, Miami, FL, USA. Available online: https:\/\/easychair.org\/publications\/paper\/TL2M."},{"key":"ref_47","unstructured":"Likhachev, M., Geoffrey, G., and Sebastian, T. (2003). ARA*: Anytime A* with Provable Bounds on Sub-Optimality. Advances in Neural Information Processing Systems 16, Available online: https:\/\/www.researchgate.net\/publication\/221619552_ARA_Anytime_A_with_Provable_Bounds_on_Sub-Optimality."},{"key":"ref_48","first-page":"494","article-title":"AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm","volume":"28","author":"Przybylski","year":"2018","journal-title":"Proc. Int. Conf. Autom. Plan. Sched."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","article-title":"Lifelong Planning A*","volume":"155","author":"Koenig","year":"2004","journal-title":"Artif. Intell."},{"key":"ref_50","unstructured":"Likhachev, M., and Koenig, S. (2005). A Generalized Framework for Lifelong Planning A* Search. Int. Conf. Autom. Plan. Sched., 99\u2013108. Available online: https:\/\/www.researchgate.net\/publication\/220936193_A_Generalized_Framework_for_Lifelong_Planning_A_Search."},{"key":"ref_51","unstructured":"Henri, P., and Pijls, W. (2006). Bidirectional A*: Comparing Balanced and Symmetric Heuristic Methods, Erasmus University Rotterdam, Econometric Institute. Econometric Institute Report."},{"key":"ref_52","first-page":"334","article-title":"Bidirectional A\u2009*\u2009 Search for Time-Dependent Fast Paths","volume":"Volume 5038","author":"Nannicini","year":"2008","journal-title":"International Workshop on Experimental and Efficient Algorithms"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Sharma, S., Srijan, S., and Vidhya, V. (2020). Parallelizing Bidirectional A* Algorithm. Intelligent Systems and Computer Technology, IOS Press. Advances in Parallel Computing.","DOI":"10.3233\/APC200202"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"108","DOI":"10.2514\/1.16623","article-title":"Learning Real-Time A* Path Planner for Unmanned Air Vehicle Target Sensing","volume":"3","author":"Howlett","year":"2006","journal-title":"AIAA J. Aerosp. Comput. Inf. Commun."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Koenig, S., and Likhachev, M. (2006, January 8\u201312). Real-Time Adaptive A*. Proceedings of the International Conference on Autonomous Agents, Hakodate, Japan.","DOI":"10.1145\/1160633.1160682"},{"key":"ref_56","unstructured":"Hernandez, C., and Baier, J. (2011, January 11\u201313). Real-Time Adaptive A\u2217 with Depression Avoidance. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, Palo Alto, CA, USA. Available online: https:\/\/ojs.aaai.org\/index.php\/AIIDE\/article\/view\/12455."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/13658810801949850","article-title":"Finding shortest paths on real road networks: The case for A*","volume":"23","author":"Zeng","year":"2009","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1186\/2193-1801-2-291","article-title":"Algorithm for shortest path search in Geographic Information Systems by using reduced graphs","volume":"2","year":"2013","journal-title":"SpringerPlus"},{"key":"ref_59","unstructured":"Zhaoxing, B., and Richard, E.K. (2019, January 10\u201316). A*+IDA*: A simple hybrid search algorithm. Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI\u201919), Macao, China."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Cadieux, N., Kalacska, M., Coomes, O., Tanaka, M., and Takasaki, Y. (2020). A Python Algorithm for Shortest-Path River Network Distance Calculations Considering River Flow Direction. Data, 5.","DOI":"10.3390\/data5010008"},{"key":"ref_61","first-page":"938","article-title":"Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes","volume":"34","author":"Tao","year":"2020","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Junshu, H., Liu, Y., Tian, L., and Zheng, Y. (2021, January 23\u201325). Dynamic A* Algorithm to Improve Dynamic Path Planning of Unmanned Epidemic Prevention and Killing Vehicles. Proceedings of the 2021 14th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI), Shanghai, China.","DOI":"10.1109\/CISP-BMEI53629.2021.9624320"},{"key":"ref_63","first-page":"1","article-title":"A Computationally Reproducible Approach to Dijkstra\u2019s Shortest Path Algorithm","volume":"2","author":"Uygun","year":"2022","journal-title":"Adv. Geomat."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"110660","DOI":"10.1016\/j.asoc.2023.110660","article-title":"Real-time path planning of controllable UAV by subgoals using goal-conditioned reinforcement learning","volume":"146","author":"Lee","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s42452-023-05349-0","article-title":"Accessibility strategies to promote inclusive mobility through multi-objective approach","volume":"5","author":"Silva","year":"2023","journal-title":"SN Appl. Sci."},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Schichler, L., Festl, K., Solmaz, S., and Watzenig, D. (2024, January 22\u201323). A Cost-Effective Approach to Smooth A* Path Planning for Autonomous Vehicles. Proceedings of the 2024 IEEE International Automated Vehicle Validation Conference (IAVVC), Pittsburgh, PA, USA.","DOI":"10.1109\/IAVVC63304.2024.10786408"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Hlad\u00edk, R., Rozho\u0148, V., Tarjan, R., and Tet\u0115k, J. (2024, January 27\u201330). Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. Proceedings of the 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), Chicago, IL, USA.","DOI":"10.1109\/FOCS61266.2024.00125"},{"key":"ref_68","unstructured":"Huiming, Z. (2025, May 19). Gitub Repository Algorithms Implementation Including Search-Based Algorithms and Sampling-Based Algorithms. Available online: https:\/\/github.com\/zhm-real\/PathPlanning."},{"key":"ref_69","unstructured":"Pymoo (2025, May 19). Multi-Objective Optimization in Python. Available online: https:\/\/pymoo.org\/."},{"key":"ref_70","unstructured":"Dillenburg, J., and Boyce, D. (1998). Techniques For Improving The Efficiency Of Heuristic Search, University of Illinois at Chicago. Available online: https:\/\/www.researchgate.net\/publication\/2861191_Techniques_For_Improving_The_Efficiency_Of_Heuristic_Search."},{"key":"ref_71","unstructured":"Chen, K. (2022). An Improved A* Search Algorithm for Road Networks Using New Heuristic Estimation. arXiv."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(95)00017-9","article-title":"BIDA*: An improved perimeter search algorithm","volume":"72","author":"Manzini","year":"1995","journal-title":"Artif. Intell."},{"key":"ref_73","unstructured":"Zelinka, I., Duy, V., and Cha, J. (2014). Experimental Comparison of A* and D* Lite Path Planning Algorithms for Differential Drive Automated Guided Vehicle. AETA 2013: Recent Advances in Electrical Engineering and Related Sciences, Springer. Lecture Notes in Electrical Engineering."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Le, A., Bui, M., Le, T., and Nauth, P. (2017, January 10\u201312). D* Lite with Reset: Improved Version of D* Lite for Complex Environment. Proceedings of the 2017 First IEEE International Conference on Robotic Computing (IRC), Taichung, Taiwan.","DOI":"10.1109\/IRC.2017.52"},{"key":"ref_75","unstructured":"Le, A.T., and Le, T.D. (2025, May 19). Search-Based Planning and Replanning in Robotics and Autonomous Systems [Internet]. Advanced Path Planning for Mobile Entities. InTech. Available online: https:\/\/www.intechopen.com\/chapters\/58561."},{"key":"ref_76","first-page":"64629","article-title":"Adapted D* Lite to Improve Guidance, Navigation and Control of a Tail-Actuated Underwater Vehicle in Unknown Environments","volume":"11","author":"Minchala","year":"2023","journal-title":"IEEE"},{"key":"ref_77","unstructured":"Rios, L., and Chaimowicz, L. (2025, May 19). PNBA *: A Parallel Bidirectional Heuristic Search Algorithm. Available online: https:\/\/api.semanticscholar.org\/CorpusID:17397922."},{"key":"ref_78","unstructured":"Hwu, W.-M.W. (2012). Chapter 22\u2014Real-Time Adaptive GPU Multiagent Path Planning. Applications of GPU Computing Series, GPU Computing Gems Jade Edition, Morgan Kaufmann."}],"container-title":["Applied Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2076-3417\/15\/15\/8273\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:15:56Z","timestamp":1760033756000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2076-3417\/15\/15\/8273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,25]]},"references-count":78,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["app15158273"],"URL":"https:\/\/doi.org\/10.3390\/app15158273","relation":{},"ISSN":["2076-3417"],"issn-type":[{"value":"2076-3417","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,25]]}}}