{"id":"https://openalex.org/W1509388613","doi":"https://doi.org/10.1109/icra.2015.7139608","title":"Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors","display_name":"Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1509388613","doi":"https://doi.org/10.1109/icra.2015.7139608","mag":"1509388613"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2015.7139608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054011089","display_name":"Michal Kleinbort","orcid":"https://orcid.org/0000-0002-7019-0095"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michal Kleinbort","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel-Aviv University, Israel","Blavatnik School, Of Computer Science, Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Blavatnik School, Of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078885681","display_name":"Oren Salzman","orcid":"https://orcid.org/0000-0003-4541-8219"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oren Salzman","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel-Aviv University, Israel","Blavatnik School, Of Computer Science, Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Blavatnik School, Of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038503253","display_name":"Dan Halperin","orcid":"https://orcid.org/0000-0002-3345-3765"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dan Halperin","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel-Aviv University, Israel","Blavatnik School, Of Computer Science, Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Blavatnik School, Of Computer Science, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054011089"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":2.2091,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91566447,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"abs 1409 8112","issue":null,"first_page":"2985","last_page":"2990"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.785499095916748},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7343958616256714},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7000672221183777},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.632316529750824},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5637896060943604},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5348258018493652},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5315648913383484},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5302383899688721},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5277731418609619},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5024774074554443},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4132831394672394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3939882814884186},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34683161973953247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25624048709869385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1633813977241516},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11048248410224915},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.08838778734207153}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.785499095916748},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7343958616256714},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7000672221183777},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.632316529750824},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5637896060943604},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5348258018493652},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5315648913383484},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5302383899688721},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5277731418609619},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5024774074554443},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4132831394672394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3939882814884186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34683161973953247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25624048709869385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1633813977241516},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11048248410224915},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.08838778734207153},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2015.7139608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W121974122","https://openalex.org/W954728917","https://openalex.org/W1424654272","https://openalex.org/W1554174647","https://openalex.org/W1578640434","https://openalex.org/W1605600765","https://openalex.org/W1627400044","https://openalex.org/W1866797514","https://openalex.org/W1971086298","https://openalex.org/W1971129009","https://openalex.org/W1976930960","https://openalex.org/W2012233224","https://openalex.org/W2024668293","https://openalex.org/W2027693953","https://openalex.org/W2035353512","https://openalex.org/W2062550101","https://openalex.org/W2106642566","https://openalex.org/W2110762409","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2156711662","https://openalex.org/W2159722616","https://openalex.org/W2165558283","https://openalex.org/W2290761674","https://openalex.org/W2427881153","https://openalex.org/W2570852788","https://openalex.org/W2611243847","https://openalex.org/W3102121895","https://openalex.org/W6605001227","https://openalex.org/W6624930861","https://openalex.org/W6632963374","https://openalex.org/W6636311209","https://openalex.org/W6636759986","https://openalex.org/W6639182671","https://openalex.org/W6665953554","https://openalex.org/W6683229267"],"related_works":["https://openalex.org/W2891987081","https://openalex.org/W2990663423","https://openalex.org/W2090152127","https://openalex.org/W3171568022","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W2033213447","https://openalex.org/W14679004","https://openalex.org/W2097149198"],"abstract_inverted_index":{"Sampling-based":[0],"motion-planning":[1,126],"algorithms":[2,34,127],"typically":[3],"rely":[4],"on":[5],"nearest-neighbor":[6],"(NN)":[7],"queries":[8,21,37,97],"when":[9,150],"constructing":[10],"a":[11,40,44,49,92,170,173],"roadmap.":[12],"Recent":[13],"results":[14],"suggest":[15],"that":[16,138],"in":[17,31,98],"various":[18],"settings":[19],"NN":[20,36,68,110,154],"may":[22],"be":[23],"the":[24,134],"computational":[25],"bottleneck":[26],"of":[27,39,46,55,77,109,116,133,175],"such":[28,96],"algorithms.":[29],"Moreover,":[30],"several":[32],"asymptotically-optimal":[33],"these":[35],"are":[38],"specific":[41],"form:":[42],"Given":[43],"set":[45],"points":[47,56],"and":[48,101,128],"radius":[50],"r":[51],"report":[52],"all":[53],"pairs":[54],"whose":[57],"distance":[58],"is":[59],"at":[60],"most":[61],"r.":[62],"This":[63],"calls":[64],"for":[65,113,124,139,144,164,179],"an":[66,130],"application-specific":[67],"data":[69,111,155],"structure":[70],"tailored":[71],"to":[72,94,105,147,152,177],"efficiently":[73],"answering":[74],"this":[75,114,119],"type":[76,115],"queries.":[78,117],"Randomly":[79],"transformed":[80],"grids":[81],"(RTG)":[82],"were":[83],"recently":[84],"proposed":[85],"by":[86,172],"Aiger":[87],"et":[88],"al.":[89],"[1]":[90],"as":[91],"tool":[93],"answer":[95],"Euclidean":[99],"spaces":[100],"have":[102],"been":[103],"shown":[104],"outperform":[106],"common":[107],"implementations":[108],"structures":[112],"In":[118],"work":[120],"we":[121,168],"employ":[122],"RTG":[123,142,158],"sampling-based":[125],"describe":[129],"efficient":[131],"implementation":[132],"approach.":[135],"We":[136],"show":[137],"motion":[140],"planning,":[141],"allow":[143],"faster":[145],"convergence":[146],"high-quality":[148],"solutions":[149],"compared":[151],"existing":[153],"structures.":[156],"Additionally,":[157],"enable":[159],"significantly":[160],"shorter":[161],"construction":[162],"times":[163],"batched-PRM":[165],"variants;":[166],"specifically,":[167],"demonstrate":[169],"speedup":[171],"factor":[174],"two":[176],"three":[178],"some":[180],"scenarios.":[181]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}