{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:30:07Z","timestamp":1766068207709,"version":"3.44.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2024-06637"],"award-info":[{"award-number":["RGPIN-2024-06637"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2336612"],"award-info":[{"award-number":["2336612"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icra55743.2025.11127785","type":"proceedings-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T17:28:56Z","timestamp":1756834136000},"page":"14140-14146","source":"Crossref","is-referenced-by-count":2,"title":["Nearest-Neighbourless Asymptotically Optimal Motion Planning with Fully Connected Informed Trees (FCIT*)"],"prefix":"10.1109","author":[{"given":"Tyler S.","family":"Wilson","sequence":"first","affiliation":[{"name":"Queen's University,Estimation, Search, and Planning (ESP) Research Group,Kingston,ON,Canada"}]},{"given":"Wil","family":"Thomason","sequence":"additional","affiliation":[{"name":"Rice University,Department of Computer Science,Houston,TX,USA"}]},{"given":"Zachary","family":"Kingston","sequence":"additional","affiliation":[{"name":"Rice University,Department of Computer Science,Houston,TX,USA"}]},{"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[{"name":"Rice University,Department of Computer Science,Houston,TX,USA"}]},{"given":"Jonathan D.","family":"Gammell","sequence":"additional","affiliation":[{"name":"Queen's University,Estimation, Search, and Planning (ESP) Research Group,Kingston,ON,Canada"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref4","article-title":"Rapidly-exploring random trees: a new tool for path planning","author":"LaValle","year":"1998","journal-title":"Research Report 9811"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"journal-title":"Motion policy networks","year":"2022","author":"Fishman","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3133603"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917714338"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/icra40945.2020.9196917"},{"key":"ref15","first-page":"624","article-title":"Collision Detection or Nearest-Neighbor Search?","volume-title":"On the Computational Bottleneck in Sampling-based Motion Planning","author":"Kleinbort","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139603"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10611190"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.36288\/roscon2013-900162"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13931"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907543"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196580"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCR49711.2021.9349403"},{"key":"ref24","article-title":"Greedy heuristics for sampling-based motion planning in high-dimensional state spaces","volume":"abs\/2405.03411","author":"Kyaw","year":"2024","journal-title":"ArXiv"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211069572"},{"key":"ref26","first-page":"923","article-title":"A* with partial expansion for large branching factor problems","author":"Yoshizumi","year":"2000","journal-title":"AAAI\/IAAI"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/70.660866"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545607"},{"key":"ref30","article-title":"An efficient approach to path planning using balanced bidirectional rrt search","volume-title":"Tech. Rep","author":"Kuffner","year":"2005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2024.xx.038"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364907079280"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509683"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912453186"}],"event":{"name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2025,5,19]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11127273\/11127223\/11127785.pdf?arnumber=11127785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T06:24:26Z","timestamp":1756880666000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11127785\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/icra55743.2025.11127785","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}