{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:08:42Z","timestamp":1782317322219,"version":"3.54.5"},"reference-count":23,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shanghai Sailing Program","award":["21YF1400500"],"award-info":[{"award-number":["21YF1400500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Intelligent mobile robots have been gradually used in various fields, including logistics, healthcare, service, and maintenance. Path planning is a crucial aspect of intelligent mobile robot research, which aims to empower robots to create optimal trajectories within complex and dynamic environments autonomously. This study introduces an improved A* algorithm to address the challenges faced by the preliminary A* pathfinding algorithm, which include limited efficiency, inadequate robustness, and excessive node traversal. Firstly, the node storage structure is optimized using a minimum heap to decrease node traversal time. In addition, the heuristic function is improved by adding an adaptive weight function and a turn penalty function. The original 8-neighbor is expanded to a 16-neighbor within the search strategy, followed by the elimination of invalid search neighbor to refine it into a new 8-neighbor according to the principle of symmetry, thereby enhancing the directionality of the A* algorithm and improving search efficiency. Furthermore, a bidirectional search mechanism is implemented to further reduce search time. Finally, trajectory optimization is performed on the planned paths using path node elimination and cubic Bezier curves, which aligns the optimized paths more closely with the kinematic constraints of the robot derivable trajectories. In simulation experiments on grid maps of different sizes, it was demonstrated that the proposed improved A* algorithm outperforms the preliminary A* Algorithm in various metrics, such as search efficiency, node traversal count, path length, and inflection points. The improved algorithm provides substantial value for practical applications by efficiently planning optimal paths in complex environments and ensuring robot drivability.<\/jats:p>","DOI":"10.3390\/sym16101311","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T07:49:42Z","timestamp":1728028182000},"page":"1311","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Research on Path Planning for Intelligent Mobile Robots Based on Improved A* Algorithm"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9180-4826","authenticated-orcid":false,"given":"Dexian","family":"Wang","sequence":"first","affiliation":[{"name":"School of Intelligent Manufacturing and Control Engineering, Shanghai Polytechnic University, Shanghai 201209, China"},{"name":"School of Electrical Engineering, Shanghai University of Electric Power, Shanghai 200090, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6529-8234","authenticated-orcid":false,"given":"Qilong","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing and Control Engineering, Shanghai Polytechnic University, Shanghai 201209, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinghui","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing and Control Engineering, Shanghai Polytechnic University, Shanghai 201209, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Delin","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing and Control Engineering, Shanghai Polytechnic University, Shanghai 201209, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,10,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3390\/drones7030211","article-title":"Review of autonomous path planning algorithms for mobile robots","volume":"7","author":"Qin","year":"2023","journal-title":"Drones"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"6082","DOI":"10.3390\/s23136082","article-title":"Particle swarm algorithm path-planning method for mobile robots based on artificial potential fields","volume":"23","author":"Zheng","year":"2023","journal-title":"Sensors"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"96733","DOI":"10.1109\/ACCESS.2023.3311023","article-title":"Local path planning: Dynamic window approach with Q-learning considering congestion environments for mobile robot","volume":"11","author":"Kobayashi","year":"2023","journal-title":"IEEE Access"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Yin, Y., and Lyu, H. (2023). Automatic collision avoidance algorithm based on route-plan-guided artificial potential field method. Ocean. Eng., 271.","DOI":"10.1016\/j.oceaneng.2023.113737"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wang, T., Li, A., Guo, D., Du, G., and He, W. (2024). Global Dynamic Path Planning of AGV Based on Fusion of Improved A* Algorithm and Dynamic Window Method. Sensors, 24.","DOI":"10.3390\/s24062011"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kozhubaev, Y., and Yang, R. (2024). Simulation of Dynamic Path Planning of Symmetrical Trajectory of Mobile Robots Based on Improved A* and Artificial Potential Field Fusion for Natural Resource Exploration. Symmetry, 16.","DOI":"10.3390\/sym16070801"},{"key":"ref_7","first-page":"9590367","article-title":"An effective path planning of intelligent mobile robot using improved genetic algorithm","volume":"2022","author":"Chen","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.3390\/electronics12153263","article-title":"Research progress of nature-inspired metaheuristic algorithms in mobile robot path planning","volume":"12","author":"Xu","year":"2023","journal-title":"Electronics"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3660","DOI":"10.3390\/electronics11223660","article-title":"Research on path-planning algorithm integrating optimization A-star algorithm and artificial potential field method","volume":"11","author":"Liu","year":"2022","journal-title":"Electronics"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Guo, B., Kuang, Z., Guan, J., Hu, M., Rao, L., and Sun, X. (2022). An improved a-star algorithm for complete coverage path planning of unmanned ships. Inter. J. Pattern Recogn. Art. Intell., 36.","DOI":"10.1142\/S0218001422590091"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhang, H., Tao, Y., and Zhu, W. (2023). Global path planning of unmanned surface vehicle based on improved A-Star algorithm. Sensors, 23.","DOI":"10.3390\/s23146647"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Liu, C., Mao, Q., Chu, X., and Xie, S. (2019). An improved A-star algorithm considering water current, traffic separation and berthing for vessel path planning. Appl. Sci., 9.","DOI":"10.3390\/app9061057"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Gasparetto, A., Boscariol, P., Lanzutti, A., and Vidoni, R. (2015). Path planning and trajectory planning algorithms: A general overview. Motion and Operation Planning of Robotic Systems: Background and Practical Approaches, Springer.","DOI":"10.1007\/978-3-319-14705-5_1"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Liu, L., Wang, X., Yang, X., Liu, H., Li, J., and Wang, P. (2023). Path planning techniques for mobile robots: Review and prospect. Expert Syst. Appl., 227.","DOI":"10.1016\/j.eswa.2023.120254"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, C., Wu, H., and Wei, Y. (2023). Mobile Robot Path Planning Based on Kinematically Constrained A-Star Algorithm and DWA Fusion Algorithm. Mathematics, 11.","DOI":"10.3390\/math11214552"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Chen, G., Chen, S., Li, X., Zhou, P., and Zhou, Z. (2018). Optimal seamline detection for orthoimage mosaicking based on DSM and improved JPS algorithm. Remote Sens., 10.","DOI":"10.3390\/rs10060821"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3963","DOI":"10.1007\/s13369-023-08232-7","article-title":"An Improved JPS Algorithm for Global Path Planning of the Seabed Mining Vehicle","volume":"49","author":"Fan","year":"2024","journal-title":"Arabian J. Sci. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Zhang, B., and Zhu, D. (2021). A new method on motion planning for mobile robots using jump point search and Bezier curves. Int. J. Adv. Robot. Syst., 18.","DOI":"10.1177\/17298814211019220"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hu, S., Tian, S., Zhao, J., and Shen, R. (2023). Path planning of an unmanned surface vessel based on the improved A-Star and dynamic window method. J. Mar. Sci. Eng., 11.","DOI":"10.3390\/jmse11051060"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"5275","DOI":"10.1109\/LRA.2023.3293319","article-title":"Tmstc*: A path planning algorithm for minimizing turns in multi-robot coverage","volume":"8","author":"Lu","year":"2023","journal-title":"IEEE Robot. Autom. Let."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhang, C., Yang, X., Zhou, R., and Guo, Z. (2024). A Path Planning Method Based on Improved A* and Fuzzy Control DWA of Underground Mine Vehicles. Appl. Sci., 14.","DOI":"10.3390\/app14073103"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Lai, W.K., Shieh, C.S., and Yang, C.P. (2022). A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths. Mathematics, 10.","DOI":"10.3390\/math10183321"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Lai, R., Wu, Z., Liu, X., and Zeng, N. (2023). Fusion algorithm of the improved A* algorithm and segmented bezier curves for the path planning of mobile robots. Sustainability, 15.","DOI":"10.3390\/su15032483"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/10\/1311\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:10:35Z","timestamp":1760112635000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/10\/1311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,4]]},"references-count":23,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["sym16101311"],"URL":"https:\/\/doi.org\/10.3390\/sym16101311","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,4]]}}}