Multiagent Systems

<!DOCTYPE html> <html lang="en"> <head> <title>Multiagent Systems </title> <meta name="viewport" content="width=device-width, initial-scale=1"> <link rel="apple-touch-icon" sizes="180x180" href="/static/browse/0.3.4/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/static/browse/0.3.4/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/static/browse/0.3.4/images/icons/favicon-16x16.png"> <link rel="manifest" href="/static/browse/0.3.4/images/icons/site.webmanifest"> <link rel="mask-icon" href="/static/browse/0.3.4/images/icons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="msapplication-TileColor" content="#da532c"> <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/arXiv.css?v=20241206" /> <link rel="stylesheet" type="text/css" media="print" href="/static/browse/0.3.4/css/arXiv-print.css?v=20200611" /> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/browse_search.css" /> <script language="javascript" src="/static/browse/0.3.4/js/accordion.js" /></script> <script src="/static/browse/0.3.4/js/mathjaxToggle.min.js" type="text/javascript"></script> <script type="text/javascript" language="javascript">mathjaxToggle();</script> </head> <body class="with-cu-identity"> <div class="flex-wrap-footer"> <header> <a href="#content" class="is-sr-only">Skip to main content</a>  <div class="columns is-vcentered is-hidden-mobile" id="cu-identity"> <div class="column" id="cu-logo"> <a href="https://www.cornell.edu/"><img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University" /></a> </div><div class="column" id="support-ack"> <span id="support-ack-url">We gratefully acknowledge support from the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors.</span> <a href="https://info.arxiv.org/about/donate.html" class="btn-header-donate">Donate</a> </div> </div> <div id="header" class="is-hidden-mobile"> <a aria-hidden="true" tabindex="-1" href="/IgnoreMe"></a> <div class="header-breadcrumbs"> <a href="/"><img src="/static/browse/0.3.4/images/arxiv-logo-one-color-white.svg" alt="arxiv logo" style="height:40px;"/></a> <span>></span> <a href="/list/cs.MA/recent">cs.MA</a> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div> <div class="mobile-header"> <div class="columns is-mobile"> <div class="column logo-arxiv"><a href="https://arxiv.org/"><img src="/static/browse/0.3.4/images/arxiv-logomark-small-white.svg" alt="arXiv logo" style="height:60px;" /></a></div> <div class="column logo-cornell"><a href="https://www.cornell.edu/"> <picture> <source media="(min-width: 501px)" srcset="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg 400w" sizes="400w" /> <source srcset="/static/browse/0.3.4/images/icons/cu/cornell_seal_simple_black.svg 2x" /> <img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University Logo" /> </picture> </a></div> <div class="column nav" id="toggle-container" role="menubar"> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-white"><title>open search</title><path d="M505 442.7L405.3 343c-4.5-4.5-10.6-7-17-7H372c27.6-35.3 44-79.7 44-128C416 93.1 322.9 0 208 0S0 93.1 0 208s93.1 208 208 208c48.3 0 92.7-16.4 128-44v16.3c0 6.4 2.5 12.5 7 17l99.7 99.7c9.4 9.4 24.6 9.4 33.9 0l28.3-28.3c9.4-9.4 9.4-24.6.1-34zM208 336c-70.7 0-128-57.2-128-128 0-70.7 57.2-128 128-128 70.7 0 128 57.2 128 128 0 70.7-57.2 128-128 128z"/></svg></button> <div class="mobile-toggle-block toggle-target"> <form class="mobile-search-form" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <input class="input" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <input type="hidden" name="source" value="header"> <input type="hidden" name="searchtype" value="all"> <button class="button">GO</button> </div> </form> </div> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-white" role="menu"><title>open navigation menu</title><path d="M16 132h416c8.837 0 16-7.163 16-16V76c0-8.837-7.163-16-16-16H16C7.163 60 0 67.163 0 76v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16z"/ ></svg></button> <div class="mobile-toggle-block toggle-target"> <nav class="mobile-menu" aria-labelledby="mobilemenulabel"> <h2 id="mobilemenulabel">quick links</h2> <ul> <li><a href="https://arxiv.org/login">Login</a></li> <li><a href="https://info.arxiv.org/help">Help Pages</a></li> <li><a href="https://info.arxiv.org/about">About</a></li> </ul> </nav> </div> </div> </div> </div> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Multiagent Systems</h1> <ul> <li><a href="#item0">New submissions</a></li> <li><a href="#item3">Cross-lists</a></li> <li><a href="#item9">Replacements</a></li> </ul> <p>See <a id="recent-cs.MA" aria-labelledby="recent-cs.MA" href="/list/cs.MA/recent">recent</a> articles</p> <h3>Showing new listings for Friday, 21 March 2025</h3> <div class='paging'>Total of 9 entries </div> <div class='morefewer'>Showing up to 2000 entries per page: <a href=/list/cs.MA/new?skip=0&show=1000 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <span style="color: #454545">all</span> </div> <dl id='articles'> <h3>New submissions (showing 2 of 2 entries)</h3> <dt> <a name='item1'>[1]</a> <a href ="/abs/2503.15703" title="Abstract" id="2503.15703"> arXiv:2503.15703 </a> [<a href="/pdf/2503.15703" title="Download PDF" id="pdf-2503.15703" aria-labelledby="pdf-2503.15703">pdf</a>, <a href="https://arxiv.org/html/2503.15703v1" title="View HTML" id="html-2503.15703" aria-labelledby="html-2503.15703" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15703" title="Other formats" id="oth-2503.15703" aria-labelledby="oth-2503.15703">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Predicting Multi-Agent Specialization via Task Parallelizability </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Mieczkowski,+E">Elizabeth Mieczkowski</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mon-Williams,+R">Ruaridh Mon-Williams</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Bramley,+N">Neil Bramley</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lucas,+C+G">Christopher G. Lucas</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Velez,+N">Natalia Velez</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Griffiths,+T+L">Thomas L. Griffiths</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Multiagent Systems (cs.MA)</span>; Artificial Intelligence (cs.AI) </div> <p class='mathjax'> Multi-agent systems often rely on specialized agents with distinct roles rather than general-purpose agents that perform the entire task independently. However, the conditions that govern the optimal degree of specialization remain poorly understood. In this work, we propose that specialist teams outperform generalist ones when environmental constraints limit task parallelizability -- the potential to execute task components concurrently. Drawing inspiration from distributed systems, we introduce a heuristic to predict the relative efficiency of generalist versus specialist teams by estimating the speed-up achieved when two agents perform a task in parallel rather than focus on complementary subtasks. We validate this heuristic through three multi-agent reinforcement learning (MARL) experiments in Overcooked-AI, demonstrating that key factors limiting task parallelizability influence specialization. We also observe that as the state space expands, agents tend to converge on specialist strategies, even when generalist ones are theoretically more efficient, highlighting potential biases in MARL training algorithms. Our findings provide a principled framework for interpreting specialization given the task and environment, and introduce a novel benchmark for evaluating whether MARL finds optimal strategies. </p> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/2503.15955" title="Abstract" id="2503.15955"> arXiv:2503.15955 </a> [<a href="/pdf/2503.15955" title="Download PDF" id="pdf-2503.15955" aria-labelledby="pdf-2503.15955">pdf</a>, <a href="https://arxiv.org/html/2503.15955v1" title="View HTML" id="html-2503.15955" aria-labelledby="html-2503.15955" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15955" title="Other formats" id="oth-2503.15955" aria-labelledby="oth-2503.15955">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Consensus Tracking Control of Multi-agent Systems with A Time-varying Reference State under Binary-valued Communication </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+T">Ting Wang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Qiu,+Z">Zhuangzhuang Qiu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lu,+X">Xiaodong Lu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhao,+Y">Yanlong Zhao</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Multiagent Systems (cs.MA)</span> </div> <p class='mathjax'> This paper investigates the problem of consensus tracking control of discrete time multi-agent systems under binary-valued communication. Different from most existing studies on consensus tracking, the transmitted information between agents is the binary-valued. Parameter identification with binary-valued observations is applied to the estimation of neighbors'states and the tracking control is designed based on the estimation. Two Lyapunov functions are constructed to deal with the strong coupling of estimation and control. Compared with consensus problems under binary-valued communication, a reference state is required for consensus tracking control. Two scenarios of the time-varying reference state are studied respectively. (1) The reference state is asymptotically convergent. An online algorithm that performs estimation and control simultaneously is proposed, in which the estimation step size and the control gain are decreasing with time. By this algorithm, the multi-agent system is proved to achieve consensus tracking with convergence rate O(1/k^{\epsilon} ) under certain conditions. (2) The reference state is bounded, which is less conservative than that in the first case. In this case, the estimation step size and control gain are designed to be constant. By this algorithm, all the followers can reach to a neighborhood of the leader with an exponential rate. Finally, simulations are given to demonstrate theoretical results. </p> </div> </dd> </dl> <dl id='articles'> <h3>Cross submissions (showing 6 of 6 entries)</h3> <dt> <a name='item3'>[3]</a> <a href ="/abs/2503.15498" title="Abstract" id="2503.15498"> arXiv:2503.15498 </a> (cross-list from cs.HC) [<a href="/pdf/2503.15498" title="Download PDF" id="pdf-2503.15498" aria-labelledby="pdf-2503.15498">pdf</a>, <a href="https://arxiv.org/html/2503.15498v1" title="View HTML" id="html-2503.15498" aria-labelledby="html-2503.15498" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15498" title="Other formats" id="oth-2503.15498" aria-labelledby="oth-2503.15498">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Revival: Collaborative Artistic Creation through Human-AI Interactions in Musical Creativity </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+K+J+M">Keon Ju M. Lee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pasquier,+P">Philippe Pasquier</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Yuri,+J">Jun Yuri</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Keon Ju M. Lee, Philippe Pasquier and Jun Yuri. 2024. In Proceedings of the Creativity and Generative AI NIPS (Neural Information Processing Systems) Workshop </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Human-Computer Interaction (cs.HC)</span>; Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA); Multimedia (cs.MM); Sound (cs.SD); Audio and Speech Processing (eess.AS) </div> <p class='mathjax'> Revival is an innovative live audiovisual performance and music improvisation by our artist collective K-Phi-A, blending human and AI musicianship to create electronic music with audio-reactive visuals. The performance features real-time co-creative improvisation between a percussionist, an electronic music artist, and AI musical agents. Trained in works by deceased composers and the collective's compositions, these agents dynamically respond to human input and emulate complex musical styles. An AI-driven visual synthesizer, guided by a human VJ, produces visuals that evolve with the musical landscape. Revival showcases the potential of AI and human collaboration in improvisational artistic creation. </p> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/2503.15515" title="Abstract" id="2503.15515"> arXiv:2503.15515 </a> (cross-list from cs.HC) [<a href="/pdf/2503.15515" title="Download PDF" id="pdf-2503.15515" aria-labelledby="pdf-2503.15515">pdf</a>, <a href="https://arxiv.org/html/2503.15515v1" title="View HTML" id="html-2503.15515" aria-labelledby="html-2503.15515" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15515" title="Other formats" id="oth-2503.15515" aria-labelledby="oth-2503.15515">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Towards Computer-Using Personal Agents </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bonatti,+P+A">Piero A. Bonatti</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Domingue,+J">John Domingue</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gentile,+A+L">Anna Lisa Gentile</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Harth,+A">Andreas Harth</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hartig,+O">Olaf Hartig</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hogan,+A">Aidan Hogan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hose,+K">Katja Hose</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jimenez-Ruiz,+E">Ernesto Jimenez-Ruiz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=McGuinness,+D+L">Deborah L. McGuinness</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sun,+C">Chang Sun</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Verborgh,+R">Ruben Verborgh</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wright,+J">Jesse Wright</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This report is a result of Dagstuhl Seminar 25051 "Trust and Accountability in Knowledge Graph-Based AI for Self Determination", which took place in January 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Human-Computer Interaction (cs.HC)</span>; Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA) </div> <p class='mathjax'> Computer-Using Agents (CUA) enable users to automate increasingly-complex tasks using graphical interfaces such as browsers. As many potential tasks require personal data, we propose Computer-Using Personal Agents (CUPAs) that have access to an external repository of the user's personal data. Compared with CUAs, CUPAs offer users better control of their personal data, the potential to automate more tasks involving personal data, better interoperability with external sources of data, and better capabilities to coordinate with other CUPAs in order to solve collaborative tasks involving the personal data of multiple users. </p> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/2503.15524" title="Abstract" id="2503.15524"> arXiv:2503.15524 </a> (cross-list from cs.HC) [<a href="/pdf/2503.15524" title="Download PDF" id="pdf-2503.15524" aria-labelledby="pdf-2503.15524">pdf</a>, <a href="/format/2503.15524" title="Other formats" id="oth-2503.15524" aria-labelledby="oth-2503.15524">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> KHAIT: K-9 Handler Artificial Intelligence Teaming for Collaborative Sensemaking </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Wilchek,+M">Matthew Wilchek</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+L">Linhan Wang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Dickinson,+S">Sally Dickinson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Feuerbacher,+E">Erica Feuerbacher</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Luther,+K">Kurt Luther</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Batarseh,+F+A">Feras A. Batarseh</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 13 pages, 7 figures, ACM 30th International Conference on Intelligent User Interfaces (IUI 25) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Human-Computer Interaction (cs.HC)</span>; Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Emerging Technologies (cs.ET); Multiagent Systems (cs.MA) </div> <p class='mathjax'> In urban search and rescue (USAR) operations, communication between handlers and specially trained canines is crucial but often complicated by challenging environments and the specific behaviors canines are trained to exhibit when detecting a person. Since a USAR canine often works out of sight of the handler, the handler lacks awareness of the canine's location and situation, known as the 'sensemaking gap.' In this paper, we propose KHAIT, a novel approach to close the sensemaking gap and enhance USAR effectiveness by integrating object detection-based Artificial Intelligence (AI) and Augmented Reality (AR). Equipped with AI-powered cameras, edge computing, and AR headsets, KHAIT enables precise and rapid object detection from a canine's perspective, improving survivor localization. We evaluate this approach in a real-world USAR environment, demonstrating an average survival allocation time decrease of 22%, enhancing the speed and accuracy of operations. </p> </div> </dd> <dt> <a name='item6'>[6]</a> <a href ="/abs/2503.15547" title="Abstract" id="2503.15547"> arXiv:2503.15547 </a> (cross-list from cs.CR) [<a href="/pdf/2503.15547" title="Download PDF" id="pdf-2503.15547" aria-labelledby="pdf-2503.15547">pdf</a>, <a href="https://arxiv.org/html/2503.15547v1" title="View HTML" id="html-2503.15547" aria-labelledby="html-2503.15547" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15547" title="Other formats" id="oth-2503.15547" aria-labelledby="oth-2503.15547">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Prompt Flow Integrity to Prevent Privilege Escalation in LLM Agents </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kim,+J">Juhee Kim</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Choi,+W">Woohyuk Choi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+B">Byoungyoung Lee</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Cryptography and Security (cs.CR)</span>; Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA) </div> <p class='mathjax'> Large Language Models (LLMs) are combined with plugins to create powerful LLM agents that provide a wide range of services. Unlike traditional software, LLM agent's behavior is determined at runtime by natural language prompts from either user or plugin's data. This flexibility enables a new computing paradigm with unlimited capabilities and programmability, but also introduces new security risks, vulnerable to privilege escalation attacks. Moreover, user prompt is prone to be interpreted in an insecure way by LLM agents, creating non-deterministic behaviors that can be exploited by attackers. To address these security risks, we propose Prompt Flow Integrity (PFI), a system security-oriented solution to prevent privilege escalation in LLM agents. Analyzing the architectural characteristics of LLM agents, PFI features three mitigation techniques -- i.e., untrusted data identification, enforcing least privilege on LLM agents, and validating unsafe data flows. Our evaluation result shows that PFI effectively mitigates privilege escalation attacks while successfully preserving the utility of LLM agents. </p> </div> </dd> <dt> <a name='item7'>[7]</a> <a href ="/abs/2503.15812" title="Abstract" id="2503.15812"> arXiv:2503.15812 </a> (cross-list from cs.PL) [<a href="/pdf/2503.15812" title="Download PDF" id="pdf-2503.15812" aria-labelledby="pdf-2503.15812">pdf</a>, <a href="https://arxiv.org/html/2503.15812v1" title="View HTML" id="html-2503.15812" aria-labelledby="html-2503.15812" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.15812" title="Other formats" id="oth-2503.15812" aria-labelledby="oth-2503.15812">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Data Spatial Programming </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Mars,+J">Jason Mars</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, 11 pages with appendix </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Programming Languages (cs.PL)</span>; Multiagent Systems (cs.MA); Software Engineering (cs.SE) </div> <p class='mathjax'> We introduce a novel programming model, Data Spatial Programming, which extends the semantics of Object-Oriented Programming (OOP) by introducing new class-like constructs called archetypes. These archetypes encapsulate spatial relationships between data entities and execution flow in a structured manner, enabling more expressive and semantically rich computations over interconnected data structures. By formalizing the relationships between data elements in space, our approach allows for more intuitive modeling of complex systems where the topology of connections is essential to the underlying computational model. This paradigm addresses limitations in traditional OOP when representing dynamically evolving networks, agent-based systems, and other spatially-oriented computational problems. </p> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/2503.16216" title="Abstract" id="2503.16216"> arXiv:2503.16216 </a> (cross-list from cs.DC) [<a href="/pdf/2503.16216" title="Download PDF" id="pdf-2503.16216" aria-labelledby="pdf-2503.16216">pdf</a>, <a href="https://arxiv.org/html/2503.16216v1" title="View HTML" id="html-2503.16216" aria-labelledby="html-2503.16216" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.16216" title="Other formats" id="oth-2503.16216" aria-labelledby="oth-2503.16216">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Dispersion is (Almost) Optimal under (A)synchrony </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kshemkalyani,+A+D">Ajay D. Kshemkalyani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kumar,+M">Manish Kumar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Molla,+A+R">Anisur Rahaman Molla</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sharma,+G">Gokarna Sharma</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 24 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span>; Data Structures and Algorithms (cs.DS); Multiagent Systems (cs.MA); Robotics (cs.RO) </div> <p class='mathjax'> The dispersion problem has received much attention recently in the distributed computing literature. In this problem, $k\leq n$ agents placed initially arbitrarily on the nodes of an $n$-node, $m$-edge anonymous graph of maximum degree $\Delta$ have to reposition autonomously to reach a configuration in which each agent is on a distinct node of the graph. Dispersion is interesting as well as important due to its connections to many fundamental coordination problems by mobile agents on graphs, such as exploration, scattering, load balancing, relocation of self-driven electric cars (robots) to recharge stations (nodes), etc. The objective has been to provide a solution that optimizes simultaneously time and memory complexities. There exist graphs for which the lower bound on time complexity is $\Omega(k)$. Memory complexity is $\Omega(\log k)$ per agent independent of graph topology. The state-of-the-art algorithms have (i) time complexity $O(k\log^2k)$ and memory complexity $O(\log(k+\Delta))$ under the synchronous setting [DISC'24] and (ii) time complexity $O(\min\{m,k\Delta\})$ and memory complexity $O(\log(k+\Delta))$ under the asynchronous setting [OPODIS'21]. In this paper, we improve substantially on this state-of-the-art. Under the synchronous setting as in [DISC'24], we present the first optimal $O(k)$ time algorithm keeping memory complexity $O(\log (k+\Delta))$. Under the asynchronous setting as in [OPODIS'21], we present the first algorithm with time complexity $O(k\log k)$ keeping memory complexity $O(\log (k+\Delta))$, which is time-optimal within an $O(\log k)$ factor despite asynchrony. Both results were obtained through novel techniques to quickly find empty nodes to settle agents, which may be of independent interest. </p> </div> </dd> </dl> <dl id='articles'> <h3>Replacement submissions (showing 1 of 1 entries)</h3> <dt> <a name='item9'>[9]</a> <a href ="/abs/2403.10996" title="Abstract" id="2403.10996"> arXiv:2403.10996 </a> (replaced) [<a href="/pdf/2403.10996" title="Download PDF" id="pdf-2403.10996" aria-labelledby="pdf-2403.10996">pdf</a>, <a href="https://arxiv.org/html/2403.10996v5" title="View HTML" id="html-2403.10996" aria-labelledby="html-2403.10996" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2403.10996" title="Other formats" id="oth-2403.10996" aria-labelledby="oth-2403.10996">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Mixed-Reality Digital Twins: Leveraging the Physical and Virtual Worlds for Hybrid Sim2Real Transition of Multi-Agent Reinforcement Learning Policies </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Samak,+C+V">Chinmay Vilas Samak</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Samak,+T+V">Tanmay Vilas Samak</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Krovi,+V+N">Venkat Narayan Krovi</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Robotics (cs.RO)</span>; Machine Learning (cs.LG); Multiagent Systems (cs.MA) </div> <p class='mathjax'> Multi-agent reinforcement learning (MARL) for cyber-physical vehicle systems usually requires a significantly long training time due to their inherent complexity. Furthermore, deploying the trained policies in the real world demands a feature-rich environment along with multiple physical embodied agents, which may not be feasible due to monetary, physical, energy, or safety constraints. This work seeks to address these pain points by presenting a mixed-reality digital twin framework capable of: (i) selectively scaling parallelized workloads on-demand, and (ii) evaluating the trained policies across simulation-to-reality (sim2real) experiments. The viability and performance of the proposed framework are highlighted through two representative use cases, which cover cooperative as well as competitive classes of MARL problems. We study the effect of: (i) agent and environment parallelization on training time, and (ii) systematic domain randomization on zero-shot sim2real transfer across both case studies. Results indicate up to 76.3% reduction in training time with the proposed parallelization scheme and sim2real gap as low as 2.9% using the proposed deployment method. </p> </div> </dd> </dl> <div class='paging'>Total of 9 entries </div> <div class='morefewer'>Showing up to 2000 entries per page: <a href=/list/cs.MA/new?skip=0&show=1000 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <span style="color: #454545">all</span> </div> </div> </div> </div> </main> <footer style="clear: both;"> <div class="columns is-desktop" role="navigation" aria-label="Secondary" style="margin: -0.75em -0.75em 0.75em -0.75em">  <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>   </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Multiagent Systems