{"id":"https://openalex.org/W2072127296","doi":"https://doi.org/10.1109/icra.2013.6631156","title":"Improving sparse roadmap spanners","display_name":"Improving sparse roadmap spanners","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2072127296","doi":"https://doi.org/10.1109/icra.2013.6631156","mag":"2072127296"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2013.6631156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Robotics and Automation","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/A5045652940","display_name":"Andrew Dobson","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Dobson","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Piscataway, NJ, USA","Department of Computer Science Rutgers University  Piscataway NJ USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Computer Science Rutgers University  Piscataway NJ USA","institution_ids":["https://openalex.org/I102322142"]}]},{"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/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Piscataway, NJ, USA","Department of Computer Science Rutgers University  Piscataway NJ USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Computer Science Rutgers University  Piscataway NJ USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4106","last_page":"4111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.988099992275238,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9868999719619751,"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/computer-science","display_name":"Computer science","score":0.7176793813705444},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6820650100708008},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.6183789968490601},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5264747142791748},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5153836011886597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47127577662467957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4168851971626282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39385688304901123},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2368001937866211},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2118324637413025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17197251319885254}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7176793813705444},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6820650100708008},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.6183789968490601},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5264747142791748},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5153836011886597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47127577662467957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4168851971626282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39385688304901123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2368001937866211},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2118324637413025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17197251319885254},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2013.6631156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11665202320004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Improving-sparse-roadmap-spanners/991031665885804646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W326738931","https://openalex.org/W1233247130","https://openalex.org/W1515762908","https://openalex.org/W1597188505","https://openalex.org/W1670942551","https://openalex.org/W1969080501","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2058240764","https://openalex.org/W2096158814","https://openalex.org/W2096636360","https://openalex.org/W2110762409","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2142963440","https://openalex.org/W2161473822","https://openalex.org/W2163788280","https://openalex.org/W2165307897","https://openalex.org/W2516555774","https://openalex.org/W4231761369","https://openalex.org/W4236470048","https://openalex.org/W6611291617","https://openalex.org/W6627881484","https://openalex.org/W6631073399","https://openalex.org/W6635682950","https://openalex.org/W6637067985","https://openalex.org/W6681441980","https://openalex.org/W6726385526"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W2162831161","https://openalex.org/W4297623464","https://openalex.org/W2126497992","https://openalex.org/W2082551413","https://openalex.org/W3197005352","https://openalex.org/W1611446778","https://openalex.org/W1497573972","https://openalex.org/W2071659383","https://openalex.org/W1846253165"],"abstract_inverted_index":{"Roadmap":[0],"spanners":[1],"provide":[2,66],"a":[3,35,58,74,150],"way":[4],"to":[5,52,62,89,93,161,177],"acquire":[6],"sparse":[7],"data":[8],"structures":[9],"that":[10,48,83,129],"efficiently":[11],"answer":[12],"motion":[13],"planning":[14],"queries":[15],"with":[16,146],"probabilistic":[17],"completeness":[18],"and":[19,42,65,115,120],"asymptotic":[20],"near-optimality.":[21],"The":[22,105,125],"current":[23],"SPARS":[24,81,123,162],"method":[25,135,166],"provides":[26],"these":[27],"properties":[28,114],"by":[29],"building":[30],"two":[31],"graphs":[32,169],"in":[33,101,153],"parallel:":[34],"dense":[36,75],"asymptotically-optimal":[37],"roadmap":[38,91],"based":[39],"on":[40],"PRM*":[41,119],"its":[43,112],"spanner.":[44],"This":[45],"paper":[46,106],"shows":[47],"it":[49,117],"is":[50,60,82,99,149],"possible":[51],"relax":[53],"the":[54,63,71,84,90,102,108,121,130,134,154,157,164],"conditions":[55],"under":[56],"which":[57,98],"sample":[59],"added":[61],"spanner":[64,159],"guarantees,":[67],"while":[68,141],"not":[69],"requiring":[70],"use":[72],"of":[73,80,86,133,156,171],"graph.":[76],"A":[77],"key":[78],"aspect":[79],"probability":[85],"adding":[87],"nodes":[88],"goes":[92],"zero":[94],"as":[95],"iterations":[96],"increase,":[97],"maintained":[100],"proposed":[103],"extension.":[104],"describes":[107],"new":[109,165],"algorithm,":[110],"argues":[111],"theoretical":[113],"evaluates":[116],"against":[118],"original":[122],"algorithm.":[124],"experimental":[126],"results":[127],"show":[128],"memory":[131],"requirements":[132],"upon":[136],"construction":[137],"are":[138],"dramatically":[139],"reduced,":[140],"returning":[142],"competitive":[143],"quality":[144],"paths":[145],"PRM*.":[147],"There":[148],"small":[151],"sacrifice":[152],"size":[155],"final":[158],"relative":[160],"but":[163],"still":[167],"returns":[168],"orders":[170],"magnitudes":[172],"smaller":[173],"than":[174],"PRM*,":[175],"leading":[176],"very":[178],"efficient":[179],"online":[180],"query":[181],"resolution.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}