Structural controllability and observability of linear systems over finite fields with applications to multi-agent systems
Date
2013Source
IEEE Transactions on Automatic ControlVolume
58Issue
1Pages
60-73Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We develop a graph-theoretic characterization of controllability and observability of linear systems over finite fields. Specifically, we show that a linear system will be structurally controllable and observable over a finite field if the graph of the system satisfies certain properties, and the size of the field is sufficiently large. We also provide graph-theoretic upper bounds on the controllability and observability indices for structured linear systems (over arbitrary fields). We then use our analysis to design nearest-neighbor rules for multi-agent systems where the state of each agent is constrained to lie in a finite set. We view the discrete states of each agent as elements of a finite field, and employ a linear iterative strategy whereby at each time-step, each agent updates its state to be a linear combination (over the finite field) of its own state and the states of its neighbors. Using our results on structural controllability and observability, we show how a set of leader agents can use this strategy to place all agents into any desired state (within the finite set), and how a set of sink agents can recover the set of initial values held by all of the agents. © 2012 IEEE.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Conference Object
Information structures of capacity achieving distribution for channels with memory and feedback
Kourtellaris, C. K.; Charalambous, Charalambos D. (Institute of Electrical and Electronics Engineers Inc., 2016)The information structures of the optimal channel input distributions P[0,n] t {PAi|Ai-1,Bi-1 : i = 0,1.,n}, which correspond to the extremum problem of feedback capacity equation are identified, for any class of channel ...
-
Article
Bounds on the number of markings consistent with label observations in petri nets
Ru, Y.; Hadjicostis, Christoforos N. (2009)In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
-
Article
Distributed function calculation and consensus using linear iterative strategies
Sundaram, S.; Hadjicostis, Christoforos N. (2008)Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node values. Our scheme utilizes a linear iteration ...