{"id":"https://openalex.org/W2052819251","doi":"https://doi.org/10.1109/icra.2013.6631083","title":"Efficient formation path planning on large graphs","display_name":"Efficient formation path planning on large graphs","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2052819251","doi":"https://doi.org/10.1109/icra.2013.6631083","mag":"2052819251"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2013.6631083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631083","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/A5086608755","display_name":"Max Katsev","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Max Katsev","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","[Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA]","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076210154","display_name":"Jingjin Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept of Electr. & Comput. Engg, Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Engg, Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104734","display_name":"Steven M. LaValle","orcid":"https://orcid.org/0000-0003-4841-2584"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. LaValle","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","[Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA]","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":null,"first_page":"3606","last_page":"3611"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9972000122070312,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/grid","display_name":"Grid","score":0.6800144910812378},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.652048647403717},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5983520746231079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5936476588249207},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5392784476280212},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5235664248466492},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.517776608467102},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4625712037086487},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4310370683670044},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.430581271648407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42116957902908325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4119845926761627},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4119083285331726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3004670739173889},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24937278032302856},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12866660952568054},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0916261374950409}],"concepts":[{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6800144910812378},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.652048647403717},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5983520746231079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5936476588249207},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5392784476280212},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5235664248466492},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.517776608467102},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4625712037086487},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4310370683670044},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.430581271648407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42116957902908325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4119845926761627},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4119083285331726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3004670739173889},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24937278032302856},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12866660952568054},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0916261374950409},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2013.6631083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631083","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:CiteSeerX.psu:10.1.1.295.3238","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.3238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/~katsev1/publications/icra13/icra13.pdf","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":45,"referenced_works":["https://openalex.org/W93645818","https://openalex.org/W101508493","https://openalex.org/W125001008","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1585800441","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1981557399","https://openalex.org/W2002792327","https://openalex.org/W2007193228","https://openalex.org/W2038625296","https://openalex.org/W2060932505","https://openalex.org/W2074575703","https://openalex.org/W2103012681","https://openalex.org/W2109835212","https://openalex.org/W2119098384","https://openalex.org/W2127470768","https://openalex.org/W2135939055","https://openalex.org/W2153159477","https://openalex.org/W2163502413","https://openalex.org/W2166462345","https://openalex.org/W2167451681","https://openalex.org/W2169742265","https://openalex.org/W2222512263","https://openalex.org/W2399153727","https://openalex.org/W2611243847","https://openalex.org/W2914296650","https://openalex.org/W2962769831","https://openalex.org/W2963309123","https://openalex.org/W3139172074","https://openalex.org/W3145128584","https://openalex.org/W4213060235","https://openalex.org/W4214629267","https://openalex.org/W4242811155","https://openalex.org/W4244044799","https://openalex.org/W4246219036","https://openalex.org/W4300449797","https://openalex.org/W6603775515","https://openalex.org/W6635615786","https://openalex.org/W6669175093","https://openalex.org/W6684062045","https://openalex.org/W6712589207","https://openalex.org/W6758754608","https://openalex.org/W6764488352"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2056737145","https://openalex.org/W4297094037","https://openalex.org/W1660309994"],"abstract_inverted_index":{"For":[0],"the":[1,49,80,92,127],"task":[2],"of":[3,7,91,126],"transferring":[4],"a":[5,15,40,61,88,108,118,131],"group":[6],"robots":[8,38,59],"from":[9],"one":[10,46,57,64],"formation":[11],"to":[12,56,104],"another":[13],"on":[14,39,60],"connected":[16],"graph":[17],"with":[18,63,77,84,107],"unit":[19],"edge":[20],"lengths,":[21],"we":[22,74],"provide":[23],"an":[24],"efficient":[25],"hierarchical":[26,98],"algorithm":[27,52,81],"that":[28,76],"can":[29,53],"complete":[30],"goal":[31],"assignment":[32],"and":[33,130],"path":[34,120],"planning":[35],"for":[36],"10,000":[37],"250,000":[41],"vertex":[42],"grid":[43,62],"in":[44,67],"under":[45],"second.":[47],"In":[48,113],"extreme,":[50],"our":[51,97,115],"handle":[54],"up":[55],"million":[58],"billion":[65],"vertices":[66],"approximately":[68],"30":[69],"minutes.":[70],"Perhaps":[71],"more":[72],"importantly,":[73],"prove":[75],"high":[78],"probability,":[79],"supplies":[82],"paths":[83,103],"total":[85,94,119],"distance":[86,121],"within":[87],"constant":[89],"multiple":[90],"optimal":[93],"distance.":[95],"Furthermore,":[96],"method":[99],"also":[100],"allows":[101],"these":[102],"be":[105],"scheduled":[106],"tight":[109],"completion":[110,134],"time":[111],"guarantee.":[112],"practice,":[114],"implementation":[116],"yields":[117],"less":[122],"than":[123],"two":[124],"times":[125],"true":[128],"optimum":[129],"much":[132],"shorter":[133],"time.":[135]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}