Finite-time consensus for switching network topologies with disturbances

• Published in: Nonlinear analysis. Hybrid systems Vol. 10; pp. 83 - 93
• Main Authors: Franceschelli, Mauro, Giua, Alessandro, Pisano, Alessandro, Usai, Elio
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.11.2013
• Subjects: Algorithms; Clock synchronization; Discontinuous control; Disengaging; Disturbance rejection; Disturbances; Finite time consensus; Multi-agent systems; Networks; Switching; Switching theory; Synchronism; Topology; Clock synchronization; Disturbance rejection; Discontinuous control; Finite time consensus; Multi-agent systems
• ISSN: 1751-570X
• DOI: 10.1016/j.nahs.2013.06.004

In this paper we investigate the properties of a decentralized consensus algorithm for a network of continuous-time integrators subject to unknown-but-bounded time-varying disturbances. The proposed consensus algorithm is based on a discontinuous local interaction rule. Under certain restrictions on the switching topology, it is proven that after a finite transient time the agents achieve an approximated consensus condition by attenuating the destabilizing effect of the disturbances. This main result is complemented by an additional result establishing the achievement of consensus under different requirements on the switching communication topology. In particular, we provide a convergence result that encompasses situations in which the time varying graph is always disconnected. Lyapunov analyses are carried out to support the suggested algorithms and results. Simulative tests considering, as case study, the synchronization problem for a network of clocks are illustrated and commented on to validate the developed analysis.