2012
DOI: 10.1109/mcs.2012.2195411
|View full text |Cite
|
Sign up to set email alerts
|

Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?

Abstract: As networked dynamical systems appear around us at an increasing rate, questions concerning how to manage and control such systems are becoming more important. Examples include multi-agent robotics, distributed sensor networks, interconnected manufacturing chains, and data networks. In response to this growth, a significant body of work has emerged focusing on how to organize such networks in order to facilitate their control and make them amenable to human interactions. In this article, we summarize these act… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 149 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…The more general problem of obtaining all EEPs for a graph appears to be computationally more challenging 25,53 . However, there exist efficient algorithms to compute EEPs centered around a node 27,54 , which can be used to characterize the dynamical influence of particular nodes on the global dynamics of the network 26,27,29 .…”
Section: Discussionmentioning
confidence: 99%
“…The more general problem of obtaining all EEPs for a graph appears to be computationally more challenging 25,53 . However, there exist efficient algorithms to compute EEPs centered around a node 27,54 , which can be used to characterize the dynamical influence of particular nodes on the global dynamics of the network 26,27,29 .…”
Section: Discussionmentioning
confidence: 99%
“…The gains of the controller and the observer can then be calculated, according to Equations (24) and (40). The gains are tabulated in Table 2.…”
Section: Control Parameter Derivationsmentioning
confidence: 99%
“…A graph-theoretical characterization of controllability and observability for a leader-follower network is developed over the finite fields so that the quantized agents can be put into any desired configuration by a set of leader agents [23]. The relationship between the network topology and the controllability of the network containing a single leader is discussed, and some key results in this area are summarized [24]. The controllability and observability of a network with hybrid linear agents are investigated, and some necessary and sufficient conditions are derived from the Popov-Belevitch-Hautus (PBH) test [25].…”
Section: Introductionmentioning
confidence: 99%
“…Widely studied topics in networked systems have been the problems of consensus and synchronization, see [19,20,27,30]. Other important subjects in the theory of networked systems are flocking, formation control, sensor placement, and controllability of networks, see, e.g., [8,9,11,12,24,29,34].…”
Section: Introductionmentioning
confidence: 99%