Consensus in topologically interacting swarms under communication constraints and time-delays

The emergence of collective decision in swarming systems underscores the central role played by information transmission. Using network-control- and information-theoretic elements applied to a group of topologically interacting agents seeking consensus under switching topologies, the effects of cons...

Full description

Saved in:
Bibliographic Details
Published inNonlinear dynamics Vol. 93; no. 3; pp. 1287 - 1300
Main Authors Komareji, M., Shang, Y., Bouffanais, R.
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Netherlands 01.08.2018
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The emergence of collective decision in swarming systems underscores the central role played by information transmission. Using network-control- and information-theoretic elements applied to a group of topologically interacting agents seeking consensus under switching topologies, the effects of constraints in the information capacity of the communication channel are investigated. This particular system requires us to contend with constantly reconfigurable and spatially embedded interaction networks. We find a sufficient condition on the information data rate guaranteeing the stability of the consensus process in the noiseless case. This result highlights the profound connection with the topological structure of the underlying interaction network, thus having far-reaching implications in the nascent field of swarm robotics. Furthermore, we analyze the more complex case of combined effect of noise and limited data rate. We find that the consensus process is degraded when decreasing the data rate. Moreover, the relationship between critical noise and data rate is found to be in good agreement with information-theoretic predictions. Lastly, we prove that with not-too-large time-delays, our system of topologically interacting agents is stable, provided the underlying interaction network is strongly connected. Using Lyapunov techniques, the maximum allowed time-delay is determined in terms of linear-matrix inequalities.
ISSN:0924-090X
1573-269X
DOI:10.1007/s11071-018-4259-1