Finite-time consensus of networked nonlinear systems under directed graph

Abstract : In this paper, we study the finite-time consensus problem of networked nonlinear systems under directed fixed graph. A nonlinear system is considered as a controlled first-order differential equation with/without drift term commonly used to model autonomous systems. For multi-system formation under directed fixed graph, a protocol is proposed to solve consensus problems in finite time. Guided by finite-time stability techniques and the graph theory, our protocol is applied for multi-system in interaction with different nonlinear models. As illustrative examples, under the proposed protocols, a networked unicycles and second-order dynamics achieve consensus in finite time.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01092962
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, December 9, 2014 - 6:04:21 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Identifiers

Collections

Citation

Naim Zoghlami, Lotfi Beji, Rhouma Mlayeh, Azgal Abichou, Chaker Jammazi,. Finite-time consensus of networked nonlinear systems under directed graph. 13th European Control Conference (ECC 2014), Jun 2014, Strasbourg, France. pp.546--551, ⟨10.1109/ECC.2014.6862423⟩. ⟨hal-01092962⟩

Share

Metrics

Record views

107