{"id":"https://openalex.org/W2548727208","doi":"https://doi.org/10.1109/icra.2017.7989435","title":"Densification strategies for anytime motion planning over large dense roadmaps","display_name":"Densification strategies for anytime motion planning over large dense roadmaps","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2548727208","doi":"https://doi.org/10.1109/icra.2017.7989435","mag":"2548727208"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","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/A5000095866","display_name":"Shushman Choudhury","orcid":"https://orcid.org/0000-0003-4829-8806"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shushman Choudhury","raw_affiliation_strings":["The Robotics Institute, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robotics Institute, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"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/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oren Salzman","raw_affiliation_strings":["The Robotics Institute, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robotics Institute, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057995939","display_name":"Sanjiban Choudhury","orcid":"https://orcid.org/0000-0003-2762-8888"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjiban Choudhury","raw_affiliation_strings":["The Robotics Institute, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robotics Institute, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077719529","display_name":"Siddhartha S Srinivasa","orcid":"https://orcid.org/0000-0002-5091-106X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha S. Srinivasa","raw_affiliation_strings":["The Robotics Institute, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robotics Institute, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.3184,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.65350069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3770","last_page":"3777"},"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.984499990940094,"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/T12288","display_name":"Optimization and Search Problems","score":0.9757000207901001,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/motion-planning","display_name":"Motion planning","score":0.6278707981109619},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5845977663993835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.576048731803894},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5702161192893982},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5383822321891785},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4898778796195984},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44517430663108826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4061431884765625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3898797333240509},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36093151569366455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3349018692970276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3342192769050598},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3334856331348419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3113052248954773},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3087610900402069},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08225357532501221}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6278707981109619},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5845977663993835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.576048731803894},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5702161192893982},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5383822321891785},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4898778796195984},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44517430663108826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4061431884765625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3898797333240509},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36093151569366455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3349018692970276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3342192769050598},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3334856331348419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3113052248954773},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3087610900402069},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08225357532501221},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2017.7989435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W10620669","https://openalex.org/W104748494","https://openalex.org/W1501654049","https://openalex.org/W1578640434","https://openalex.org/W1712772804","https://openalex.org/W1763528081","https://openalex.org/W1814533834","https://openalex.org/W1864112212","https://openalex.org/W1963969090","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1982809790","https://openalex.org/W2017001763","https://openalex.org/W2104171123","https://openalex.org/W2110762409","https://openalex.org/W2128990851","https://openalex.org/W2136323427","https://openalex.org/W2136354320","https://openalex.org/W2159722616","https://openalex.org/W2161076907","https://openalex.org/W2293499200","https://openalex.org/W2404262858","https://openalex.org/W2416313483","https://openalex.org/W2900376083","https://openalex.org/W2963128534","https://openalex.org/W3021132920","https://openalex.org/W3102121895","https://openalex.org/W3103346840","https://openalex.org/W4236470048","https://openalex.org/W4299914077","https://openalex.org/W4300580367","https://openalex.org/W6600427653","https://openalex.org/W6637540238","https://openalex.org/W6683620479","https://openalex.org/W6696633844","https://openalex.org/W6713733073"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2143850401","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W4243663106","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"We":[0,14,47,86,96],"consider":[1],"the":[2,18,63,88,140,152,161],"problem":[3,115,129],"of":[4,20,22,80,84,90,94,128,163],"computing":[5],"shortest":[6,64],"paths":[7,59],"in":[8,37,51,66,169],"a":[9,78,119,144,177],"dense":[10,82],"motion-planning":[11],"roadmap":[12],"G.":[13,67,85,95,156],"assume":[15],"that":[16,32],"n,":[17],"number":[19],"vertices":[21],"G,":[23,35],"is":[24,71,134,148],"very":[25],"large.":[26],"Thus,":[27],"using":[28,139],"any":[29],"path-planning":[30,75],"algorithm":[31],"directly":[33],"searches":[34],"running":[36],"O(VlogV":[38],"+":[39],"E)":[40],"\u2248":[41],"O(n2)":[42],"time,":[43],"becomes":[44],"unacceptably":[45],"expensive.":[46],"are":[48],"therefore":[49],"interested":[50],"anytime":[52],"search":[53],"to":[54,62,72,114,150],"obtain":[55],"successively":[56],"shorter":[57],"feasible":[58],"and":[60,99,137,182],"converge":[61],"path":[65],"Our":[68],"key":[69],"insight":[70],"provide":[73],"existing":[74],"algorithms":[76],"with":[77,112],"sequence":[79,147],"increasingly":[81],"subgraphs":[83,93],"study":[87],"space":[89,107],"all":[91],"(r-disk)":[92],"then":[97,135],"formulate":[98],"present":[100],"two":[101],"densification":[102],"strategies":[103,165],"for":[104,155,166,176],"traversing":[105],"this":[106],"which":[108,123],"exhibit":[109],"complementary":[110],"properties":[111,126],"respect":[113],"difficulty.":[116,130],"This":[117,131],"inspires":[118],"third,":[120],"hybrid":[121],"strategy":[122],"has":[124],"favourable":[125],"regardless":[127],"general":[132],"approach":[133],"demonstrated":[136],"analyzed":[138],"specific":[141],"case":[142],"where":[143],"low-dispersion":[145],"deterministic":[146],"used":[149,154],"generate":[151],"samples":[153],"Finally":[157],"we":[158],"empirically":[159],"evaluate":[160],"performance":[162],"our":[164,184],"random":[167],"scenarios":[168],"\u211d2and":[170],"\u211d4and":[171],"on":[172],"manipulation":[173],"planning":[174],"problems":[175],"7":[178],"DOF":[179],"robot":[180],"arm,":[181],"validate":[183],"analysis.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}