Rate-Limited Stabilization for Network Control Systems

In this paper, we extend results from packet-based control theory, and present sufficient conditions on the rate of a packet network to guarantee asymptotic stability of unstable discrete LTI system, with less inputs than states. Two types of network control systems are considered in the absence of communication delays, then for one of the two types, the case of a constant time delay is discussed. Examples and simulations are provided to demonstrate the results

Data Rates Conditions for Network Control System Stabilization

In this paper we present sufficient conditions on the rate of a packet network to guarantee asymptotic stability of unstable discrete LTI system with linear state feedback control. Two types of network control systems are considered in the absence of communication delays. For one type we consider the case where we have invertible B matrix and the case where this does not occurred. Examples and simulations are provided to demonstrate the results

Packetized Predictive Control for Rate-Limited Networks via Sparse Representation

We study a networked control architecture for linear time-invariant plants in which an unreliable data-rate limited network is placed between the controller and the plant input. The distinguishing aspect of the situation at hand is that an unreliable data-rate limited network is placed between controller and the plant input. To achieve robustness with respect to dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. In our formulation, we design sparse packets for rate-limited networks, by adopting an an ell-0 optimization, which can be effectively solved by an orthogonal matching pursuit method. Our formulation ensures asymptotic stability of the control loop in the presence of bounded packet dropouts. Simulation results indicate that the proposed controller provides sparse control packets, thereby giving bit-rate reductions for the case of memoryless scalar coding schemes when compared to the use of, more common, quadratic cost functions, as in linear quadratic (LQ) control.Comment: 9 pages, 7 figures. arXiv admin note: text overlap with arXiv:1307.824

Decentralized Event-Triggered Consensus of Linear Multi-agent Systems under Directed Graphs

An event-triggered control technique for consensus of multi-agent systems with general linear dynamics is presented. This paper extends previous work to consider agents that are connected using directed graphs. Additionally, the approach shown here provides asymptotic consensus with guaranteed positive inter-event time intervals. This event-triggered control method is also used in the case where communication delays are present. For the communication delay case we also show that the agents achieve consensus asymptotically and that, for every agent, the time intervals between consecutive transmissions is lower-bounded by a positive constant.Comment: 9 pages, 5 figures, A preliminary version of this manuscript has been submitted to the 2015 American Control Conferenc