Low conservative criteria for robust consensus of multiagent systems with delays, disturbances, and topologies uncertainties (Q1718187)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Low conservative criteria for robust consensus of multiagent systems with delays, disturbances, and topologies uncertainties
scientific article

    Statements

    Low conservative criteria for robust consensus of multiagent systems with delays, disturbances, and topologies uncertainties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Considering the limited communications conditions such as delays, disturbances, and topologies uncertainties, the stability criteria for robust consensus of multiagent systems are proposed in this paper. Firstly, by using the idea of state decomposition and space transformation, the condition for guaranteeing consensus is converted into verifying the robust stability of the disagreement system. In order to deal with multiple time-varying delays and switching topologies, jointly quadratic common Lyapunov-Krasovskii (JQCLK) functional is built to analyze the robust stability. Then, the numerical criterion can be obtained through solving the corresponding feasible nonlinear matrix inequality (NLMI); at last, nonlinear minimization is used like solving cone complementarity problem. Therefore, the linear matrix inequality (LMI) criterion is obtained, which can be solved by mathematical toolbox conveniently. In order to relax the conservativeness, free-weighting matrices (FWM) method is employed. Further, the conclusion is extended to the case of strongly connected topologies. Numerical examples and simulation results are given to demonstrate the effectiveness and the benefit on reducing conservativeness of the proposed criteria.
    0 references
    0 references

    Identifiers

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