{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:00:08Z","timestamp":1725912008239},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684734"},{"type":"electronic","value":"9783319684741"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_15","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T15:15:48Z","timestamp":1506525348000},"page":"220-233","source":"Crossref","is-referenced-by-count":0,"title":["Self-indexed Motion Planning"],"prefix":"10.1007","author":[{"given":"Angello","family":"Hoyos","sequence":"first","affiliation":[]},{"given":"Ubaldo","family":"Ruiz","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Tellez","sequence":"additional","affiliation":[]},{"given":"Edgar","family":"Chavez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"JC Latombe","year":"1991","unstructured":"Latombe, J.C.: Robot Motion Planning. Academic Publishers, Boston (1991)"},{"key":"15_CR2","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Boston (2005)"},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"issue":"4","key":"15_CR4","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robot. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot."},{"issue":"5","key":"15_CR5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"SM LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378\u2013400 (2001)","journal-title":"Int. J. Robot. Res."},{"issue":"7","key":"15_CR6","doi-asserted-by":"crossref","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":"15_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Springer, Heidelberg (2008)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Chavez","year":"2001","unstructured":"Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32153-5_10","volume-title":"Similarity Search and Applications","author":"Y Malkov","year":"2012","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 132\u2013147. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32153-5_10"},{"issue":"2014","key":"15_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45(2014), 61\u201368 (2014). Elsevier","journal-title":"Inf. Syst."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Dobson, A., Moustakides, G.V., Bekris, K.E.: Geometric probability results for bounding path quality in sampling-based roadmaps after finite computation. In: International Conference on Robotics and Automation, pp. 4180\u20134186 (2015)","DOI":"10.1109\/ICRA.2015.7139775"},{"key":"15_CR12","unstructured":"Janson, L., Ichter, B., Pavone, M., Planning, Deterministic Sampling-Based Motion : Optimality, Complexity, and Performance. CoRR abs\/1505.00023 (2015)"},{"key":"15_CR13","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM-SIAM Symposium Discrete Algorithms (1993)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Yershova, A., LaValle, S.M.: Deterministic sampling methods for spheres and SO(3). In: IEEE International Conference on Robotics and Automation, pp. 3974\u20133980 (2004)","DOI":"10.1109\/ROBOT.2004.1308891"},{"key":"15_CR15","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-16595-0_12","volume-title":"Algorithmic Foundations of Robotics XI","author":"J Ichnowski","year":"2015","unstructured":"Ichnowski, J., Alterovitz, R.: Fast nearest neighbor search in SE(3) for sampling-based motion planning. In: Akin, H.L., Amato, N.M., Isler, V., van der Stappen, A.F. (eds.) Algorithmic Foundations of Robotics XI. STAR, vol. 107, pp. 197\u2013214. Springer, Cham (2015). doi: 10.1007\/978-3-319-16595-0_12"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Svenstrup, M., Bak, T., Andersen, H.J.: Minimising computational complexity of the RRT algorithm a practical approach. In: International Conference on Robotics and Automation, pp. 5602\u20135607 (2011)","DOI":"10.1109\/ICRA.2011.5979540"},{"key":"15_CR17","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: International Conference on Very Large Databases (VLDB), pp. 574\u2013584 (1995)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: International Conference on Machine Learning, pp. 97\u2013104 (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"15_CR19","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: International Conference on Very Large Databases, pp. 426\u2013435 (1997)"},{"issue":"1","key":"15_CR20","doi-asserted-by":"crossref","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."},{"key":"15_CR21","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-68405-3_1","volume-title":"Algorithmic Foundation of Robotics VII","author":"E Plaku","year":"2008","unstructured":"Plaku, E., Kavraki, L.E.: Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds.) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol. 47, pp. 3\u201318. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68405-3_1"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Kleinbort, M., Salzman, O., Halperin, D.: Efficient high-quality motion planning by fast all-pair $$r$$ -nearest-neighbors. In: International Conference on Robotics and Automation, pp. 2985\u20132990 (2015)","DOI":"10.1109\/ICRA.2015.7139608"},{"issue":"4","key":"15_CR23","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1137\/12089867X","volume":"43","author":"D Aiger","year":"2014","unstructured":"Aiger, D., Kaplan, H., Sharir, M.: Reporting neighbors in high-dimensional Euclidean space. SIAM J. Comput. 43(4), 1363\u20131395 (2014)","journal-title":"SIAM J. Comput."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Bohlin,R., Kavraki, L.: Path planning using lazy PRM. In: IEEE Conference on Robotics and Automation, pp. 521\u2013528 (2000)","DOI":"10.1109\/ROBOT.2000.844107"},{"issue":"1","key":"15_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/027836402320556458","volume":"21","author":"G Sanchez","year":"2002","unstructured":"Sanchez, G., Latombe, J.C.: On delaying collision checking in PRM planning: application to multi-robot coordination. Int. J. Robot. Res. 21(1), 5\u201326 (2002)","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"15_CR26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. (CSUR) 23(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"15_CR27","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"15_CR28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/335305.335325","volume":"32","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Ann. ACM Symp. Theory Comput. 32, 163\u2013170 (2000)","journal-title":"Ann. ACM Symp. Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T12:33:38Z","timestamp":1693053218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}