{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T20:50:47Z","timestamp":1783630247166,"version":"3.55.0"},"reference-count":23,"publisher":"MDPI AG","issue":"16","license":[{"start":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T00:00:00Z","timestamp":1660780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61933012"],"award-info":[{"award-number":["61933012"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In obstacle spatial path planning, the traditional A* algorithm has the problem of too many turning points and slow search speed. With this in mind, a path planning method that improves the A* (A-Star) algorithm is proposed. The mobile robot platform was equipped with a lidar and inertial measurement unit (IMU). The Hdl_graph_slam mapping algorithm was used to construct a two-dimensional grid map, and the improved A* algorithm was used for path planning of the mobile robot. The algorithm introduced the path smoothing strategy and safety protection mechanism, and it eliminated redundant points and minimal corner points by judging whether there were obstacles in the connection of two path nodes. The algorithm effectively improved the smoothness of the path and facilitated the robot to move in the actual operation. It could avoid the wear of the robot by expanding obstacles and improving the safety performance of the robot. Subsequently, the algorithm introduced the steering cost model and the adaptive cost function to improve the search efficiency, making the search purposeful and effective. Lastly, the effectiveness of the proposed algorithm was verified by experiments. The average path search time was reduced by 13%. The average search extension node was reduced by 11%. The problems of too many turning points and slow search speed of traditional A* algorithm in path planning were improved.<\/jats:p>","DOI":"10.3390\/s22166198","type":"journal-article","created":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T23:28:41Z","timestamp":1660865321000},"page":"6198","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":73,"title":["Improved A* Path Planning Method Based on the Grid Map"],"prefix":"10.3390","volume":"22","author":[{"given":"Yangqi","family":"Ou","sequence":"first","affiliation":[{"name":"College of Automation, Chongqing University, Chongqing 400044, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0848-6159","authenticated-orcid":false,"given":"Yuexin","family":"Fan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinglan","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanhua","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weijing","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,18]]},"reference":[{"key":"ref_1","first-page":"14","article-title":"Improved A* algorithm of mobile robot path planning and design","volume":"32","author":"Shen","year":"2022","journal-title":"J. Tianjing Univ. Technol. Edu."},{"key":"ref_2","first-page":"386","article-title":"Mobile Robot Path Planning Based on Improved A* Algorithm","volume":"38","author":"Wang","year":"2021","journal-title":"Comput. Simul."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Li, Y., and Shi, C. (December, January 30). Localization and Navigation for Indoor Mobile Robot Based on ROS. Proceedings of the 2018 Chinese Automation Congress, Xi\u2019an, China.","DOI":"10.1109\/CAC.2018.8623225"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Li, L., Wu, W., and Jiao, Y. (2021, January 22\u201324). Application of improved Dijkstra algorithm in intelligent ship path planning. Proceedings of the 2021 33rd Chinese Control and Decision Conference, Kunming, China.","DOI":"10.1109\/CCDC52312.2021.9602021"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"147827","DOI":"10.1109\/ACCESS.2020.3015976","article-title":"Surface Optimal Path Planning Using an Extended Dijkstra Algorithm","volume":"8","author":"Luo","year":"2020","journal-title":"IEEE Access"},{"key":"ref_6","first-page":"153","article-title":"Path Planning for Mobile Robots based on Improved D * Lite and Artificial Potential Field Method","volume":"44","author":"Du","year":"2022","journal-title":"Manuf. Autom."},{"key":"ref_7","first-page":"63","article-title":"Optimal escape path planning and design based on D* Lite algorithm","volume":"19","author":"Zhang","year":"2021","journal-title":"Sci. Technol. Innov."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1109\/TMECH.2020.3023261","article-title":"Multiobjective Scheduling Strategy with Genetic Algorithm and Time-Enhanced A* Planning for Autonomous Parking Robotics in High-Density Unmanned Parking Lots","volume":"26","author":"Chen","year":"2021","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Ma, T., Wang, T., Yan, D., and Hu, J. (2020, January 14\u201316). Improved genetic algorithm based on K-Means to solve path planning problem. Proceedings of the 2020 International Conference on Information Science, Parallel and Distributed Systems, Xi\u2019an, China.","DOI":"10.1109\/ISPDS51347.2020.00065"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Li, Y., Tian, B., Yang, Y., and Li, C. (2022, January 4\u20136). Path planning of robot based on artificial potential field method. Proceedings of the 2022 IEEE 6th Information Technology and Mechatronics Engineering Conference, Chongqing, China.","DOI":"10.1109\/ITOEC53115.2022.9734712"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ju, C., Luo, Q., and Yan, X. (2020, January 23\u201325). Path Planning Using an Improved A-star Algorithm. Proceedings of the 2020 11th International Conference on Prognostics and System Health Management (PHM-2020 Jinan), Jinan, China.","DOI":"10.1109\/PHM-Jinan48558.2020.00012"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"59196","DOI":"10.1109\/ACCESS.2021.3070054","article-title":"Geometric A-Star Algorithm: An Improved A-Star Algorithm for AGV Path Planning in a Port Environment","volume":"9","author":"Tang","year":"2021","journal-title":"IEEE Access"},{"key":"ref_13","first-page":"90","article-title":"Indoor Autonomous Navigation Mobile Robot System Based on ROS","volume":"41","author":"Ye","year":"2022","journal-title":"Sens. Microsyst."},{"key":"ref_14","first-page":"795","article-title":"Improved A* Algorithm for Mobile Robot Path Planning","volume":"41","author":"Yang","year":"2022","journal-title":"Mech. Sci. Technol. Aerosp. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","article-title":"Research on Path Planning of Mobile Robot Based on Improved Ant Colony Algorithm","volume":"32","author":"Luo","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wang, H., Lou, S., Jing, J., Wang, Y., Liu, W., and Liu, T. (2022). The EBS-A* algorithm: An improved A* algorithm for path planning. PLoS ONE, 17.","DOI":"10.1371\/journal.pone.0263841"},{"key":"ref_17","unstructured":"Ni, Z.K. (2020). Research on MOBILE Robot SLAM Algorithm Based on 3D Laser. [Master\u2019s Thesis, Suzhou University]."},{"key":"ref_18","unstructured":"Biber, P., and Strasser, W. (2003, January 27\u201331). The normal distributions transform: A new approach to laser scan matching. Proceedings of the IEEE International Workshop on Intelligent Robots and Systems, Beijing, China."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/cgf.14134","article-title":"Fast Out-of-Core Octree Generation for Massive Point Clouds","volume":"39","author":"Ohrhallinger","year":"2020","journal-title":"Comput. Graph. Forum"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1111\/tgis.12308","article-title":"Semantic Enrichment of Octree Structured Point Clouds for Multi-story 3D Pathfinding","volume":"22","author":"Fichtner","year":"2018","journal-title":"Trans. GIS"},{"key":"ref_21","first-page":"258","article-title":"Design of A Multi-line LiDAR Outdoor Small Range Navigation Algorithm","volume":"4","author":"Cai","year":"2022","journal-title":"Mech. Des. Manuf."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Hu, Y., Hu, X., and Xing, B. (2020, January 5\u20136). Path Planning for Mobile Robot Based on RGB-D SLAM and Pedestrian Trajectory Prediction. Proceedings of the 2020 4th Annual International Conference on Data Science and Business Analytics (ICDSBA), Changsha, China.","DOI":"10.1109\/ICDSBA51020.2020.00094"},{"key":"ref_23","first-page":"368","article-title":"Improved A* Algorithm and Artificial Potential Field Algorithm for Mobile Robot Path Planning","volume":"44","author":"Zhou","year":"2021","journal-title":"Electron. Devices"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/6198\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:11:50Z","timestamp":1760141510000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/6198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,18]]},"references-count":23,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["s22166198"],"URL":"https:\/\/doi.org\/10.3390\/s22166198","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,18]]}}}