{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T16:39:51Z","timestamp":1787935191430,"version":"build-2784847793"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/icca.2019.8899975","type":"proceedings-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:20:18Z","timestamp":1574706018000},"page":"487-493","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Path Planning Algorithm for Mobile Robots"],"prefix":"10.1109","author":[{"given":"Zheng","family":"Zeng","sequence":"first","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering,Changsha,China,410082"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Sun","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering,Changsha,China,410082"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering,Changsha,China,410082"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Xue","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering,Changsha,China,410082"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Qian","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering,Changsha,China,410082"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"903","article-title":"Mobile Robot Path Planning Based on an Improved A* Algorithm [J]","volume":"40","author":"zhao","year":"2018","journal-title":"Robot"},{"key":"ref11","first-page":"55","article-title":"Urban UAV route planning based on bidirectional A* algorithm[J]","volume":"33","author":"lin","year":"2016","journal-title":"Journal of Shenyang Aerospace University"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1609\/aaai.v25i1.7994","article-title":"Online graph pruning for pathfinding on grid maps[C]","author":"harabor","year":"2011","journal-title":"25th AAAI Conference on Artificial Intelligence"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.275"},{"key":"ref15","first-page":"3411","article-title":"Bidirectional search that is guaranteed to meet in the middle","author":"holte","year":"2016","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.02.023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.12.008"},{"key":"ref6","first-page":"28","article-title":"Path Planning for Mobile Robots Using Iterative Artificial Potential Field Method[J]","volume":"8","author":"adeli","year":"2011","journal-title":"International Journal of Computer Science Issues"},{"key":"ref5","first-page":"38","article-title":"Path Planning Research Based on Artificial Potential Field Method with Invasive Weed Method[J]","volume":"22","author":"li","year":"2015","journal-title":"Control Engineering of China"},{"key":"ref8","first-page":"6","article-title":"Research on Path Planning Based on Simulated Annealing Algorithm and Neural Network Algorithm [J]","volume":"32","author":"li","year":"2017","journal-title":"Automation & Instrumentation"},{"key":"ref7","first-page":"18","article-title":"Robot Global Path Planning Based on Ant Colony optimization with Artificial Potential Field[J]","volume":"46","author":"liu","year":"2015","journal-title":"Transactions of the Chinese Society for Agricultural Machinery"},{"key":"ref2","first-page":"134","article-title":"Obstacle Avoidance Path Planning of Mobile Robots Based on Potential Grid Method [J]","volume":"21","author":"ouyang","year":"2014","journal-title":"Control Engineering of China"},{"key":"ref1","first-page":"961","article-title":"Survey on technology of mobile robot path planning[J]","volume":"25","author":"zhu","year":"2010","journal-title":"Control and Decision"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths[J]","volume":"4","author":"pe","year":"1968","journal-title":"IEEE Transactions on Systems Science and Cybernetics"}],"event":{"name":"2019 IEEE 15th International Conference on Control and Automation (ICCA)","location":"Edinburgh, UK","start":{"date-parts":[[2019,7,16]]},"end":{"date-parts":[[2019,7,19]]}},"container-title":["2019 IEEE 15th International Conference on Control and Automation (ICCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8892593\/8899472\/08899975.pdf?arnumber=8899975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:32:28Z","timestamp":1755714748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8899975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icca.2019.8899975","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}