cs.ROJul 15, 2026

Stochastic Filtering for Quorum Sensing in Robot Swarms under Anonymous Communication

Authors: Fabio OddiAndreagiovanni ReinaVito Trianni

Organizations: DIAG, Sapienza University of Rome, Italy · ISTC, National Research Council, Rome, Italy · Centre for the Advanced Study of Collective Behaviour, University of Konstanz, Konstanz, Germany · Department of Computer and Information Science, University of Konstanz, Konstanz, Germany · Max Planck Institute of Animal Behavior, Konstanz, Germany

Abstract

Quorum Sensing (QS) is a key capability for robot swarms, useful for coordination of activities at the group level. Effective communication is instrumental for individuals to estimate the quorum level of the entire swarm. Anonymous communication protocols where individuals exchange local information without revealing unique identities are helpful to support quorum estimates by sampling information from neighbours and maintain scalability of the QS process. However, because anonymous protocols cannot distinguish message sources, repeated messages from the same sender may be double-counted, thereby biasing collective quorum estimates. In this study, we introduce a stochastic filtering protocol inspired by kk-priority sampling to improve estimate stability (\ANTk), and we compare it with a baseline anonymous protocols (\AN) and a randomised variant designed to improve accuracy (\ANT). We find that the baseline protocol \AN provides a parsimonious and fast solution, but remains highly inaccurate due to double-counting bias. The \ANT variant improves accuracy but suffers from information inertia, resulting in slower convergence. Finally, actively filtering the message buffer via the \ANTk protocol successfully decreases temporary errors and stabilises the estimate, at the cost of an increased time of recovery from errors.

Explore similar work

CardsList