A Robust Polytopic Approach for State-Dependent Sampling

International audienceThis work aims at decreasing the number of sampling instants in state feedback control for perturbed linear time invariant systems. The approach is based on linear matrix inequalities obtained thanks to Lyapunov-Razumikhin stability conditions and convexification arguments that guarantee the exponential stability for a chosen decay-rate. First, the method enables to perform a robust stability analysis regarding time-varying sampling and to maximize a lower-bound estimate of the maximal allowable sampling interval, by computing the adequate Lyapunov-Razumikhin function. Then, it makes it possible to design a state-dependent sampling control scheme that enlarges even further the maximal allowable sampling intervals

Robust constrained model predictive control based on parameter-dependent Lyapunov functions

The problem of robust constrained model predictive control (MPC) of systems with polytopic uncertainties is considered in this paper. New sufficient conditions for the existence of parameter-dependent Lyapunov functions are proposed in terms of linear matrix inequalities (LMIs), which will reduce the conservativeness resulting from using a single Lyapunov function. At each sampling instant, the corresponding parameter-dependent Lyapunov function is an upper bound for a worst-case objective function, which can be minimized using the LMI convex optimization approach. Based on the solution of optimization at each sampling instant, the corresponding state feedback controller is designed, which can guarantee that the resulting closed-loop system is robustly asymptotically stable. In addition, the feedback controller will meet the specifications for systems with input or output constraints, for all admissible time-varying parameter uncertainties. Numerical examples are presented to demonstrate the effectiveness of the proposed techniques

Stochastic model predictive control for constrained networked control systems with random time delay

In this paper the continuous time stochastic constrained optimal control problem is formulated for the class of networked control systems assuming that time delays follow a discrete-time, finite Markov chain . Polytopic overapproximations of the system's trajectories are employed to produce a polyhedral inner approximation of the non-convex constraint set resulting from imposing the constraints in continuous time. The problem is cast in a Markov jump linear systems (MJLS) framework and a stochastic MPC controller is calculated explicitly, oine, coupling dynamic programming with parametric piecewise quadratic (PWQ) optimization. The calculated control law leads to stochastic stability of the closed loop system, in the mean square sense and respects the state and input constraints in continuous time

Networked PID control design : a pseudo-probabilistic robust approach

Networked Control Systems (NCS) are feedback/feed-forward control systems where control components (sensors, actuators and controllers) are distributed across a common communication network. In NCS, there exist network-induced random delays in each channel. This paper proposes a method to compensate the effects of these delays for the design and tuning of PID controllers. The control design is formulated as a constrained optimization problem and the controller stability and robustness criteria are incorporated as design constraints. The design is based on a polytopic description of the system using a Poisson pdf distribution of the delay. Simulation results are presented to demonstrate the performance of the proposed method

Robust H-infinity finite-horizon control for a class of stochastic nonlinear time-varying systems subject to sensor and actuator saturations

Copyright [2010] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This technical note addresses the robust H∞ finite-horizon output feedback control problem for a class of uncertain discrete stochastic nonlinear time-varying systems with both sensor and actuator saturations. In the system under investigation, all the system parameters are allowed to be time-varying, the parameter uncertainties are assumed to be of the polytopic type, and the stochastic nonlinearities are described by statistical means which can cover several classes of well-studied nonlinearities. The purpose of the problem addressed is to design an output feedback controller, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the nonlinear stochastic polytopic system in the presence of saturated sensor and actuator outputs. Sufficient conditions are first established for the robust H∞ performance through intensive stochastic analysis, and then a recursive linear matrix inequality (RLMI) approach is employed to design the desired output feedback controller achieving the prescribed H∞ disturbance rejection level. Simulation results demonstrate the effectiveness of the developed controller design scheme.This work was supported under Australian Research Council’s Discovery Projects funding scheme (project DP0880494) and by the German Science Foundation (DFG) within the priority programme 1305: Control Theory of Digitally Networked Dynamical Systems. Recommended by Associate Editor H. Ito

Safe Multi-Agent Interaction through Robust Control Barrier Functions with Learned Uncertainties

Robots operating in real world settings must navigate and maintain safety while interacting with many heterogeneous agents and obstacles. Multi-Agent Control Barrier Functions (CBF) have emerged as a computationally efficient tool to guarantee safety in multi-agent environments, but they assume perfect knowledge of both the robot dynamics and other agents' dynamics. While knowledge of the robot's dynamics might be reasonably well known, the heterogeneity of agents in real-world environments means there will always be considerable uncertainty in our prediction of other agents' dynamics. This work aims to learn high-confidence bounds for these dynamic uncertainties using Matrix-Variate Gaussian Process models, and incorporates them into a robust multi-agent CBF framework. We transform the resulting min-max robust CBF into a quadratic program, which can be efficiently solved in real time. We verify via simulation results that the nominal multi-agent CBF is often violated during agent interactions, whereas our robust formulation maintains safety with a much higher probability and adapts to learned uncertainties