“…Taking inspiration from social insects, a number of probabilistic robot control algorithms achieve aggregation using a finite state machine characterized by two basic states: walk and wait [20,21,22,23,24,25,26,27,28,29,30,31,32]. At 9 each state corresponds a specific robot behavior; the different states in use (and the behavior implemented in each state) vary between algorithms, but many similarities can be found in various aggregation studies.…”