AI News HubLIVE
Original source2 min read

Learning Altruistic Collaboration in Heterogeneous Multi-Team Systems

This paper proposes a framework for heterogeneous multi-team collaboration via dynamic robot allocation, using Hamilton's rule for altruistic decision-making. The allocation problem is NP-hard, addressed by a graph neural network policy under centralized training and decentralized execution, validated in firefighting simulations to achieve near-optimal performance and scalability.

SourcearXiv RoboticsAuthor: Riwa Karam, Ruoyu Lin, Brooks A. Butler, Magnus Egerstedt

[2605.21723] Learning Altruistic Collaboration in Heterogeneous Multi-Team Systems

[Submitted on 20 May 2026]

Title:Learning Altruistic Collaboration in Heterogeneous Multi-Team Systems

View a PDF of the paper titled Learning Altruistic Collaboration in Heterogeneous Multi-Team Systems, by Riwa Karam and 3 other authors

View PDF HTML (experimental)

Abstract:This paper studies heterogeneous multi-team collaboration through dynamic robot allocation, where robots are treated as transferable resources. Leveraging Hamilton's rule from ecology as an altruistic decision-making mechanism, we propose a multi-team collaborative resource allocation framework with heterogeneous capabilities, transfer costs, and capability-dependent contributions. The resulting allocation problem is combinatorial and is shown to be NP-hard. To address scalability, we develop a graph neural network policy under centralized training and decentralized execution that approximates the altruistic allocations based on Hamilton's rule. The model operates over the team interaction graph and predicts robot-level transfer decisions and next robot-to-team assignments. The proposed approach is validated in a firefighting scenario through simulations and experiments, demonstrating that the learned policy achieves near-optimal performance while scaling to larger systems.

Subjects:

Robotics (cs.RO); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA); Systems and Control (eess.SY)

Cite as: arXiv:2605.21723 [cs.RO]

(or arXiv:2605.21723v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2605.21723

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Riwa Karam [view email] [v1] Wed, 20 May 2026 20:30:58 UTC (7,954 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Learning Altruistic Collaboration in Heterogeneous Multi-Team Systems, by Riwa Karam and 3 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-05

Change to browse by:

cs cs.AI cs.MA cs.SY eess eess.SY

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)