{"id":"https://openalex.org/W7125908703","doi":"https://doi.org/10.1109/mrs66243.2025.11357248","title":"Bandwidth-Aware Multi-Robot Coordination with Utility-Guided Coalition Formation","display_name":"Bandwidth-Aware Multi-Robot Coordination with Utility-Guided Coalition Formation","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7125908703","doi":"https://doi.org/10.1109/mrs66243.2025.11357248"},"language":null,"primary_location":{"id":"doi:10.1109/mrs66243.2025.11357248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs66243.2025.11357248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","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/A5026713150","display_name":"Rhett Hull","orcid":null},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rhett Hull","raw_affiliation_strings":["University of Technology Sydney,Ultimo,NSW,Australia,2006"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney,Ultimo,NSW,Australia,2006","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053830227","display_name":"Robert Fitch","orcid":"https://orcid.org/0000-0003-2215-5188"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Robert Fitch","raw_affiliation_strings":["University of Technology Sydney,Ultimo,NSW,Australia,2006"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney,Ultimo,NSW,Australia,2006","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037572995","display_name":"Graeme Best","orcid":"https://orcid.org/0000-0003-0443-8248"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Graeme Best","raw_affiliation_strings":["University of Technology Sydney,Ultimo,NSW,Australia,2006"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney,Ultimo,NSW,Australia,2006","institution_ids":["https://openalex.org/I114017466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114017466"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64707167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9502000212669373,"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":0.9502000212669373,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.018200000748038292,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.007799999788403511,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6416000127792358},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5378000140190125},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5152999758720398},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.448199987411499},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41499999165534973},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.40119999647140503},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.3978999853134155},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.3797999918460846},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.34950000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6722000241279602},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6416000127792358},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5378000140190125},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5152999758720398},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3547999858856201},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3366999924182892},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C107257861","wikidata":"https://www.wikidata.org/wiki/Q656316","display_name":"Coordination game","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.295199990272522},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27399998903274536},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C169337768","wikidata":"https://www.wikidata.org/wiki/Q2446723","display_name":"Swarm robotics","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.26159998774528503},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.25459998846054077},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C205875254","wikidata":"https://www.wikidata.org/wiki/Q17156857","display_name":"Decentralised system","level":3,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mrs66243.2025.11357248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs66243.2025.11357248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W1583835954","https://openalex.org/W1645067740","https://openalex.org/W1971441460","https://openalex.org/W1991482882","https://openalex.org/W2046431055","https://openalex.org/W2131681506","https://openalex.org/W2138677310","https://openalex.org/W2139662247","https://openalex.org/W2154599137","https://openalex.org/W2156887976","https://openalex.org/W2160099008","https://openalex.org/W2162584647","https://openalex.org/W2202983866","https://openalex.org/W2293302471","https://openalex.org/W2790514337","https://openalex.org/W2791580684","https://openalex.org/W2902806241","https://openalex.org/W2941989334","https://openalex.org/W2963098825","https://openalex.org/W2969092468","https://openalex.org/W3112984084","https://openalex.org/W3217169121","https://openalex.org/W4225567865","https://openalex.org/W4383109098","https://openalex.org/W7124140662","https://openalex.org/W7124170842"],"related_works":[],"abstract_inverted_index":{"Decentralised":[0],"multi-robot":[1,117,148],"coordination":[2,43,106,143],"strategies":[3],"often":[4],"assume":[5],"that":[6,45,80,126],"all":[7],"robots":[8,54],"communicate":[9],"with":[10,120],"one":[11,66],"another":[12],"to":[13,35,99,103],"plan":[14],"jointly.":[15],"While":[16],"effective":[17],"in":[18],"small":[19],"teams,":[20],"this":[21],"all-toall":[22],"communication":[23],"model":[24],"becomes":[25],"infeasible":[26],"under":[27],"realistic":[28],"bandwidth":[29],"constraints,":[30],"presenting":[31],"a":[32,42,47,75,94,116],"fundamental":[33],"challenge":[34],"scalability.":[36],"To":[37],"address":[38],"this,":[39],"we":[40],"propose":[41],"framework":[44],"includes":[46],"novel":[48],"coalition":[49],"formation":[50],"step,":[51],"which":[52],"partitions":[53],"into":[55],"sub-teams,":[56],"grouping":[57],"together":[58],"those":[59],"whose":[60],"optimal":[61],"actions":[62],"strongly":[63],"depend":[64],"on":[65,115],"another.":[67],"At":[68],"the":[69,104,109],"core":[70],"of":[71,108],"our":[72,113,127],"approach":[73,128],"is":[74],"sampling-based,":[76],"information-theoretic":[77],"utility":[78,92],"measure":[79],"captures":[81],"higher-order":[82],"dependenciesbeyond":[83],"simple":[84],"pairwise":[85],"interactions-between":[86],"robots'":[87],"joint":[88],"action":[89],"spaces.":[90],"This":[91],"guides":[93],"greedy":[95],"agglomerative":[96],"clustering":[97],"algorithm":[98],"form":[100],"coalitions":[101],"tailored":[102],"specific":[105],"demands":[107],"task.":[110],"We":[111],"evaluate":[112],"method":[114],"information-gathering":[118],"scenario":[119],"complex":[121],"interrobot":[122],"dependencies.":[123],"Results":[124],"show":[125],"achieves":[129],"comparable":[130],"or":[131],"better":[132],"performance":[133],"than":[134],"full":[135],"connectivity":[136],"while":[137],"significantly":[138],"reducing":[139],"communication,":[140],"demonstrating":[141],"improved":[142],"efficiency":[144],"crucial":[145],"for":[146],"scaling":[147],"systems.":[149]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2026-01-29T00:00:00"}