SPIDER: a Bioinspired Swarm Algorithm for Adaptive Risk-Taking
Edmund R. Hunt, George P. Jenkinson, Michael Wilsher, Carl P. Dettmann, Sabine Hauert
- Year
- 2020
- Citations
- 5
- Access
- Open access
Abstract
Robot swarms can solve tasks that are impossible or too hazardous for single robots. For example, following a nuclear radiation leak, a user may wish to establish a distributed communication chain that partly extends into the most dangerous areas to gather new information. The challenge is to create long chains while maintaining chain connectivity (‘connected reach’), where those at the distant end of the chain are more likely to be disconnected. Here we take the concept of dynamic ‘boldness’ levels from animal behavior (<i>Stegodyphus</i> social spiders) to explore such risky environments in away that adapts to the size of the group. Boldness is implemented as a continuous variable associated with the risk appetite of individuals to explore regions more distant from a central base. We present a decentralized mechanism for robots, based on the frequency of their social interactions, to adaptively take on ‘bold’ and ‘shy’ behaviors. Using this new bioinspired algorithm, which we call SPIDER, swarms are shown to adapt rapidly to the loss of bold individuals by re-generating a suitable shy–bold distribution, with fewer bolder individuals in smaller groups. This allows them to dynamically trade-off the benefits and costs of long chains (information retrieval versus loss of robots) and demonstrates the particular advantage of this approach in hazardous or adversarial environments.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002