The purpose of this study is to determine under what conditions, such as noise and malfunction, successful consensus achievement in swarm robotics is possible.

Swarm robots can be used to solve exploration problems, such as the best-of-n problem. Consensus achievement plays a crucial role as the swarm must collectively agree on a solution. This task can be even more challenging considering noise and malfunctioning or rogue agents.

This study aims to determine how robust the consensus achievement algorithm is against noise and rogue agents, considering the effect of adding memory to the agents and further parameter tuning.

We implement a baseline based on the democratic honeybees algorithm and investigate the performance and robustness of the consensus achievement during a number of computational experiments. In particular, the number of agents in the swarm, the number of iterations, the number of positions an agent can visit per iteration, the number of neighbors an agent shares its best option with, and the majority threshold defining the majority based on a fraction of agents in the swarm, and the minimum number of iterations to achieve consensus are investigated regarding their impact.

For better performance, memory has been implemented so that each agent remembers and retains their previous highest quality score if no one better has been found in the current exploration phase. We show that the algorithm is viable and offers robustness in the considered scenarios when memory is added. In particular, we establish a baseline for the democratic honeybees algorithm and ascertain adequate parameter values to ensure the algorithm's best performance. The algorithm is sufficiently robust against noise, and to an extent, against rogue agents. Furthermore, parameter tuning also proved to help the swarm explore very large search spaces.

The consensus algorithm appears sufficiently effective under adverse conditions such as noise and rogue agents, especially when countermeasures are considered.

Further scenarios such as specific communication topologies could be investigated in future research.