Journal
AUTOMATICA
Volume 111, Issue -, Pages -Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2019.108603
Keywords
Interval consensus; Random networks; Intersection of the intervals; Robust consensus
Funding
- National Natural Science Foundation of China [61922076, 61725304, 61873252, 61673361]
- Fok Ying-Tong Education Foundation for Young Teachers in Higher Education Institutions of China [161059]
- Australian Research Council [DP120104986]
- NSW Cyber Security Network in Australia [P00025091]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available