- Designing collective behaviors is cumbersome
- Requires experts for modeling
- Evolutionary computation to generate collective behaviors
dtdR=−aR+vnD,R(0)=R0
dtdO=aR−bO+cE,O(0)=O0
dtdE=q(D)bO−cE,E(0)=E0
dtdA=p(D)bO−mA+wnD
dtdD=mA−nD,D(0)=D0
Reference: Stability of choice in the honey bee nest-site selection process
Reference: Evolution of collective behaviors for a real swarm of aquatic surface robots
Merits
Demerits
Reference: GESwarm: Grammatical Evolution for the Automatic Synthesis of Collective Behaviors in Swarm Robotics
Advantages
Disadvantages
Reference: Behavior Trees for Evolutionary Robotics
Reference: odNEAT: An algorithm for distributed online, onboard evolution of robot behaviours
- A multi-agent Grammatical Evolution with BT
Hello! Neighbour!
How are you doing with the phenotype in this environment?
Hello!
I collected 35 oz of water with the phenotype.
Take my genome and perform magic using genetic operators !
The interaction of hundreds of agents within the framework of distributed grammatical evolution will increase the effectiveness of evolving collective behaviors of bio-swarms. The evolved behaviors can be reused for different collective problems that have similar properties. Furthermore, with a slight variation of the objective function, the same set of primitive behaviors, encoded in the grammar, can lead to collective behaviors over a wider range of collective problems.
Claim | Metric |
---|---|
Effectiveness | Quality solutions in fewer generations |
Robustness | Same behavior for both single and multiple foraging problem |
Breadth |
Solutions for Foraging and cooperative transport problem |
Solves the Santa Fe Trail in 324 steps
GE [Novelty] solved in 331 steps
Cooperative Transport
Nest Maintenance
Claims from thesis | Evidence |
---|---|
Effectiveness | Least number of steps for SantaFe Trail problem. |
Robustness | Transferability of evolved behaviors in foraging problems |
Breadth | Applicability of same BNF grammar for different swarm tasks |
Novelty | Combination of GE with BT |
This work has been funded by ONR grant number N000141613025.