Metraipolis › archive › dc_7c5997697476

Distributed Marginal Return: A Communication-Efficient Algorithm for Multi-Agent Weapon Target Assignment — arXiv:2611.04370

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04370
License (as archived)
CC0-1.0
Archived
2026-11-04T12:26:32.267Z
SHA-256 of the archived text
88bf0920427d5dd5055527d9f057af5a5ce9725b0131fa9972dba49ec59b99b3
Stable URL of this page
https://metraipolis.com/documento/dc_7c5997697476

How to cite

Distributed Marginal Return: A Communication-Efficient Algorithm for Multi-Agent Weapon Target Assignment — arXiv:2611.04370 — arXiv (en), https://arxiv.org/abs/2611.04370 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c5997697476 (Metraipolis archive dc_7c5997697476, sha256 88bf0920427d5dd5055527d9f057af5a5ce9725b0131fa9972dba49ec59b99b3)
BibTeX
@misc{dc7c5997697476,
  title = {Distributed Marginal Return: A Communication-Efficient Algorithm for Multi-Agent Weapon Target Assignment — arXiv:2611.04370},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04370},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c5997697476; sha256 88bf0920427d5dd5055527d9f057af5a5ce9725b0131fa9972dba49ec59b99b3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04370. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Weapon-Target Assignment (WTA) problem in distributed multi-agent systems is challenged by limited situational awareness and communication constraints. Existing distributed methods, such as auction-consensus algorithms, typically assume task-value independence, a simplification that fails to capture the coupled effects of multi-weapon assignments. This paper introduces the Distributed Marginal Return (DMR) algorithm, a novel decentralized approach that generalizes auction-consensus frameworks. DMR enables agents to compute bids based on marginal return and uses a consensus protocol to resolve conflicts, allowing multiple non-conflicting proposals to be accepted in parallel for cooperative optimization with minimal communication. A key theoretical contribution is our proof that the marginal returns of non-conflicting bids are additive, a property that ensures global consistency and validates our parallel acceptance mechanism. Extensive simulations demonstrate that DMR significantly outperforms baseline algorithms in both solution quality and communication efficiency, offering a scalable and robust solution for real-world distributed command and control applications.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2611.04370 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:26:32.131Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).