{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:43:45Z","timestamp":1740102225065,"version":"3.37.3"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,17]]},"DOI":"10.1109\/rcar58764.2023.10249227","type":"proceedings-article","created":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T17:36:59Z","timestamp":1695231419000},"page":"638-643","source":"Crossref","is-referenced-by-count":0,"title":["Focused Bidirectional Search Trees: A Bidirectional Optimal Fast Matching Method for Robot Path Planning"],"prefix":"10.1109","author":[{"given":"Chenming","family":"Li","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Electronic Engineering,Hong Kong SAR,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiankun","family":"Wang","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology,Shenzhen Key Laboratory of Robotics Perception and Intelligence,Department of Electronic and Electrical Engineering,Shenzhen,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max Q.-H.","family":"Meng","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology,Shenzhen Key Laboratory of Robotics Perception and Intelligence,Department of Electronic and Electrical Engineering,Shenzhen,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref15","first-page":"995","article-title":"RRT-connect: An efficient approach to single-query path planning","volume":"2","author":"kuffner","year":"2000","journal-title":"Proceedings 2000 ICRA Millennium Conference IEEE International Conference on Robotics and Automation Symposia Proceedings (Cat No 00CH37065)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACIRS.2018.8467243"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.05.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347059"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/net.20438"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.birob.2021.100001"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"lavalle","key":"ref1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969316"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2015.7419012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12218"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10436"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1613\/jair.460"},{"key":"ref7","article-title":"Bidirectional fast marching trees: An optimal sampling-based algorithm for bidirectional motion planning","author":"starek","year":"2014","journal-title":"Workshop on Algorithmic Foundations of Robotics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2022.3150748"}],"event":{"name":"2023 IEEE International Conference on Real-time Computing and Robotics (RCAR)","start":{"date-parts":[[2023,7,17]]},"location":"Datong, China","end":{"date-parts":[[2023,7,20]]}},"container-title":["2023 IEEE International Conference on Real-time Computing and Robotics (RCAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10249208\/10249018\/10249227.pdf?arnumber=10249227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T18:07:04Z","timestamp":1696874824000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10249227\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,17]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/rcar58764.2023.10249227","relation":{},"subject":[],"published":{"date-parts":[[2023,7,17]]}}}