{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:18:47Z","timestamp":1778149127846,"version":"3.51.4"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2108085MF225"],"award-info":[{"award-number":["2108085MF225"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Project of China International Science and Technology Cooperation Base on Intelligent Equipment Manufacturing in Special Service Environment","award":["ISTC2021KF07"],"award-info":[{"award-number":["ISTC2021KF07"]}]},{"name":"China National Key Research and Development","award":["2017YFE0113200"],"award-info":[{"award-number":["2017YFE0113200"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3179397","type":"journal-article","created":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T21:58:15Z","timestamp":1653947895000},"page":"57736-57747","source":"Crossref","is-referenced-by-count":94,"title":["A Mobile Robot Path Planning Algorithm Based on Improved A* Algorithm and Dynamic Window Approach"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5025-4127","authenticated-orcid":false,"given":"Yonggang","family":"Li","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering, Anhui University of Technology, Maanshan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1443-0111","authenticated-orcid":false,"given":"Rencai","family":"Jin","sequence":"additional","affiliation":[{"name":"China MCC17 Group Company Ltd., Maanshan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6055-6797","authenticated-orcid":false,"given":"Xiangrong","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering, Anhui University of Technology, Maanshan, China"}]},{"given":"Yuandi","family":"Qian","sequence":"additional","affiliation":[{"name":"China MCC17 Group Company Ltd., Maanshan, China"}]},{"given":"Haiyan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Osaka Medical Engineering, Maanshan University, Maanshan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9413-594X","authenticated-orcid":false,"given":"Shanshan","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Osaka Medical Engineering, Maanshan University, Maanshan, China"}]},{"given":"Zhixiong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Medicine, Osaka University, Osaka, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.03.035"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65978-7_80"},{"issue":"6","key":"ref3","first-page":"903","article-title":"Path planning for mobile robot based on improved A* algorithm","volume":"40","author":"Zhao","year":"2018","journal-title":"Robot"},{"issue":"18","key":"ref4","first-page":"205","article-title":"A* path optimization method with ensuring safe distance","volume":"56","author":"Duan","year":"2020","journal-title":"J. Mech. Eng."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-021-01437-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2068\/1\/012015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1848\/1\/012013"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0954407020959741"},{"issue":"10","key":"ref10","first-page":"1624","article-title":"Global path planning for mobile robots based on bidirectional hop search algorithm","volume":"39","author":"Ma","year":"2020","journal-title":"Mech. Sci. Technol. Aerosp. Eng."},{"issue":"5","key":"ref11","first-page":"1523","article-title":"The shortest path planning for mobile robots using improved A* algorithm","volume":"38","author":"Wei","year":"2018","journal-title":"J. Comput. Appl."},{"issue":"12","key":"ref12","first-page":"261","article-title":"Research on path planning algorithm of unknown environment based on multi-layer bidirectional A*","volume":"36","author":"Du","year":"2019","journal-title":"Comput. Appl. Softw."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2016.07.610"},{"issue":"5","key":"ref14","first-page":"617","article-title":"Local path planning for outdoor cleaning robot based on improved dynamic window method","volume":"42","author":"Zhang","year":"2020","journal-title":"Robot"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1905\/1\/012019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4236\/jcc.2016.42002"},{"issue":"20","key":"ref17","first-page":"2489","article-title":"Path planning for mobile robot based on A* algorithm and artificial potential field method","volume":"30","author":"Wang","year":"2019","journal-title":"China Mech. Eng."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/70.988971"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.05.012"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2868339"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2161-7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363613"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08338-4_23"},{"key":"ref24","first-page":"132","article-title":"Research on robot random obstacle avoidance method based on fusion of improved A* algorithm and dynamic window method","volume":"42","author":"Xu","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.01.050"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09785836.pdf?arnumber=9785836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:01:38Z","timestamp":1706752898000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9785836\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3179397","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}