Premium
L ‐Step Reachability and Observability of Networked Control Systems with Bandwidth Limitations: Feasible Lower Bounds on Communication Periods
Author(s) -
Share Pasand Mohammad Mahdi,
Montazeri Mosen
Publication year - 2017
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.1476
Subject(s) - observability , reachability , eigenvalues and eigenvectors , control theory (sociology) , mathematics , bandwidth (computing) , invertible matrix , upper and lower bounds , observable , reset (finance) , control system , communications system , topology (electrical circuits) , computer science , control (management) , pure mathematics , mathematical analysis , algorithm , combinatorics , engineering , telecommunications , physics , quantum mechanics , artificial intelligence , financial economics , economics , electrical engineering
Conditions for l‐ step reachability and observability of a networked control system subject to bandwidth limitations are given. Short feasible lower bounds for a communication sequence period resulting in a l‐ step reachable (observable) networked control system are derived without assuming any condition on the plant eigenvalues/eigenvectors. Though larger than some previously reported results, the established lower bounds do not require additional constraints on system eigenvalues. The proposed results cover systems with bandwidths equal to or greater than unity. Some further remarks on short feasible lower bounds in the case of non‐invertible state matrices, the relation between admissibility of communication sequences and structural properties of the zero order hold system state space description, and the connection between observability in zero order hold and reset to zero cases are drawn as well. A numerical example is included for clarification and comparison.