{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:10:50Z","timestamp":1729617050772,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/icra.2015.7139608","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T17:20:30Z","timestamp":1436203230000},"page":"2985-2990","source":"Crossref","is-referenced-by-count":12,"title":["Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors"],"prefix":"10.1109","author":[{"given":"Michal","family":"Kleinbort","sequence":"first","affiliation":[]},{"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref11","first-page":"1257","article-title":"A fast streaming spanner algorithm for incrementally constructing sparse roadmaps","author":"wang","year":"2013","journal-title":"IROS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907543"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref15","article-title":"Effiecient high-quality motion planning by fast all-pairs r-nearest-neighbors","volume":"abs 1409 8112","author":"kleinbort","year":"2014","journal-title":"CoRR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref18","first-page":"574","article-title":"Near neighbor search in large metric spaces","author":"brin","year":"1995","journal-title":"VLDB"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139773"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.431"},{"key":"ref3","first-page":"365","article-title":"Efficient collision checking in sampling-based motion planning","author":"bialkowski","year":"2012","journal-title":"WAFR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942793"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref7","article-title":"Fast marching trees: a fast marching sampling-based method for optimal motion planning in many dimensions - extended version","volume":"abs 1306 3532","author":"janson","year":"2013","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref9","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"2009","journal-title":"VISSAPP INSTICC Press"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/12089867X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.886840"},{"key":"ref21","first-page":"3","article-title":"Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning","author":"plaku","year":"2006","journal-title":"WAFR"},{"journal-title":"The Boost C++ libraries","year":"2011","author":"schling","key":"ref24"},{"key":"ref23","article-title":"Fast nearest neighbor search in SE(3) for sampling-based motion planning","author":"ichnowski","year":"2014","journal-title":"WAFR"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The Open Motion Planning Library","volume":"19","author":"\u00e5\u017eucan","year":"2012","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"ref25","first-page":"37","article-title":"Accelerating kd-tree searches for all k-nearest neighbours","author":"merry","year":"2013","journal-title":"EUROGRAPHICS"}],"event":{"name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2015,5,26]]},"location":"Seattle, WA, USA","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\/07139608.pdf?arnumber=7139608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T11:12:14Z","timestamp":1498216334000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7139608\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icra.2015.7139608","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}