Generic properties and control of linear structured systems: a survey
By Jean-Michel Dion, Christian Commault, J. Woude. at - Automatisierungstechnik, 2003
531 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/55b0fdd34c43b2e54c0a22f0fb85997780109ee8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Florian Dörfler
- Francesco Bullo
- Fabio Pasqualetti
- Shreyas Sundaram
- S. V. N. Vishwanathan
- Christoforos N. Hadjicostis
- Antonio Bicchi
- Albert-László Barabási
Citations in the corpus
- Control Principles of Complex Networks (2015, background): “…from the fact that if a system is structurally controllable then it is controllable for almost all possible parameter realizations (Davison, 1977; Dion et al., 2003; Glover and Silverman, 1976; Hosoe and Matsumoto, 1979; Lin, 1974; Linnemann, 1986; Mayeda, 1981; Reinschke, 1988; Shields and…”
- Consensus Computation in Unreliable Networks: A System Theoretic Approach (2010, methodology): “In order to capture this modeling uncertainty, structured systems have been introduced and studied, e.g., see [23], [16], [24].”
- Distributed Autonomous Online Learning: Regrets and Intrinsic Privacy-Preserving Properties (2010, methodology): “According to [Dion et al., 2003], for almost any choice of A, the rank of the transfer matrix T (z) and TU ′(z) are rank(T (z)) = max.”
- Attack Detection and Identification in Cyber-Physical Systems (2013, background): “Finally, the matrix is structurally non-degenerate if the determinant for a generic realization of and , that is, holds in the whole parameter space of elements of and with exception of a low dimensional variety [24], [38].”
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks (2012, unknown): “Hence the zero set Zi of fi, Zi = {(A,C) ∈ Rn×n × Rp×n | fi(A,C) = 0} has (Lebesgue) measure zero in Rn×n × Rp×n [23].”
- Control Centrality and Hierarchical Structure in Complex Networks (2012, unknown): “[29,30,32,33].”
- Control-Theoretic Methods for Cyberphysical Security: Geometric Principles for Optimal Cross-Layer Resilient Control Systems (2015, background): “Theorem 3 shows that if the attack/state/output graph is sufficiently connected and the system initial state is Graph Theory and Generic Properties The graph-theoretic approach to the control of dynamical systems tries to express system properties based on the features of an associated graph [42], [”
- Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents (2011, methodology): “The following theorems from [33] and [37] characterize the generic number of invariant zeros of a structured system and the”