{"id":"https://openalex.org/W2004100691","doi":"https://doi.org/10.1109/tro.2012.2234312","title":"Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners","display_name":"Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners","publication_year":2013,"publication_date":"2013-01-11","ids":{"openalex":"https://openalex.org/W2004100691","doi":"https://doi.org/10.1109/tro.2012.2234312","mag":"2004100691"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2012.2234312","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2012.2234312","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","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/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"]},{"id":"https://openalex.org/I198049902","display_name":"Sierra Nevada Corporation (United States)","ror":"https://ror.org/00yt6w794","country_code":"US","type":"company","lineage":["https://openalex.org/I198049902"]}],"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","Sierra Nevada Corporation, Sparks, 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"]},{"raw_affiliation_string":"Sierra Nevada Corporation, Sparks, NV, USA","institution_ids":["https://openalex.org/I198049902"]}]},{"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"]},{"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","Department of Computer Science, Rutgers University, Piscataway, NJ, 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"]},{"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":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.9755,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.98178931,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"29","issue":"2","first_page":"432","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9775000214576721,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.7966656684875488},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5430921316146851},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5015804767608643},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4926677346229553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4859791696071625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4567684829235077},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.4200783967971802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3776280879974365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3637131154537201},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3588709831237793},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.354171484708786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3277515172958374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3088020086288452},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24503085017204285},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08157044649124146}],"concepts":[{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.7966656684875488},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5430921316146851},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5015804767608643},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4926677346229553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4859791696071625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4567684829235077},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.4200783967971802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3776280879974365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3637131154537201},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3588709831237793},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.354171484708786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3277515172958374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3088020086288452},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24503085017204285},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08157044649124146},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tro.2012.2234312","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2012.2234312","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11664882240004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Asymptotically-Near-Optimal-Planning-With-Probabilistic-Roadmap/991031665204304646","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":[{"display_name":"Sustainable cities and communities","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W326738931","https://openalex.org/W1495392417","https://openalex.org/W1510265196","https://openalex.org/W1536373029","https://openalex.org/W1564010364","https://openalex.org/W1585638810","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/W2056718993","https://openalex.org/W2075459377","https://openalex.org/W2085512211","https://openalex.org/W2096158814","https://openalex.org/W2097737334","https://openalex.org/W2097747425","https://openalex.org/W2105248582","https://openalex.org/W2110762409","https://openalex.org/W2112271657","https://openalex.org/W2112388515","https://openalex.org/W2117828438","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2142963440","https://openalex.org/W2144481803","https://openalex.org/W2150500908","https://openalex.org/W2161473822","https://openalex.org/W2163788280","https://openalex.org/W2165307897","https://openalex.org/W2165558283","https://openalex.org/W2167366051","https://openalex.org/W2294643298","https://openalex.org/W2296385533","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/W6632103127"],"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,8,103],"motion":[2,175,186],"planners":[3],"guarantee":[4,88],"that":[5,77,87,190],"solutions":[6],"approach":[7],"as":[9,84,157],"more":[10],"iterations":[11],"are":[12,75,82,148,159],"performed.":[13],"A":[14],"recently":[15],"proposed":[16],"roadmap-based":[17],"method,":[18,45,144],"i.e.,":[19],"the":[20,35,40,47,101,126,152,155],"<formula":[21,104,130],"formulatype=\"inline\"":[22,105,131],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[23,106,132],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex":[24,107],"Notation=\"TeX\">$\\hbox{\\tt":[25,108,135],"PRM}^{*}$":[26],"</tex></formula>":[27],"approach,":[28,117],"provides":[29],"this":[30,44],"desirable":[31],"property":[32],"and":[33,54,180,198],"minimizes":[34],"computational":[36],"cost":[37],"of":[38,129,154,210],"generating":[39],"roadmap.":[41],"Even":[42],"for":[43,59,67,96,162],"however,":[46],"roadmap":[48,128,156,164,196,214],"can":[49,203],"be":[50,204],"slow":[51],"to":[52,125],"construct":[53],"quickly":[55],"grows":[56],"too":[57],"large":[58,191],"storage":[60],"or":[61],"fast":[62],"online":[63,199],"query":[64,200],"resolution,":[65],"especially":[66],"relatively":[68],"high-dimensional":[69],"instances.":[70],"In":[71],"graph":[72,85,98,120],"theory,":[73],"there":[74],"algorithms":[76],"produce":[78],"sparse":[79],"subgraphs,":[80],"which":[81],"known":[83],"spanners,":[86],"near-optimal":[89,174],"paths.":[90],"This":[91],"paper":[92],"proposes":[93],"different":[94],"alternatives":[95],"interleaving":[97],"spanners":[99],"with":[100,206],"asymptotically":[102,173],"PRM}^{*}$</tex></formula>":[109,136],"algorithm.":[110],"The":[111,138,166],"first":[112],"alternative":[113],"follows":[114],"a":[115,119,163,207],"sequential":[116],"where":[118,145],"spanner":[121],"algorithm":[122],"is":[123,141,171],"applied":[124],"output":[127],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[133],"<tex":[134],".":[137],"second":[139],"one":[140],"an":[142,172],"incremental":[143],"certain":[146],"edges":[147],"not":[149,160],"considered":[150],"during":[151],"construction":[153,194],"they":[158],"necessary":[161],"spanner.":[165],"result":[167],"in":[168,193],"both":[169],"cases":[170],"planning":[176,187],"solution.":[177],"Theoretical":[178],"analysis":[179],"experiments":[181],"performed":[182],"on":[183],"typical,":[184],"geometric":[185],"instances":[188],"show":[189],"reductions":[192],"time,":[195],"density,":[197],"resolution":[201],"time":[202],"achieved":[205],"small":[208],"sacrifice":[209],"path":[211],"quality":[212],"through":[213],"spanners.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}