{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T20:30:09Z","timestamp":1771360209289,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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,5]]},"DOI":"10.1109\/icnsc.2019.8743249","type":"proceedings-article","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T17:32:01Z","timestamp":1561483921000},"page":"257-262","source":"Crossref","is-referenced-by-count":8,"title":["The Path Planning of Mobile Robots Based on an Improved A* Algorithm"],"prefix":"10.1109","author":[{"given":"Lu","family":"Chang","sequence":"first","affiliation":[{"name":"School of Automation, Nanjing University of Science & Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Shan","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Science & Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Science & Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuewei","family":"Dai","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Science & Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Improve A* algorithm and apply to indoor path planning for mobile robots","author":"chen","year":"0","journal-title":"Journal of Computer Applications"},{"key":"ref11","first-page":"1395","article-title":"A* algorithm based on direction constraints","volume":"32","author":"li","year":"2017","journal-title":"Control and Design"},{"key":"ref12","first-page":"1647","article-title":"Mobile robot optimal path planning based on smoothing A* algorithm","volume":"38","author":"wang","year":"2010","journal-title":"Journal of Tongji University (Natural Science)"},{"key":"ref13","first-page":"627","article-title":"An improved A* algorithm for searching infinite neighbourhoods","volume":"36","author":"xin","year":"2014","journal-title":"Robot"},{"key":"ref14","first-page":"1","article-title":"Bank-to-turn guidance law with terminal impact-angle constraint","volume":"29","author":"wen","year":"2016","journal-title":"Journal of Aerospace Engineering"},{"key":"ref4","first-page":"961","article-title":"Survey on technology of mobile robot path planning","volume":"25","author":"zhu","year":"2010","journal-title":"Control and Decision"},{"key":"ref3","first-page":"18","article-title":"Robot global path planning based on ant colony optimization with artificial potential field","volume":"46","author":"liu","year":"2015","journal-title":"Transactions of The Chinese Society of Agricultural Machinery"},{"key":"ref6","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","volume":"4","author":"peter","year":"1968","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"ref5","first-page":"1229","article-title":"Path planning algorithm based on grid method for virtual human","volume":"5","author":"liu","year":"2008","journal-title":"Computer Engineering and Design"},{"key":"ref8","first-page":"3310","article-title":"Optimal and efficient path planning for partially-known environments","author":"stentz","year":"2002","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2010.12.009"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.robot.2016.04.007","article-title":"A novel potential field method for path planning of mobile robots by adapting animal motion attributes","volume":"82","author":"tajti","year":"2016","journal-title":"Robotics & Autonomous Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0754-y"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"}],"event":{"name":"2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC)","location":"Banff, AB, Canada","start":{"date-parts":[[2019,5,9]]},"end":{"date-parts":[[2019,5,11]]}},"container-title":["2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8737693\/8743149\/08743249.pdf?arnumber=8743249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T19:14:11Z","timestamp":1674587651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8743249\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2019.8743249","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}