{"id":"https://openalex.org/W2163788280","doi":"https://doi.org/10.1109/iros.2011.6095070","title":"Computing spanners of asymptotically optimal probabilistic roadmaps","display_name":"Computing spanners of asymptotically optimal probabilistic roadmaps","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2163788280","doi":"https://doi.org/10.1109/iros.2011.6095070","mag":"2163788280"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2011.6095070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6095070","pdf_url":null,"source":{"id":"https://openalex.org/S4363608614","display_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5084488493","display_name":"James D. Marble","orcid":"https://orcid.org/0009-0006-3870-2771"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James D. Marble","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010667333","display_name":"Kostas E. Bekris","orcid":"https://orcid.org/0000-0002-0675-3324"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"4292","last_page":"4298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.9474413394927979},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.7930855751037598},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6803022623062134},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6245719790458679},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6209271550178528},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.598590612411499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5919531583786011},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5396727323532104},{"id":"https://openalex.org/keywords/stability-theory","display_name":"Stability theory","score":0.5044354200363159},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4487352967262268},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.44100499153137207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37087157368659973},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28658008575439453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27183103561401367},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16107290983200073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0894518494606018}],"concepts":[{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.9474413394927979},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.7930855751037598},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6803022623062134},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6245719790458679},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6209271550178528},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.598590612411499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5919531583786011},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5396727323532104},{"id":"https://openalex.org/C41949839","wikidata":"https://www.wikidata.org/wiki/Q1756677","display_name":"Stability theory","level":3,"score":0.5044354200363159},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4487352967262268},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.44100499153137207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37087157368659973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28658008575439453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27183103561401367},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16107290983200073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0894518494606018},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2011.6095070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6095070","pdf_url":null,"source":{"id":"https://openalex.org/S4363608614","display_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W157296195","https://openalex.org/W1495392417","https://openalex.org/W1510265196","https://openalex.org/W1515762908","https://openalex.org/W1536373029","https://openalex.org/W1562956125","https://openalex.org/W1564010364","https://openalex.org/W1585638810","https://openalex.org/W1597188505","https://openalex.org/W1670942551","https://openalex.org/W1937845308","https://openalex.org/W1969080501","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2002041206","https://openalex.org/W2036016432","https://openalex.org/W2045446569","https://openalex.org/W2075459377","https://openalex.org/W2085512211","https://openalex.org/W2096158814","https://openalex.org/W2097299275","https://openalex.org/W2097737334","https://openalex.org/W2097747425","https://openalex.org/W2101033030","https://openalex.org/W2105248582","https://openalex.org/W2110762409","https://openalex.org/W2111112078","https://openalex.org/W2112271657","https://openalex.org/W2112388515","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2142963440","https://openalex.org/W2144481803","https://openalex.org/W2161473822","https://openalex.org/W2165307897","https://openalex.org/W2167366051","https://openalex.org/W2294643298","https://openalex.org/W2296385533","https://openalex.org/W2516555774","https://openalex.org/W3006111093","https://openalex.org/W3115270213","https://openalex.org/W4231761369","https://openalex.org/W4245082111","https://openalex.org/W6629573421","https://openalex.org/W6630396903","https://openalex.org/W6631073399","https://openalex.org/W6632103127","https://openalex.org/W6633871188","https://openalex.org/W6635682950","https://openalex.org/W6637067985","https://openalex.org/W6681441980","https://openalex.org/W6726385526","https://openalex.org/W6773736804"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W4308217561","https://openalex.org/W2134348961","https://openalex.org/W2163788280","https://openalex.org/W2115192598","https://openalex.org/W4211055164"],"abstract_inverted_index":{"Asymptotically":[0],"optimal":[1,9,58,65],"motion":[2],"planning":[3],"algorithms":[4,37],"guarantee":[5],"solutions":[6],"that":[7,38,76,113,120],"approach":[8],"as":[10,42],"more":[11,98],"iterations":[12],"are":[13,35,95],"performed.":[14],"Nevertheless,":[15],"roadmaps":[16],"with":[17,86,100],"this":[18],"property":[19],"can":[20,83],"grow":[21],"too":[22],"large":[23,78],"and":[24,132],"unwieldy":[25],"for":[26,136],"fast":[27],"online":[28],"query":[29],"resolution.":[30],"In":[31],"graph":[32],"theory":[33],"there":[34],"many":[36],"produce":[39],"subgraphs,":[40],"known":[41],"spanners,":[43],"which":[44],"have":[45],"guarantees":[46],"about":[47],"path":[48,91,106,123],"quality.":[49,107],"Applying":[50],"such":[51],"an":[52],"algorithm":[53],"to":[54,129],"a":[55,61,77,87],"dense,":[56],"asymptotically":[57,63],"roadmap":[59,81,131],"produces":[60],"sparse,":[62],"near":[64],"roadmap.":[66],"Experiments":[67],"performed":[68],"on":[69],"typical,":[70],"geometric":[71],"problems":[72],"in":[73,80,90,103],"SE(3)":[74],"show":[75],"reduction":[79],"edges":[82,119],"be":[84,127,134],"achieved":[85],"small":[88],"increase":[89,122],"length.":[92],"Online":[93],"queries":[94],"answered":[96],"much":[97],"quickly":[99],"similar":[101],"results":[102],"terms":[104],"of":[105],"This":[108],"also":[109],"motivates":[110],"future":[111],"work":[112],"applies":[114],"the":[115,130],"technique":[116],"incrementally":[117],"so":[118],"won't":[121,133],"quality":[124],"will":[125],"never":[126],"added":[128],"checked":[135],"collisions.":[137]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}