{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T23:29:29Z","timestamp":1794007769556,"version":"4.8.0"},"reference-count":36,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T00:00:00Z","timestamp":1523232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National High Technology Research and Development Program of China","award":["2009AA12Z311"],"award-info":[{"award-number":["2009AA12Z311"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41376109"],"award-info":[{"award-number":["41376109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The A* algorithm has been widely investigated and applied in path planning problems, but it does not fully consider the safety and smoothness of the path. Therefore, an improved A* algorithm is presented in this paper. Firstly, a new environment modeling method is proposed in which the evaluation function of A* algorithm is improved by taking the safety cost into account. This results in a safer path which can stay farther away from obstacles. Then a new path smoothing method is proposed, which introduces a path evaluation mechanism into the smoothing process. This method is then applied to smoothing the path without safety reduction. Secondly, with respect to path planning problems in complex terrains, a complex terrain environment model is established in which the distance and safety cost of the evaluation function of the A* algorithm are converted into time cost. This results in a unification of units as well as a clarity in their physical meanings. The simulation results show that the improved A* algorithm can greatly improve the safety and smoothness of the planned path and the movement time of the robot in complex terrain is greatly reduced.<\/jats:p>","DOI":"10.3390\/a11040044","type":"journal-article","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T13:06:08Z","timestamp":1523365568000},"page":"44","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":73,"title":["Safe Path Planning of Mobile Robot Based on Improved A* Algorithm in Complex Terrains"],"prefix":"10.3390","volume":"11","author":[{"given":"Hong-Mei","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Power and Mechanical Engineering, Wuhan University, Wuhan 430072, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8219-8967","authenticated-orcid":false,"given":"Ming-Long","family":"Li","sequence":"additional","affiliation":[{"name":"School of Power and Mechanical Engineering, Wuhan University, Wuhan 430072, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Le","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Power and Mechanical Engineering, Wuhan University, Wuhan 430072, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,9]]},"reference":[{"key":"ref_1","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W., Kavraki, L.E., and Thrun, S. (2005). Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planing Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"836","DOI":"10.3724\/SP.J.1016.2011.00836","article-title":"Multiobjective path planning under dynamic uncertain environment","volume":"34","author":"Wei","year":"2011","journal-title":"Chin. J. Comput."},{"key":"ref_4","first-page":"184","article-title":"Path planning based on improved artificial potential field for autonomous underwater vehicles","volume":"39","author":"Wang","year":"2011","journal-title":"J. Huazhong Univ. Sci. Technol."},{"key":"ref_5","first-page":"316","article-title":"Energy optimal path planning of electric vehicle based on improved A* algorithm","volume":"46","author":"Gu","year":"2015","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_6","first-page":"961","article-title":"Survey on technology of mobile robot path planning","volume":"25","author":"Zhu","year":"2010","journal-title":"Control Decis."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1996","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_8","unstructured":"Lavalle, S.M. (1998). Rapidly-exploring random trees: A new tool for path planning. Algorithmic and Computational Robotics New Directions, Taylor & Francis."},{"key":"ref_9","unstructured":"Hsu, D. (2000). Randomized Single-Query Motion Planning in Expansive Spaces. [Ph.D. Thesis, Stanford University]."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Karaman, S., and Frazzoli, E. (2010, January 27\u201330). Incremental sampling-based algorithms for optimal motion planning. Proceedings of the Robotics: Science and Systems Conference, Zaragoza, Spain.","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"ref_11","first-page":"50","article-title":"Mobile robot path planning based on improved artificial potential field method","volume":"43","author":"Yu","year":"2011","journal-title":"J. Harbin Inst. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, G.H., Tong, S.G., Cong, F.Y., Yamashita, A., and Asama, H. (2015, January 11\u201313). Improved artificial potential field-based simultaneous forward search method for robot path planning in complex environment. Proceedings of the IEEE\/SICE International Symposium on System Integration, Nagoya, Japan.","DOI":"10.1109\/SII.2015.7405075"},{"key":"ref_13","unstructured":"Thaker, N., Nikolakopoulos, G., and Gustafsson, T. (2013, January 28\u201330). On-line path planning for an articulated vehicle based on model predictive control. Proceedings of the IEEE International Conference on Control Applications, Hyderabad, India."},{"key":"ref_14","unstructured":"Chen, W.D., and Zhu, Q.G. (2011). Mobile robot path planning based on fuzzy algorithm. Acta Electron. Sin., 39."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1017\/S0263574714001064","article-title":"A fuzzy multi-stage path-planning method for a robot in a dynamic environment with unknown moving obstacles","volume":"33","author":"Mobadersany","year":"2015","journal-title":"Robotica"},{"key":"ref_16","first-page":"349","article-title":"Back propagation neural network to the application of cleaning robot\u2019s path planning","volume":"32","author":"Wang","year":"2009","journal-title":"J. Chongqing Univ."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1017\/S0263574714001878","article-title":"Optimal cooperative path planning of unmanned aerial vehicles by a parallel genetic algorithm","volume":"34","author":"Shorakaei","year":"2016","journal-title":"Robotica"},{"key":"ref_18","first-page":"53","article-title":"Research on method of global path-planning for mobile robot based on ant-colony algorithm","volume":"45","author":"Shi","year":"2014","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1080\/01691864.2016.1240627","article-title":"The free step length ant colony algorithm in mobile robot path planning","volume":"30","author":"Zeng","year":"2016","journal-title":"Adv. Robot."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ziadi, S., Njah, M., and Chtourou, M. (2016, January 21\u201324). PSO optimization of mobile robot trajectories in unknown environments. Proceedings of the 13th International Multi-Conference on System, Signals & Devices, Leipzig, Germany.","DOI":"10.1109\/SSD.2016.7473756"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/0952813X.2014.971442","article-title":"Optimal path planning for a mobile robot using cuckoo search algorithm","volume":"28","author":"Mohanty","year":"2016","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"ref_22","first-page":"857","article-title":"Path planning in dynamic environment based on improved shuffled frog leaping algorithm","volume":"54","author":"Wang","year":"2016","journal-title":"J. Jilin Univ."},{"key":"ref_23","first-page":"208","article-title":"Application of an improved A* algorithm in shortest route planning","volume":"32","author":"Shi","year":"2009","journal-title":"Geomat. Spat. Inf. Technol."},{"key":"ref_24","first-page":"556","article-title":"Gravity aided navigation path plan research based on A* algorithm","volume":"18","author":"Lu","year":"2010","journal-title":"J. Chin. Inert. Technol."},{"key":"ref_25","first-page":"315","article-title":"Path planning strategies for UAV based on improved A* algorithm","volume":"40","author":"Zhan","year":"2015","journal-title":"Geomat. Inf. Sci. Wuhan Univ."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/7.869506","article-title":"Robust algorithm for real-time route planning","volume":"36","author":"Szczerba","year":"2000","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"ref_27","first-page":"48","article-title":"Three-dimensional route planning based on an advanced A* algorithm","volume":"26","author":"Zhang","year":"2008","journal-title":"Flight Dyn."},{"key":"ref_28","first-page":"627","article-title":"An improved A* algorithm for searching infinite neighbourhoods","volume":"36","author":"Xin","year":"2014","journal-title":"Robot"},{"key":"ref_29","first-page":"1647","article-title":"Mobile robot optimal path planning based on smoothing A* algorithm","volume":"38","author":"Wang","year":"2010","journal-title":"J. Tongji Univ."},{"key":"ref_30","first-page":"155","article-title":"Smooth path design for mobile service robots based on improved A* algorithm","volume":"40","author":"Shan","year":"2010","journal-title":"J. Southeast Univ."},{"key":"ref_31","first-page":"1085","article-title":"Indoor mobile-robot path planning based on an improved A* algorithm","volume":"52","author":"Wang","year":"2012","journal-title":"J. Tsinghua Univ."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Harabor, D., and Grastien, A. (2011, January 7\u201311). Online graph pruning for pathfinding on grid maps. Proceedings of the AAAI Conference on Artificial Intelligence, San Francisco, CA, USA.","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Cheng, L.P., Liu, C.X., and Yan, B. (2014, January 26\u201331). Improved hierarchical A-star algorithm for optimal parking path planning of the large parking lot. Proceedings of the IEEE International Conference on Information & Automation, Hailar, China.","DOI":"10.1109\/ICInfA.2014.6932742"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez, J.D., Moll, M., Vidal, E., Carreras, M., and Kavraki, L.E. (2016, January 9\u201314). Planning feasible and safe paths online for autonomous underwater vehicles in unknown environments. Proceedings of the 2016 IEEE\/RSJ International Conference on Intelligent Robots and Systems, Daejeon, Korea.","DOI":"10.1109\/IROS.2016.7759217"},{"key":"ref_35","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_36","unstructured":"Moore, E.F. (1957, January 2\u20135). The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching, Cambridge, MA, USA."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/44\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:00:03Z","timestamp":1760194803000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,9]]},"references-count":36,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["a11040044"],"URL":"https:\/\/doi.org\/10.3390\/a11040044","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,9]]}}}