Consensus Analysis for High-order Heterogeneous Networks with Communication Delays and Dynamically Changing Digraphs
Creators
- 1. University of Electronic Science and Technology of China, School of Astronautics and Aeronautic (China)
- 2. Beijing Technology and Business University, School of Science (China)
Description
This paper studies consensus problems of high-order heterogeneous continuous-time networks with bounded communication delays and dynamically changing digraphs. The heterogeneous continuous-time networks consist of different order agents from first-order to lth-order agents, where different order networks correspond to different linear consensus protocols. In order to use the properties of Metzler matrix with zero row sums, we make model transformations of system matrix. Giving some restrictive conditions, we obtain the sufficient condition for consensus problems of heterogeneous networks with varying bounded communication delays. Although each communication graph may have no spanning trees, all agents of high-order heterogeneous networks can reach stationary consensus with varying bounded communication delays and dynamically changing digraphs. Finally, we give an example to validate the correctness of our obtained results.
Additional details
Identifiers
Publishing Information
- Journal Title
- International Journal of Control, Automation and Systems
- Journal Volume
- 16
- Journal Issue
- 2
- Journal Page Range
- p. 550-558
- ISSN
- 1598-6446
INIS
- Country of Publication
- Korea, Republic of
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 50019714
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING; S46: INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND TECHNOLOGY;
- Descriptors DEI
- COMMUNICATIONS; DIAGRAMS; GRAPH THEORY; MATRICES
- Descriptors DEC
- INFORMATION; MATHEMATICS
Optional Information
- Copyright
- Copyright (c) 2018 Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag GmbH Germany, part of Springer Nature