{"id":"https://openalex.org/W2052405405","doi":"https://doi.org/10.1109/cdc.2013.6760303","title":"Shortest path set induced vertex ordering and its application to distributed distance optimal formation path planning and control on graphs","display_name":"Shortest path set induced vertex ordering and its application to distributed distance optimal formation path planning and control on graphs","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2052405405","doi":"https://doi.org/10.1109/cdc.2013.6760303","mag":"2052405405"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2013.6760303","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1265838","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076210154","display_name":"Jingjin Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I1343180700","https://openalex.org/I63966007"]}]},{"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"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. LaValle","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","[Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"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":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2775","last_page":"2780"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9939000010490417,"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/computer-science","display_name":"Computer science","score":0.5659112334251404},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5606043338775635},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5408539772033691},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46821215748786926},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4163810610771179},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.367808997631073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34642016887664795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34449172019958496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32890784740448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32273900508880615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2916751503944397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5659112334251404},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5606043338775635},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5408539772033691},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46821215748786926},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4163810610771179},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.367808997631073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34642016887664795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34449172019958496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32890784740448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32273900508880615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2916751503944397}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2013.6760303","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.474.1809","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.1809","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/~lavalle/papers/YuLav13d.pdf","raw_type":"text"},{"id":"pmh:oai:zenodo.org:1265838","is_oa":true,"landing_page_url":"https://zenodo.org/record/1265838","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1265838","is_oa":true,"landing_page_url":"https://zenodo.org/record/1265838","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6899999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W1964918537","https://openalex.org/W1991482882","https://openalex.org/W1994237189","https://openalex.org/W2004815408","https://openalex.org/W2038625296","https://openalex.org/W2045403423","https://openalex.org/W2060932505","https://openalex.org/W2063801303","https://openalex.org/W2097569568","https://openalex.org/W2099175737","https://openalex.org/W2105932936","https://openalex.org/W2114871659","https://openalex.org/W2117701425","https://openalex.org/W2119120935","https://openalex.org/W2120633474","https://openalex.org/W2121275187","https://openalex.org/W2125668987","https://openalex.org/W2137642864","https://openalex.org/W2139369541","https://openalex.org/W2146890818","https://openalex.org/W2147076495","https://openalex.org/W2148587452","https://openalex.org/W2152358681","https://openalex.org/W2153159477","https://openalex.org/W2155929731","https://openalex.org/W2165744313","https://openalex.org/W2166462345","https://openalex.org/W2177443133","https://openalex.org/W2222512263","https://openalex.org/W2962769831","https://openalex.org/W4241000863","https://openalex.org/W4243386470","https://openalex.org/W4300449797","https://openalex.org/W6661631360","https://openalex.org/W6678131887","https://openalex.org/W6684062045"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217","https://openalex.org/W2799386402","https://openalex.org/W2388410942"],"abstract_inverted_index":{"For":[0],"the":[1,52,60,63,84,115,119],"task":[2],"of":[3,7,54,59],"moving":[4],"a":[5,11,36,43,55,69,77,127],"group":[6],"indistinguishable":[8],"agents":[9],"on":[10,62,114],"connected":[12],"graph":[13,65],"with":[14,35,100],"unit":[15],"edge":[16,105],"lengths":[17,106],"into":[18],"an":[19],"arbitrary":[20,101],"goal":[21,71],"formation,":[22],"it":[23],"was":[24],"shown":[25],"that":[26,82],"distance":[27],"optimal":[28],"paths":[29],"can":[30],"be":[31],"computed":[32],"to":[33,76,94],"complete":[34],"tight":[37],"convergence":[38,86,116],"time":[39,117],"guarantee":[40],"[30],":[41],"using":[42],"fully":[44],"centralized":[45],"algorithm.":[46],"In":[47],"this":[48],"study,":[49],"we":[50,110],"establish":[51],"existence":[53],"more":[56,95],"fundamental":[57],"ordering":[58,74,90],"vertices":[61],"underlying":[64],"network,":[66],"induced":[67],"by":[68],"fixed":[70],"formation.":[72],"The":[73,88],"leads":[75],"simple":[78],"distributed":[79],"scheduling":[80],"algorithm":[81],"assures":[83],"same":[85],"time.":[87],"vertex":[89],"also":[91],"readily":[92],"extends":[93],"general":[96],"graphs":[97],"-":[98,107],"those":[99],"integer":[102],"capacities":[103],"and":[104],"for":[108],"which":[109],"again":[111],"provide":[112],"guarantees":[113],"until":[118],"desired":[120],"formation":[121],"is":[122],"achieved.":[123],"Simulations,":[124],"accessible":[125],"via":[126],"web":[128],"browser,":[129],"confirm":[130],"our":[131],"theoretical":[132],"developments.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}