© 2021 ACM.In collective decision-making, individuals in a swarm reach consensus on a decision using only local interactions without any centralized control. In the context of the best-of-n problem - characterized by n discrete alternatives - it has been shown that consensus to the best option can be reached if individuals disseminate that option more than the other options. Besides being used as a mechanism to modulate positive feedback, long dissemination times could potentially also be used in an adversarial way, whereby adversarial swarms could infiltrate the system and propagate bad decisions using aggressive dissemination strategies. Motivated by the above scenario, in this paper we propose a bio-inspired defence strategy that allows the swarm to be resilient against options that can be disseminated for longer times. This strategy mainly consists in reducing the mobility of the agents that are associated to options disseminated for a shorter amount of time, allowing the swarm to converge to this option. We study the effectiveness of this strategy using two classical decision mechanisms, the voter model and the majority rule, showing that the majority rule is necessary in our setting for this strategy to work. The strategy has also been validated on a real Kilobots experiment.
|Title of host publication||GECCO 2021 - Proceedings of the 2021 Genetic and Evolutionary Computation Conference|
|Publisher||Association for Computing Machinery, Inc|
|Publication status||Published - 26 Jun 2021|
|Event||2021 Genetic and Evolutionary Computation Conference, GECCO 2021 - Virtual, Online, France|
Duration: 10 Jul 2021 → 14 Jul 2021
|Conference||2021 Genetic and Evolutionary Computation Conference, GECCO 2021|
|Period||10/07/21 → 14/07/21|