{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T18:01:54Z","timestamp":1771264914937,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/lra.2025.3615522","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T17:55:07Z","timestamp":1759168507000},"page":"13375-13382","source":"Crossref","is-referenced-by-count":1,"title":["AORRTC: Almost-Surely Asymptotically Optimal Planning With RRT-Connect"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8229-1354","authenticated-orcid":false,"given":"Tyler S.","family":"Wilson","sequence":"first","affiliation":[{"name":"Estimation, Search, and Planning (ESP) Research Group, Queen’s University, Kingston, ON, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6200-9762","authenticated-orcid":false,"given":"Wil","family":"Thomason","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3896-5110","authenticated-orcid":false,"given":"Zachary","family":"Kingston","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1034-3889","authenticated-orcid":false,"given":"Jonathan D.","family":"Gammell","sequence":"additional","affiliation":[{"name":"Estimation, Search, and Planning (ESP) Research Group, Queen’s University, Kingston, ON, Canada"}]}],"member":"263","reference":[{"key":"ref1","first-page":"269","article-title":"A note on two problems in connexion with graphs","volume-title":"Numerische Mathematik","volume":"1","author":"Dijkstra","year":"1959"},{"issue":"2","key":"ref2","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume-title":"IEEE Trans. Syst. Sci. Cybern.","volume":"SSC-4","author":"Hart","year":"1968"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913488805"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528132"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3133603"},{"key":"ref6","article-title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners","volume-title":"Proc. Workshop Evaluating Motion Plan. Perform.","author":"Gammell","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref8","article-title":"Rapidly-exploring random trees : A new tool for path planning","volume-title":"Res. Rep.","volume":"9811","author":"LaValle","year":"1998"},{"key":"ref9","first-page":"846","article-title":"Sampling-based algorithms for optimal motion planning","volume-title":"Int. J. Robot. Res.","volume":"30","author":"Karaman","year":"2011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364907079280"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509683"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912453186"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2098622"},{"key":"ref15","first-page":"543","article-title":"Batch informed trees (BIT*): Informed asymptotically optimal anytime search","volume-title":"Int. J. Robot. Res.","volume":"39","author":"Gammell","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211069572"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2602363"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197236"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10611190"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43089-4_40"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630906"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5772\/56718"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA55743.2025.11127785"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061623-094742"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095077"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2015.7419012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907855"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.851378"},{"key":"ref31","first-page":"117","article-title":"Cooperative pathfinding","volume-title":"Proc. AAAI Conf. Artif. Intell. Interactive Digit. Entertainment","author":"Silver","year":"2021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9811814"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v35i1.36120"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282100"},{"key":"ref36","article-title":"An efficient approach to path planning using balanced bidirectional rrt search","author":"Kuffner","year":"2005"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/11215960\/11184129.pdf?arnumber=11184129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T19:02:07Z","timestamp":1764010927000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11184129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":36,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3615522","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}