{"id":"https://openalex.org/W4415179738","doi":"https://doi.org/10.23919/ecc65951.2025.11186910","title":"On the discrepancy between the task and communication graphs in multi-agent control systems","display_name":"On the discrepancy between the task and communication graphs in multi-agent control systems","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415179738","doi":"https://doi.org/10.23919/ecc65951.2025.11186910"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11186910","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-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/A5073295176","display_name":"Maria Charitidou","orcid":"https://orcid.org/0000-0002-2356-1543"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Maria Charitidou","raw_affiliation_strings":["KTH Royal Institute of Technology,Stockholm,SE,Sweden,100-44"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Stockholm,SE,Sweden,100-44","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055348953","display_name":"Dimos V. Dimarogonas","orcid":"https://orcid.org/0000-0001-7309-8086"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Dimos V. Dimarogonas","raw_affiliation_strings":["KTH Royal Institute of Technology,Stockholm,SE,Sweden,100-44"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Stockholm,SE,Sweden,100-44","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073295176"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15908746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"167","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13062","display_name":"Cognitive Computing and Networks","score":0.6904000043869019,"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"}},"topics":[{"id":"https://openalex.org/T13062","display_name":"Cognitive Computing and Networks","score":0.6904000043869019,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6887000203132629,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.6509000062942505,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/incidence-matrix","display_name":"Incidence matrix","score":0.6116999983787537},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5370000004768372},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5049999952316284},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.439300000667572},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.439300000667572},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.43639999628067017},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4334000051021576},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.4230000078678131},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.4018000066280365}],"concepts":[{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.6116999983787537},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5370000004768372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5307000279426575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5241000056266785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5049999952316284},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4334000051021576},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.4230000078678131},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.4018000066280365},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.4016999900341034},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3833000063896179},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.3418000042438507},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.3310000002384186},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3249000012874603},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32429999113082886},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C17500928","wikidata":"https://www.wikidata.org/wiki/Q959968","display_name":"Control system","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.27630001306533813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2732999920845032},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2648000121116638}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc65951.2025.11186910","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,27],"applications":[2],"in":[3,14,75],"which":[4],"agents":[5,42],"need":[6],"to":[7,33,52],"perform":[8],"collaborative":[9],"tasks":[10,26,38],"under":[11],"limited":[12],"communication,":[13],"this":[15,109],"work":[16],"we":[17,66,93,115],"consider":[18],"the":[19,36,47,54,57,68,72,78,82,96,99,130,141,145,158],"asymptotic":[20,127],"satisfaction":[21,55,128],"of":[22,46,56,71,77,81,98,102,129,144,153,157],"relative-position":[23],"based":[24,120],"spatial":[25,37],"a":[28,44,63,112,117,133,154],"leader-follower":[29],"network.":[30],"As":[31],"opposed":[32],"existing":[34],"approaches,":[35],"may":[39],"involve":[40],"non-communicating":[41],"and/or":[43],"subset":[45],"multi-agent":[48],"team.":[49],"In":[50,85],"order":[51],"ensure":[53],"constraints":[58,131],"using":[59],"local":[60],"information,":[61],"as":[62,111],"first":[64],"contribution,":[65],"express":[67],"incidence":[69,100],"matrix":[70,80],"task":[73],"graph":[74,143,147],"terms":[76],"corresponding":[79],"communication":[83,91,119,146],"graph.":[84],"addition,":[86],"for":[87],"undirected":[88],"spanning":[89],"tree":[90],"graphs,":[92],"show":[94],"that":[95,125],"relation":[97],"matrices":[101],"these":[103],"graphs":[104],"is":[105],"unique.":[106],"Building":[107],"upon":[108],"relation,":[110],"second":[113],"contribution":[114],"propose":[116],"two-hop":[118],"distributed":[121],"feedback":[122],"control":[123,138],"law":[124,139],"ensures":[126],"with":[132],"predetermined":[134],"robustness.":[135],"The":[136],"proposed":[137],"employs":[140],"line":[142],"and":[148],"does":[149],"not":[150],"require":[151],"knowledge":[152],"complete":[155],"row":[156],"constraint":[159],"matrix.":[160]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-15T00:00:00"}