{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:16:23Z","timestamp":1725722183780},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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,10]]},"DOI":"10.1109\/iccais46528.2019.9074553","type":"proceedings-article","created":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T01:11:58Z","timestamp":1587690718000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Path Planning for Mobile Robot Using Improved Adaptive Rapidly-exploring Random Tree"],"prefix":"10.1109","author":[{"given":"Songcan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jiexin","family":"Pu","sequence":"additional","affiliation":[]},{"given":"Yanna","family":"Si","sequence":"additional","affiliation":[]},{"given":"Lifan","family":"Sun","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2487881"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"ref6","first-page":"293","article-title":"Rapidly-exploring random trees: Progress and prospects","author":"lavalle","year":"2000","journal-title":"Algorithmic and Computational Robotics New Directions"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.phpro.2011.11.098"},{"key":"ref5","first-page":"293","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"Algorithmic and Computational Robotics New Directions"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/RCAR.2016.7784090"},{"key":"ref7","first-page":"995","article-title":"Rrt-connect: An efficient approach to single-query path planning","author":"kuffner","year":"2002","journal-title":"IEEE International Conference on Robotics and Automation 2000 Proceedings ICRA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.071114"},{"key":"ref9","article-title":"Adaptive step-length rrt algorithm for improved coverage","author":"mccourt","year":"2015","journal-title":"AIAA Guidance Navigation and Control Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05783-5"}],"event":{"name":"2019 International Conference on Control, Automation and Information Sciences (ICCAIS)","start":{"date-parts":[[2019,10,23]]},"location":"Chengdu, China","end":{"date-parts":[[2019,10,26]]}},"container-title":["2019 International Conference on Control, Automation and Information Sciences (ICCAIS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9057249\/9074543\/09074553.pdf?arnumber=9074553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:14:53Z","timestamp":1658157293000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9074553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iccais46528.2019.9074553","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}