Abstract-We present an algorithm for controlling and scheduling multiple linear time-invariant processes on a shared bandwidth limited communication network using adaptive sampling intervals. The controller is centralized and computes at every sampling instant not only the new control command for a process, but also decides the time interval to wait until taking the next sample. The approach relies on model predictive control ideas, where the cost function penalizes the state and control effort as well as the time interval until the next sample is taken. The latter is introduced in order to generate an adaptive sampling scheme for the overall system such that the sampling time increases as the norm of the system state goes to zero. The paper presents a method for synthesizing such a predictive controller and gives explicit sufficient conditions for when it is stabilizing. Further explicit conditions are given which guarantee conflict free transmissions on the network. It is shown that the optimization problem may be solved off-line and that the controller can be implemented as a lookup table of state feedback gains. Simulation studies which compare the proposed algorithm to periodic sampling illustrate potential performance gains.

No abstract

This paper studies fixed rate vector quantisation for noisy networked control systems (NCSs) with correlated packet dropouts. In particular, a discrete-time linear time invariant system is to be controlled over an error-prone digital channel. The controller uses (quantized) packetized predictive control to reduce the impact of packet losses. The proposed vector quantizer is based on sparse regression codes (SPARC), which have recently been shown to be efficient in open-loop systems when coding white Gaussian sources. The dictionaries in existing design of SPARCs consist of independent and identically distributed (i.i.d.) Gaussian entries. However, we show that a significant gain can be achieved by using Gaussian dictionaries that are shaped according to the second-order statistics of the NCS in question. Furthermore, to avoid training of the dictionaries, we provide closed-form expressions for the required second-order statistics in the absence of quantization.

In this paper, we consider the predictive control problem of designing receding horizon controllers for networked linear systems subject to random packet loss in the controller to actuator link. The packet dropouts are temporarily correlated in the sense that they obey a Markovian transition model. Our design task is to solve the optimal controller that minimizes a given receding horizon cost function, using the available packet loss history. Due to the correlated nature of the packet loss, standard linear quadratic regulator methods do not apply. We first present the optimal control law by considering the correlations. This controller turns out to depend on the packet loss history and would typically require a large lookup table for implementation when the Markovian order is high. To address this issue, we present and compare several suboptimal design approaches to reduce the number of control laws. KEYWORDSjump linear systems, networked control, optimal control, packet dropouts, predictive control, stochastic systems 5078

No abstract