{"id":"https://openalex.org/W2108232656","doi":"https://doi.org/10.1177/0278364913498292","title":"Sparse roadmap spanners for asymptotically near-optimal motion planning","display_name":"Sparse roadmap spanners for asymptotically near-optimal motion planning","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2108232656","doi":"https://doi.org/10.1177/0278364913498292","mag":"2108232656"},"language":"en","primary_location":{"id":"doi:10.1177/0278364913498292","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913498292","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-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/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":["Computer Science Department, Rutgers University, Piscataway, NJ, USA","Computer Science Department, Rutgers University, Piscataway, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Computer Science Department, Rutgers University, Piscataway, NJ, USA#TAB#","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":["Computer Science Department, Rutgers University, Piscataway, NJ, USA","Computer Science Department, Rutgers University, Piscataway, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Computer Science Department, Rutgers University, Piscataway, NJ, USA#TAB#","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":9.9468,"has_fulltext":false,"cited_by_count":122,"citation_normalized_percentile":{"value":0.9865363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"33","issue":"1","first_page":"18","last_page":"47"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9872000217437744,"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/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.9026983380317688},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6077739000320435},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5416456460952759},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5345116853713989},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5146440267562866},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5029343962669373},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.42987316846847534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3813307285308838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3461904525756836},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.31805455684661865},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27802109718322754},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13288754224777222}],"concepts":[{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.9026983380317688},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6077739000320435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5416456460952759},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5345116853713989},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5146440267562866},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5029343962669373},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.42987316846847534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3813307285308838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3461904525756836},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.31805455684661865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27802109718322754},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13288754224777222}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/0278364913498292","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913498292","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11664874390004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Sparse-roadmap-spanners-for-asymptotically-near-optimal/991031665335304646","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":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W157296195","https://openalex.org/W211895014","https://openalex.org/W326738931","https://openalex.org/W373813039","https://openalex.org/W1424654272","https://openalex.org/W1495392417","https://openalex.org/W1515762908","https://openalex.org/W1516027685","https://openalex.org/W1521785144","https://openalex.org/W1585638810","https://openalex.org/W1670942551","https://openalex.org/W1777783943","https://openalex.org/W1937587174","https://openalex.org/W1969080501","https://openalex.org/W1969907553","https://openalex.org/W1971086298","https://openalex.org/W1978301848","https://openalex.org/W1986004895","https://openalex.org/W2000359213","https://openalex.org/W2021118704","https://openalex.org/W2056718993","https://openalex.org/W2058240764","https://openalex.org/W2072127296","https://openalex.org/W2083669917","https://openalex.org/W2090170700","https://openalex.org/W2096158814","https://openalex.org/W2096636360","https://openalex.org/W2101033030","https://openalex.org/W2103120971","https://openalex.org/W2103524001","https://openalex.org/W2104171123","https://openalex.org/W2105248582","https://openalex.org/W2105509128","https://openalex.org/W2107535513","https://openalex.org/W2109212155","https://openalex.org/W2110144538","https://openalex.org/W2110762409","https://openalex.org/W2113778071","https://openalex.org/W2115257338","https://openalex.org/W2125041002","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2129209579","https://openalex.org/W2142963440","https://openalex.org/W2144481803","https://openalex.org/W2150500908","https://openalex.org/W2152032992","https://openalex.org/W2155441094","https://openalex.org/W2159722616","https://openalex.org/W2159791647","https://openalex.org/W2161473822","https://openalex.org/W2163185513","https://openalex.org/W2165307897","https://openalex.org/W2171266831","https://openalex.org/W2171702689","https://openalex.org/W2177165743","https://openalex.org/W2516555774","https://openalex.org/W2611243847","https://openalex.org/W3149166261","https://openalex.org/W4206226097","https://openalex.org/W4231761369","https://openalex.org/W4236470048","https://openalex.org/W4242811155","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2381469031","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W2134348961","https://openalex.org/W2163788280","https://openalex.org/W3148718598","https://openalex.org/W4211055164"],"abstract_inverted_index":{"Asymptotically":[0],"optimal":[1,10,67],"planners,":[2,70],"such":[3],"as":[4,11,76,128],"PRM*,":[5],"guarantee":[6,63],"that":[7,62,97,135,163,203,215],"solutions":[8,249],"approach":[9,149],"the":[12,84,106,117,123,184,193,204,246,254,259,274,277],"number":[13],"of":[14,119,175,235,248,262,276],"iterations":[15,129],"increases.":[16],"Roadmaps":[17],"with":[18,139],"this":[19,89,91],"property,":[20],"however,":[21,71],"may":[22,145],"grow":[23],"too":[24],"large":[25],"for":[26,32,191,198,210,217],"storing":[27],"on":[28,186],"resource-constrained":[29],"robots":[30],"and":[31,68,115,158,197,227,244],"achieving":[33],"efficient":[34],"online":[35],"query":[36,231],"resolution.":[37,232],"By":[38],"relaxing":[39],"optimality,":[40],"asymptotically":[41,66],"near-optimal":[42,69],"planners":[43],"produce":[44,59],"sparser":[45],"graphs":[46,82],"by":[47],"not":[48],"including":[49],"all":[50,73],"edges.":[51],"The":[52,103,131,148,233],"idea":[53],"stems":[54],"from":[55],"graph":[56,154,168,190],"spanners,":[57],"which":[58,182,199],"sparse":[60,100,194,219],"subgraphs":[61],"near-optimality.":[64],"Existing":[65],"include":[72],"sampled":[74],"configurations":[75],"roadmap":[77,101,160,195,220],"nodes,":[78],"meaning":[79,162],"only":[80],"infinite-size":[81,167],"have":[83],"desired":[85],"properties.":[86],"To":[87],"address":[88],"limitation,":[90],"work":[92],"describes":[93],"SPARS,":[94],"an":[95,166],"algorithm":[96],"returns":[98],"a":[99,152,188,270],"spanner.":[102],"method":[104],"provides":[105],"following":[107],"properties:":[108],"(a)":[109],"probabilistic":[110],"completeness,":[111],"(b)":[112],"asymptotic":[113,140],"near-optimality":[114,141],"(c)":[116],"probability":[118],"adding":[120],"nodes":[121],"to":[122,126,156,240,281],"spanner":[124,196,279],"converges":[125],"zero":[127],"increase.":[130],"last":[132],"point":[133],"suggests":[134],"finite-size":[136],"data":[137,225],"structures":[138,226],"in":[142,229,273],"continuous":[143],"spaces":[144],"indeed":[146,222],"exist.":[147],"builds":[150],"simultaneously":[151],"dense":[153,189],"similar":[155],"PRM*":[157],"its":[159],"spanner,":[161],"upon":[164],"construction":[165],"is":[169,177,201,238,250,269],"still":[170],"needed":[171],"asymptotically.":[172],"An":[173],"extension":[174],"SPARS":[176],"also":[178],"presented,":[179],"termed":[180],"SPARS2,":[181],"removes":[183],"dependency":[185],"building":[187],"constructing":[192,218],"it":[200],"shown":[202,239],"same":[205],"desirable":[206],"properties":[207],"hold.":[208],"Simulations":[209],"rigid-body":[211],"motion":[212],"planning":[213],"show":[214],"algorithms":[216],"spanners":[221],"provide":[223],"small":[224,271],"result":[228],"faster":[230],"rate":[234],"node":[236],"addition":[237],"decrease":[241],"over":[242],"time":[243],"practically":[245],"quality":[247],"considerably":[251],"better":[252],"than":[253],"theoretical":[255],"bounds.":[256],"Upon":[257],"construction,":[258],"memory":[260],"requirements":[261],"SPARS2":[263],"are":[264],"significantly":[265],"smaller":[266],"but":[267],"there":[268],"sacrifice":[272],"size":[275],"final":[278],"relative":[280],"SPARS.":[282]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}