Multi-agent Coverage Control: From Discrete Assignments to Continuous Multi-agent Distribution Matching
<|reference_start|>Multi-agent Coverage Control: From Discrete Assignments to Continuous Multi-agent Distribution Matching: The multi-agent spatial coverage control problem encompasses a broad research domain, dealing with both dynamic and static deployment strategies, discrete-task assignments, and spatial distribution-matching deployment. Coverage control may involve the deployment of a finite number of agents or a continuum through centralized or decentralized, locally-interacting schemes. All these problems can be solved via a different taxonomy of deployment algorithms for multiple agents. Depending on the application scenario, these problems involve from purely discrete descriptions of tasks (finite loads) and agents (finite resources), to a mixture of discrete and continuous elements, to fully continuous descriptions of the same. Yet, it is possible to find common features that underline all the above formulations, which we aim to illustrate here. By doing so, we aim to point the reader to novel references related to these problems. The short article outline is the following: Static coverage via concurrent area partitioning and assignment; Static coverage as a discrete task assignment; and Continuum task assignment for large-scale swarms.<|reference_end|>
@article{kia2024multi-agent,
    title={Multi-agent Coverage Control: From Discrete Assignments to Continuous
  Multi-agent Distribution Matching},
    author={Solmaz Kia and Sonia Martinez},
    journal={Summer 2024 DSCD Newsletter},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.13890},
    primaryClass={cs.RO math.OC}
}