Inclusion principle for dynamic graphs

Authors:
Xin-yu Ouyang;Xue-bo Chen
Affiliations:
School of Control Science and Engineering, Dalian University of Technology, Dalian Liaoning, China and School of Electronics and Information Engineering, Liaoning University of Science and Technol ...;School of Electronics and Information Engineering, Liaoning University of Science and Technology, Anshan Liaoning, China
Venue:
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
Year:
2011

Citing 2
Cited 1

Pair-wise decomposition and coordinated control of complex systems

Information Sciences: an International Journal
Decomposition and decentralized control of systems with multi-overlapping structure

Automatica (Journal of IFAC)

Connective stability analysis for a class of large-scale systems based on the inclusion principle

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the point of view of graph, complex systems can be described by using dynamic graphs. Thus, the correlative theory of dynamic graphs is introduced, and inclusion principle for dynamic graphs is provided. Based on the inclusion principle and permuted transformation, a decomposition method for dynamic graphs is proposed. By using the approach, the graph can be decomposed as a series of pair-wise subgraphs with desired recurrent reverse order in the expanded space of graph. These decoupling pair-wise subgraphs may be designed to have respective controllers or coordinators. It provides us a theoretic framework for decomposition of complex system, and is also convenient for the decentralized control or coordination of complex systems.