Abstract
The Robotic Darwinian Particle Swarm Optimization (RDPSO) recently introduced in the literature has the ability to dynamically partition the whole population of robots based on simple 'punish-reward' rules. Although this evolutionary algorithm enables the reduction of the amount of required information exchange among robots, a further analysis on the communication complexity of the RDPSO needs to be carried out so as to evaluate its scalability. This paper analyses the architecture of the RDPSO communication system, thus describing the dynamics of the communication data packet structure shared between teammates. Moreover, a set of simple communication rules is also proposed in order to reduce the communication overhead within swarms of robots. Experimental results with teams of 15 real robots show that the proposed methodology reduces the communication overhead, thus improving the scalability and applicability of the RDPSO algorithm.
Original language | English |
---|---|
Title of host publication | 2013 IEEE Congress on Evolutionary Computation, CEC 2013 |
Pages | 127-134 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 21 Aug 2013 |
Event | 2013 IEEE Congress on Evolutionary Computation - Cancun, United Kingdom Duration: 20 Jun 2013 → 23 Jun 2013 |
Conference
Conference | 2013 IEEE Congress on Evolutionary Computation |
---|---|
Abbreviated title | CEC 2013 |
Country/Territory | United Kingdom |
City | Cancun |
Period | 20/06/13 → 23/06/13 |
Keywords
- communication complexity
- distributed search
- MANET
- scalability
- swarm robotics
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Theoretical Computer Science