dc.contributor.author | Sundaram, S. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Sundaram, S. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:48:22Z | |
dc.date.available | 2019-04-08T07:48:22Z | |
dc.date.issued | 2013 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/44907 | |
dc.description.abstract | 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. | en |
dc.source | IEEE Transactions on Automatic Control | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871735046&doi=10.1109%2fTAC.2012.2204155&partnerID=40&md5=b6b7c2a7c9a04749093a1ac5d3636dd4 | |
dc.subject | Multi agent systems | en |
dc.subject | Distributed computer systems | en |
dc.subject | Iterative methods | en |
dc.subject | Set theory | en |
dc.subject | Graph theory | en |
dc.subject | Observability | en |
dc.subject | Linear systems | en |
dc.subject | Finite element method | en |
dc.subject | Structural observability | en |
dc.subject | Controllability | en |
dc.subject | Distributed consensus | en |
dc.subject | Distributed function | en |
dc.subject | Distributed function calculation | en |
dc.subject | Finite fields | en |
dc.subject | Linear system theory | en |
dc.subject | Multi agent system (mas) | en |
dc.subject | Multi-agent systems | en |
dc.subject | Quantized control | en |
dc.subject | Structural controllability | en |
dc.subject | Structured system theory | en |
dc.subject | Structured systems | en |
dc.subject | System theory | en |
dc.title | Structural controllability and observability of linear systems over finite fields with applications to multi-agent systems | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TAC.2012.2204155 | |
dc.description.volume | 58 | |
dc.description.issue | 1 | |
dc.description.startingpage | 60 | |
dc.description.endingpage | 73 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | IEEE Trans Autom Control | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |