{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:34:53Z","timestamp":1779384893580,"version":"3.53.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/tro.2012.2234312","type":"journal-article","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T19:09:18Z","timestamp":1357931358000},"page":"432-444","source":"Crossref","is-referenced-by-count":80,"title":["Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners"],"prefix":"10.1109","volume":"29","author":[{"given":"James D.","family":"Marble","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas E.","family":"Bekris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"ref33","first-page":"208","author":"keil","year":"1988","journal-title":"Proc 1st Scandinav Workshop Algorithm Theor"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20130"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_22"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794271898"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261295"},{"key":"ref34","year":"0"},{"key":"ref10","year":"0"},{"key":"ref40","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041613"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref13","first-page":"446","article-title":"Using cycles in probabilistic roadmap graphs","volume":"1","author":"nieuwenhuisen","year":"2004","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.847599"},{"key":"ref15","first-page":"531","article-title":"Creating small graphs for solving motion planning problems","author":"geraerts","year":"2005","journal-title":"Proc IEEE Int Conf Meth Models Autom Robot"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641883"},{"key":"ref17","first-page":"2424","article-title":"Extracting optimal paths from roadmaps for motion planning","volume":"2","author":"kim","year":"2003","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282009"},{"key":"ref19","year":"0"},{"key":"ref28","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1163\/156855300741960"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095070"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1999.813013"},{"key":"ref6","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676196"},{"key":"ref5","first-page":"403","article-title":"A single-query, bi-directional probabilistic roadmap planner with lazy collision checking","author":"sanchez","year":"2001","journal-title":"Proc Int Symp Robot Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908097213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2007.06.002"},{"key":"ref2","first-page":"155","article-title":"OBPRM: An obstacle-based PRM for 3D workspaces","author":"amato","year":"1998","journal-title":"Proc Workshop Algorithm Found Robot"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2098622"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556421"},{"key":"ref22","year":"0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref42","year":"0"},{"key":"ref24","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225296"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282100"},{"key":"ref26","year":"0"},{"key":"ref43","year":"0"},{"key":"ref25","year":"0"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8860\/6491466\/06410045.pdf?arnumber=6410045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:09Z","timestamp":1642005489000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6410045\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tro.2012.2234312","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}