{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:57:06Z","timestamp":1771955826864,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/icra.2015.7139284","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T21:20:30Z","timestamp":1436217630000},"page":"900-905","source":"Crossref","is-referenced-by-count":50,"title":["Experience-based planning with sparse roadmap spanners"],"prefix":"10.1109","author":[{"given":"David","family":"Coleman","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Colorado, Boulder, 80309, USA"}]},{"given":"Ioan A.","family":"\u015eucan","sequence":"additional","affiliation":[{"name":"Google [x], Mountain View, CA 94043, USA"}]},{"given":"Mark","family":"Moll","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University Houston, TX 77005, USA"}]},{"given":"Kei","family":"Okada","sequence":"additional","affiliation":[{"name":"JSK Lab, Univeristy of Tokyo Bunkyo, 113-8656, Japan"}]},{"given":"Nikolaus","family":"Correll","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Colorado, Boulder, 80309, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386092"},{"key":"ref11","article-title":"Compact representations for shortest-path queries","author":"agarwal","year":"2011","journal-title":"IROS Workshop Progress & Open Problems in Motion Planning"},{"key":"ref12","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"1999","journal-title":"Robotics The Algorithmic Perspective"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631156"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref15","article-title":"Asymptotically near-optimal is good enough for motion planning","author":"marble","year":"2011","journal-title":"Int Symp Robotics Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref18","article-title":"Reducing the barrier to entry of complex robotic software: a MoveIt! case study","author":"coleman","year":"2014","journal-title":"Journal of Software Engineering for Robotics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399364"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6224742"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CINTI.2013.6705245"},{"key":"ref5","article-title":"E-graphs: Bootstrapping planning with experience graphs","author":"phillips","year":"2012","journal-title":"Robotics Science and Systems"},{"key":"ref8","article-title":"Learning humanoid reaching tasks in dynamic environments","author":"jiang","year":"2007","journal-title":"IEEEIRSJ Int Con on Intelligent Robot and System"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498292"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref1","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementations"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68405-3_32","article-title":"Using motion primitives in probabilistic samplymrefe-based planning for humanoid robots","author":"hauser","year":"2008","journal-title":"Algorithmic Foundation of Robotics VII"}],"event":{"name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","location":"Seattle, WA, USA","start":{"date-parts":[[2015,5,26]]},"end":{"date-parts":[[2015,5,30]]}},"container-title":["2015 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7128761\/7138973\/07139284.pdf?arnumber=7139284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:26:21Z","timestamp":1733955981000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7139284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icra.2015.7139284","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}