Skip to content

Finite-Time Bipartite Consensus for Multi-Agent Systems With Hidden Markov Switching Topologies

2026 · IEEE Control Systems Letters · Vol 10, pp. 2329-2334 · 0 citations · 27 references

Abstract

This letter addresses the problem of finite-time bipartite consensus in probability for multi-agent systems (MASs) subject to hidden Markov switching topologies. Since it is impractical to obtain accurate mode information of switching topologies, the hidden Markov model (HMM) is adopted to deal with this issue. Asynchronous controllers, whose modes are determined by conditional probabilities, are designed to operate without requiring perfect synchronization with the topological switches. An extended switching matrix $W_{\alpha } $ representing cooperative-competitive interactions is employed, which avoids the need for gauge transformation. Within this unified framework, by constructing a mode-dependent quadratic Lyapunov function, sufficient conditions are derived for achieving finite-time bipartite consensus/stability in probability under structurally balanced/unbalanced topologies. Simulation results demonstrate the validity of the proposed approach.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.