{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:02:31Z","timestamp":1782403351324,"version":"3.54.5"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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,12]]},"DOI":"10.1109\/robio49542.2019.8961757","type":"proceedings-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:49:51Z","timestamp":1579618191000},"page":"2085-2091","source":"Crossref","is-referenced-by-count":15,"title":["Locally Guided Multiple Bi-RRT\u2217 for Fast Path Planning in Narrow Passages"],"prefix":"10.1109","author":[{"given":"Xin","family":"Shu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology,The State Key Laboratory of Robotics and System,Harbin,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fenglei","family":"Ni","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,The State Key Laboratory of Robotics and System,Harbin,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhou","family":"Zhou","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,The State Key Laboratory of Robotics and System,Harbin,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yechao","family":"Liu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,The State Key Laboratory of Robotics and System,Harbin,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,The State Key Laboratory of Robotics and System,Harbin,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tian","family":"Zou","sequence":"additional","affiliation":[{"name":"KUKA JV(Shunde),Department of system dynamics,Foshan,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570709"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00312-7"},{"key":"ref12","article-title":"Optimal bidirectional rapidly-exploring random trees","author":"jordan","year":"2013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308756"},{"key":"ref16","first-page":"1011","article-title":"Path planning with forests of random trees: Parallelization with super linear speedup","author":"otte","year":"2011","journal-title":"Dep Comput Sci Univ Color Boulder Tech Rep CU-CS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-017-0641-3"},{"key":"ref18","article-title":"Narrow Passage Identification Based Robot Path Planning","volume":"4","author":"zhong","year":"2012","journal-title":"Int J Adv Comput Technol"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","article-title":"Narrow passage sampling for probabilistic roadmap planning","volume":"21","author":"sun","year":"2005","journal-title":"IEEE Trans Robot"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref3","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095077"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.503582"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMA.2009.5246014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509529"},{"key":"ref22","first-page":"17","article-title":"EBK-Means : A Clustering Technique based on Elbow Method and K-Means in WSN","volume":"105","author":"bholowalia","year":"2014"},{"key":"ref21","first-page":"1027","article-title":"K-means++: The advantages of careful seeding","volume":"709 january 2007","author":"arthur","year":"2007","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"}],"event":{"name":"2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)","location":"Dali, China","start":{"date-parts":[[2019,12,6]]},"end":{"date-parts":[[2019,12,8]]}},"container-title":["2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8953068\/8961374\/08961757.pdf?arnumber=8961757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:09:17Z","timestamp":1657840157000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8961757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/robio49542.2019.8961757","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}