{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:10:04Z","timestamp":1755907804121,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,9,22]]},"DOI":"10.1145\/3660395.3660489","type":"proceedings-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T18:30:40Z","timestamp":1717266640000},"page":"537-541","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved path planning for hexapod robot optimized by A* algorithm"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5981-0873","authenticated-orcid":false,"given":"Haibin","family":"Zou","sequence":"first","affiliation":[{"name":"School of Automation and Electrical Engineering, LinYi Uuniversity, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4947-9940","authenticated-orcid":false,"given":"Ruquan","family":"Liang","sequence":"additional","affiliation":[{"name":"School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6427-2345","authenticated-orcid":false,"given":"Liu","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mechanical and Vehicle Engineering, LinYi Uuniversity, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2016\/v9i41\/93816"},{"issue":"34","key":"e_1_3_2_1_2_1","first-page":"15213","article-title":"Path planning of logistics robot based on improved A* and DWA algorithms [J]","volume":"22","author":"Yang Jiahua","year":"2022","unstructured":"Yang Jiahua, Wei Jiale. Path planning of logistics robot based on improved A* and DWA algorithms [J]. Science Technology and Engineering, 2022, 22(34):15213-15220.","journal-title":"Science Technology and Engineering"},{"issue":"2","key":"e_1_3_2_1_3_1","first-page":"368","article-title":"algorithm and artificial potential field algorithm for mobile robot path planning [J]","volume":"44","author":"Keshuai FAN","year":"2021","unstructured":"ZHOU Keshuai, FAN Pingqing. Improved A* algorithm and artificial potential field algorithm for mobile robot path planning [J]. Electronic Devices, 2021, 44(2):368-374.","journal-title":"Electronic Devices"},{"key":"e_1_3_2_1_4_1","volume-title":"Research on AGV path planning and obstacle avoidance algorithm[D]","author":"Zhang Zhiwen","year":"2018","unstructured":"Zhang Zhiwen. Research on AGV path planning and obstacle avoidance algorithm[D]. Chengdu: University of Electronic Science and Technology of China, 2018."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1486\/3\/032018"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2015.2505646"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2421493"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2016.03.010"},{"key":"e_1_3_2_1_9_1","volume-title":"Research on Multi-AGV path planning Algorithm for Intelligent Warehousing [D]","author":"Yang","year":"2024","unstructured":"Yang. Research on Multi-AGV path planning Algorithm for Intelligent Warehousing [D]. Hefei University of Technology, 2024: 31-36."},{"issue":"20","key":"e_1_3_2_1_10_1","first-page":"4149","article-title":"with linearcomplexity for robot path planning problems in large- scale grid environments [J]","volume":"10","author":"H\u00c2 ARI I","year":"2016","unstructured":"AMMAR A, BENNACEUR H, CH\u00c2ARI I, Relaxed Dijkstra and A* with linearcomplexity for robot path planning problems in large- scale grid environments [J]. Soft Computing, 2016, 10(20): 4149-4171.","journal-title":"Soft Computing"},{"issue":"12","key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Research on path planning of mobile robot based on improved A* algorithm optimization [J]","volume":"2018","author":"Hao LI","unstructured":"CHEN Hao, LI Yong, LUO Jingdi. Research on path planning of mobile robot based on improved A* algorithm optimization [J]. Automation and Instrumentation, 2018 (12):1-4.","journal-title":"Automation and Instrumentation"},{"key":"e_1_3_2_1_12_1","volume-title":"Research on path planning of hexapod robot based on improved A* algorithm[D]","author":"Yang Lei","year":"2021","unstructured":"Yang Lei, Research on path planning of hexapod robot based on improved A* algorithm[D]. Wuhan: Hubei University of Technology, 2021: 26-37."},{"key":"e_1_3_2_1_13_1","volume-title":"Research on path smoothing technology based on cubic non-uniform B-spline [D]","author":"Yinhui","year":"2022","unstructured":"FAN Yinhui. Research on path smoothing technology based on cubic non-uniform B-spline [D]. Shandong Jianzhu University, 2022."},{"key":"e_1_3_2_1_14_1","volume-title":"Research on trajectory planning of collaborative robot based on B-spline curve [D]","author":"Chenhui","year":"2023","unstructured":"LU Chenhui. Research on trajectory planning of collaborative robot based on B-spline curve [D]. Yancheng Institute of Technology, 2023: 13-19."}],"event":{"name":"AIBDF 2023: 2023 3rd Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence and Big Data Forum","acronym":"AIBDF 2023","location":"Guangzhou China"},"container-title":["Proceedings of the 2023 3rd Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence and Big Data Forum"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3660395.3660489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3660395.3660489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T23:33:08Z","timestamp":1755905588000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3660395.3660489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":14,"alternative-id":["10.1145\/3660395.3660489","10.1145\/3660395"],"URL":"https:\/\/doi.org\/10.1145\/3660395.3660489","relation":{},"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"2024-06-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}