Finite-time consensus with a time-varying reference state and switching topology (Q1722717)

From MaRDI portal
Revision as of 06:39, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finite-time consensus with a time-varying reference state and switching topology
scientific article

    Statements

    Finite-time consensus with a time-varying reference state and switching topology (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2019
    0 references
    Summary: The finite-time consensus problem in the networks of multiple mobile agents is comprehensively investigated. In order to resolve this problem, a novel nonlinear information exchange protocol is proposed. The proposed protocol ensures that the states of the agents are converged to a weighted-average consensus in finite time if the communication topology is a weighted directed graph with a spanning tree and each strongly connected component is detail-balanced. Furthermore, the proposed protocol is also able to solve the finite-time consensus problem of networks with a switching topology. Finally, computer simulations are presented to demonstrate and validate the effectiveness of the theoretical analysis under the proposed protocol.
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references