{"id":"https://openalex.org/W3003423312","doi":"https://doi.org/10.1109/iros40897.2019.8968090","title":"Multilevel Incremental Roadmap Spanners for Reactive Motion Planning","display_name":"Multilevel Incremental Roadmap Spanners for Reactive Motion Planning","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3003423312","doi":"https://doi.org/10.1109/iros40897.2019.8968090","mag":"3003423312"},"language":"en","primary_location":{"id":"doi:10.1109/iros40897.2019.8968090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5005587345","display_name":"Jeffrey Ichnowski","orcid":"https://orcid.org/0000-0003-4874-9478"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Ichnowski","raw_affiliation_strings":["University of North Carolina,Department of Computer Science,Chapel Hill,NC,USA,27599","Department of Computer Science, University of North Carolina, Chapel Hill, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina,Department of Computer Science,Chapel Hill,NC,USA,27599","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Chapel Hill, NC, USA","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054402635","display_name":"Ron Alterovitz","orcid":"https://orcid.org/0000-0002-4492-1384"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ron Alterovitz","raw_affiliation_strings":["University of North Carolina,Department of Computer Science,Chapel Hill,NC,USA,27599","Department of Computer Science, University of North Carolina, Chapel Hill, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina,Department of Computer Science,Chapel Hill,NC,USA,27599","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Chapel Hill, NC, USA","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1504","last_page":"1509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9753999710083008,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9703999757766724,"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.7905064821243286},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7842428684234619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6130191683769226},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.545706570148468},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5275149941444397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49155768752098083},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4604279696941376},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4573987126350403},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41647839546203613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4164380729198456},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3753609359264374},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.35757434368133545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32828837633132935},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26396870613098145}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7905064821243286},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7842428684234619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6130191683769226},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.545706570148468},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5275149941444397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49155768752098083},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4604279696941376},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4573987126350403},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41647839546203613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4164380729198456},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3753609359264374},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.35757434368133545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32828837633132935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26396870613098145},{"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/iros40897.2019.8968090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W198732646","https://openalex.org/W1968624982","https://openalex.org/W1971086298","https://openalex.org/W2004100691","https://openalex.org/W2042106485","https://openalex.org/W2099144379","https://openalex.org/W2105817334","https://openalex.org/W2108232656","https://openalex.org/W2128990851","https://openalex.org/W2161076907","https://openalex.org/W2167058996","https://openalex.org/W2294319407","https://openalex.org/W2962917939","https://openalex.org/W3021766130","https://openalex.org/W4234390228","https://openalex.org/W4236251699","https://openalex.org/W6608150121","https://openalex.org/W6676095351","https://openalex.org/W6683620479","https://openalex.org/W6696955428","https://openalex.org/W6745167750","https://openalex.org/W6776306536"],"related_works":["https://openalex.org/W4380590094","https://openalex.org/W2050548713","https://openalex.org/W2906946336","https://openalex.org/W2938416672","https://openalex.org/W3200041777","https://openalex.org/W2146611987","https://openalex.org/W2368795992","https://openalex.org/W4386464271","https://openalex.org/W4308080200","https://openalex.org/W3119736302"],"abstract_inverted_index":{"Generating":[0],"robot":[1,128,150],"motions":[2],"from":[3,185],"a":[4,33,64,97,163,170],"precomputed":[5],"graph":[6,40,98,172],"has":[7],"proven":[8],"to":[9,14,29,50,61,80,180],"be":[10,107],"an":[11,85,93,130,148,159],"effective":[12],"approach":[13],"solving":[15,32],"many":[16],"motion":[17,26],"planning":[18,27],"problems.":[19],"After":[20],"their":[21],"generation,":[22],"roadmaps":[23],"reduce":[24],"complex":[25],"problems":[28],"that":[30,95],"of":[31,154,165,189],"graph-based":[34],"shortest":[35,123,183],"path.":[36],"However,":[37],"generating":[38],"the":[39,52,103,111,120,127,138,145,166,178,181,186,190],"can":[41,106,134],"involve":[42],"tradeoffs,":[43],"such":[44],"as":[45,140],"how":[46],"sparse":[47,101],"or":[48,67],"dense":[49],"make":[51],"graph.":[53,191],"Sparse":[54],"graphs":[55,75],"may":[56,68,76],"not":[57],"provide":[58],"enough":[59],"options":[60],"navigate":[62],"around":[63],"new":[65],"obstacle":[66],"result":[69,83],"in":[70,84,162],"grossly":[71],"suboptimal":[72],"motions.":[73,118],"Dense":[74],"take":[77],"too":[78],"long":[79],"search":[81],"and":[82,174],"unresponsive":[86],"robot.":[87],"In":[88],"this":[89],"paper":[90],"we":[91],"present":[92],"algorithm":[94],"generates":[96],"with":[99,151],"multiple":[100],"levels-":[102],"sparsest":[104],"level":[105,113,188],"searched":[108],"quickly,":[109],"while":[110],"densest":[112,187],"allows":[114],"for":[115,169],"asymptotically":[116],"optimal":[117,182],"With":[119],"paired":[121],"multilevel":[122],"path":[124,184],"algorithm,":[125],"after":[126],"computes":[129],"initial":[131,160],"solution,":[132],"it":[133],"then":[135],"incrementally":[136,176],"refine":[137,177],"shortest-path":[139],"time":[141,167],"allows.":[142],"We":[143],"demonstrate":[144],"algorithms":[146],"on":[147],"articulated":[149],"8":[152],"degrees":[153],"freedom,":[155],"having":[156],"them":[157],"compute":[158],"solution":[161,179],"fraction":[164],"required":[168],"full":[171],"search,":[173],"subsequently,":[175]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}