JOURNAL ARTICLE

The finite-time average consensus problems in multi-agent systems with switching topology

Abstract

In practice, the communication links between any two agents may not always be available. Based on this, the finite-time average consensus problems in multi-agent systems with switching topology are studied in this paper. The multi-agent systems with switching topology are divided into four types according to the ways of topology interconnection firstly. Then, the finite-time average consensus problems on two of the most common types are studied, and the upper bound of the convergence time is obtained. The asymptotical average consensus problem on another system is explained simply. Lastly, simulations are conducted to verify the effectiveness of the results.

Keywords:
Topology (electrical circuits) Convergence (economics) Multi-agent system Upper and lower bounds Network topology Uniform consensus Computer science Consensus Extension topology Mathematics Distributed computing General topology Computer network Discrete mathematics Artificial intelligence

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
32
Refs
0.08
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Distributed Control Multi-Agent Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Neural Networks Stability and Synchronization
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mathematical and Theoretical Epidemiology and Ecology Models
Health Sciences →  Medicine →  Public Health, Environmental and Occupational Health
© 2026 ScienceGate Book Chapters — All rights reserved.