{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:57Z","timestamp":1773481857629,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030440503","type":"print"},{"value":"9783030440510","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44051-0_5","type":"book-chapter","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T20:02:40Z","timestamp":1588881760000},"page":"69-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Concurrent Nearest-Neighbor Searching for Parallel Sampling-Based Motion Planning in SO(3), SE(3), and Euclidean Spaces"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Ichnowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Alterovitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"5_CR1","unstructured":"Amato, N.M., Dale, L.K.: Probabilistic roadmap methods are embarrassingly parallel. In: Proceedings of IEEE International Conference Robotics and Automation, pp. 688\u2013694 (1999)"},{"key":"5_CR2","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual IEEE Symposium on Foundations of Computer Science, 2006. FOCS 2006, pp. 459\u2013468. IEEE (2006)"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"5_CR4","unstructured":"Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: 1997 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1997. Proceedings, pp. 1000\u20131006. IEEE (1997)"},{"issue":"9","key":"5_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"5_CR6","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of 21st Conference on Very Large Databases (VLDB), Zurich, Switzerland, pp. 574\u2013584 (1995)"},{"key":"5_CR7","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","volume":"19","author":"IA \u015eucan","year":"2012","unstructured":"\u015eucan, I.A., Moll, M., Kavraki, L.E.: The open motion planning library. IEEE Robot. Autom. Mag. 19(4), 72\u201382 (2012). ompl.kavrakilab.org","journal-title":"IEEE Robot. Autom. Mag."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. (TOMS) 3(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/TRO.2014.2331091","volume":"30","author":"J Ichnowski","year":"2014","unstructured":"Ichnowski, J., Alterovitz, R.: Scalable multicore motion planning using lock-free concurrency. IEEE Trans. Robot. 30(5), 1123\u20131136 (2014)","journal-title":"IEEE Trans. Robot."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ichnowski, J., Alterovitz, R.: Fast nearest neighbor search in SE(3) for sampling-based motion planning. In: Algorithmic Foundations of Robotics XI, pp. 197\u2013214. Springer (2015)","DOI":"10.1007\/978-3-319-16595-0_12"},{"key":"5_CR12","unstructured":"ISO\/IEC: ISO international standard ISO\/IEC 14882:2017(E)\u2014programming languages\u2014C++. Standard, International Organization for Standards (ISO), Geneva, Switzerland, December 2017"},{"issue":"7","key":"5_CR13","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"key":"5_CR14","doi-asserted-by":"crossref","DOI":"10.1515\/9780691211701","volume-title":"Quaternions and rotation sequences","author":"JB Kuipers","year":"1999","unstructured":"Kuipers, J.B., et al.: Quaternions and rotation sequences, vol. 66. Princeton University Press, Princeton (1999)"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1145\/320613.320619","volume":"5","author":"H Kung","year":"1980","unstructured":"Kung, H., Lehman, P.L.: Concurrent manipulation of binary search trees. ACM Trans. Database Syst. (TODS) 5(3), 354\u2013382 (1980)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"5_CR16","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald, B.R., et al. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 293\u2013308. AK Peters, Natick (2001)"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1080\/10618600.2016.1231064","volume":"26","author":"C Sherlock","year":"2017","unstructured":"Sherlock, C., Golightly, A., Henderson, D.A.: Adaptive, delayed-acceptance MCMC for targets with expensive likelihoods. J. Comput. Graph. Stat. 26(2), 434\u2013444 (2017)","journal-title":"J. Comput. Graph. Stat."},{"key":"5_CR18","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition, 2008. CVPR 2008, pp. 1\u20138. IEEE (2008)"},{"issue":"1\u20136","key":"5_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull, R.F.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(1\u20136), 579\u2013589 (1991)","journal-title":"Algorithmica"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TRO.2006.886840","volume":"23","author":"A Yershova","year":"2007","unstructured":"Yershova, A., LaValle, S.M.: Improving motion planning algorithms by efficient nearest-neighbor searching. IEEE Trans. Robot. 23(1), 151\u2013157 (2007)","journal-title":"IEEE Trans. Robot."}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44051-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T08:33:57Z","timestamp":1615624437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44051-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030440503","9783030440510"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44051-0_5","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"value":"2511-1256","type":"print"},{"value":"2511-1264","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAFR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Algorithmic Foundations of Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Merida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parasol.tamu.edu\/wafr\/wafr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}