.png){kind=icon}
.png){kind=icon}
Return
Interval consensus over random networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2019.108603.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the interval consensus problems of discrete-time multi-agent systems over random interaction networks, where each agent can impose a lower and an upper bound, i.e., a local constraint interval, on the achievable consensus value. We show that if the intersection of the intervals is nonempty, it holds as a sure event that the states of all the agents converge to a common value inside that intersection, i.e., the interval consensus can be achieved almost surely. Convergence analysis is performed through developing a robust consensus analysis of random networks in view of a martingale convergence lemma. Numerical examples are also exhibited to verify the validity of the theoretical results. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Interval consensus
Random networks
Intersection of the intervals
Robust consensus
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
View more organizations