Search

A novel moving horizon control strategy for input-saturated nonlinear polynomial systems is proposed. The control strategy makes use of the so called sum-of-squares (SOS) decomposition, i.e. a convexification procedure able to give sufficient conditions on the positiveness of polynomials. The complexity of SOS based numerical methods is polynomial in the problem size and, as a consequence, computationally attractive. SOS programming is used here to derive an ˵off-line″ model predictive control (MPC) scheme and analyze in depth its relevant properties. The main contribution here is to show that such an approach may lead to less conservative MPC strategies than most existing methods based on global linearization approaches. An illustrative example is provided to show the effectiveness of the proposed SOS-based algorithm. [ABSTRACT FROM AUTHOR]

This work concerns discrete-time Linear Quadratic Gaussian (LQG) optimal control of a remote plant that communicates with the control unit by means of a packets dropping channel. Namely, the output measurements are sent to the control unit through an unreliable network and the actions decided by the control unit are sent to the plant actuator via the same network. Sensor and control packets may be randomly lost according to a Bernoulli process. In this work we focus on the importance of acknowledgments in the communication between the control unit and the actuators. In the literature two extreme cases have been considered: either guaranteed acknowledgment or complete lack of it. Although very common in practice, the case where the acknowledgment packets can be lost has not been dealt with a sufficient level of detail. In this work we focus on such a case by assuming that also the acknowledgment packets can be lost according to a Bernoulli process. We can show how the partial loss of acknowledgements yields a non classical information pattern [1], making the optimal control law a nonlinear function of the information set. For the special case each observation packet contains the complete state information, we can prove linearity of the optimal controller. Furthermore, we can compute the control law in closed form and show that the stability range increases monotonically with the arrival rate of the acknowledgement packets. [ABSTRACT FROM AUTHOR]