{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:21:52Z","timestamp":1767990112392,"version":"3.49.0"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1830242"],"award-info":[{"award-number":["1830242"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Leadership Initiative"},{"DOI":"10.13039\/100000003","name":"Boeing","doi-asserted-by":"publisher","award":["# 80NSSC19M0124"],"award-info":[{"award-number":["# 80NSSC19M0124"]}],"id":[{"id":"10.13039\/100000003","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/lra.2021.3068682","type":"journal-article","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T19:34:37Z","timestamp":1616614477000},"page":"4624-4631","source":"Crossref","is-referenced-by-count":11,"title":["Single-query Path Planning Using Sample-Efficient Probability Informed Trees"],"prefix":"10.1109","volume":"6","author":[{"given":"Daniel","family":"Rakita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bilge","family":"Mutlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gleicher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594029"},{"key":"ref15","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref18","first-page":"449","article-title":"Kinodynamic motion planning by interior-exterior cell exploration","author":"?ucan","year":"2009","journal-title":"Algorithmic Foundations of Robotics VI"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2049527"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1997.619371"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980286"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2005.I.015"},{"key":"ref2","first-page":"98","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139603"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095077"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/9399748\/9385939-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9399748\/09385939.pdf?arnumber=9385939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:01Z","timestamp":1652194441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9385939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":19,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3068682","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}