18 June 2020 in IEEE Control Systems Letters
This letter considers the problem of designing state feedback data-driven controllers for nonlinear continuous-time systems. Specifically, we consider a scenario where the unknown dynamics can be parametrized in terms of known basis functions and the available measurements are corrupted by unknown-but-bounded noise. The goal is to use this noisy experimental data to directly design a rational state-feedback control law guaranteed to stabilize all plants compatible with the available information. The main result of this letter shows that, by using Rantzer's Dual Lyapunov approach, combined with elements from convex analysis, the problem can be recast as an optimization over positive polynomials, which can be relaxed to a semi-definite program through the use of Sum-of-Squares and semi-algebraic optimization arguments. Three academic examples are considered to illustrate the effectiveness of the proposed method.
6 December 2022 in IEEE Control Systems Letters
This letter synthesizes a gain-scheduled controller to stabilize all possible Linear Parameter-Varying (LPV) plants that are consistent with measured input/state data records. Inspired by prior work in data informativity and LTI stabilization, a set of Quadratic Matrix Inequalities is developed to represent the noise set, the class of consistent LPV plants, and the class of stabilizable plants. The bilinearity between unknown plants and ‘for all’ parameters is avoided by vertex enumeration of the parameter set. Effectiveness and computational tractability of this method is demonstrated on example systems.
27 April 2018 in IEEE Transactions on Automatic Control
This paper considers the problem of synthesizing output feedback controllers subject to sparsity constraints. This problem is known to be generically NP-hard, unless the plant satisfies the quadratic invariance property. Our main results show that, even if this property does not hold, tractable convex relaxations with optimality certificates can be obtained by recasting the problem into a polynomial optimization through the use of polyhedral Lyapunov functions. Combining these ideas with rank minimization tools leads to a computationally attractive algorithm. As an alternative, we present a second relaxation, with lower computational complexity, based on finding the best sparse estimate of a desired control action. These results are illustrated with several examples.
17 December 2020 in IEEE Control Systems Letters
Recent advances in control, coupled with an exponential growth in data gathering capabilities, have made feasible a wide range of applications that can profoundly impact society. Yet, achieving this vision requires addressing the challenge of extracting control relevant information from large amounts of data, a problem that has proven to be surprisingly difficult. While modern machine learning techniques can handle very large data sets, most control oriented learning algorithms struggle with a few thousand points. The goal of this letter is to point out the reason why dynamic data is challenging and to indicate strategies to overcome this challenge. The main message is twofold (i) computational complexity in control oriented learning is driven both by system order and the presence of uncertainty, rather than the dimension of the data, and (ii) exploiting the underlying sparsity provides a way around the “curse of dimensionality”.
25 December 2020 in IEEE Control Systems Letters
Peak Estimation aims to find the maximum value of a state function achieved by a dynamical system. This problem has been previously cast as a convex infinite-dimensional linear program on occupation measures, which can be approximately solved by a converging hierarchy of moment relaxations. In this letter, we present an algorithm to approximate optimal trajectories if the solutions to these relaxations satisfy rank constraints. We also extend peak estimation to maximin and safety analysis problems, providing a certificate that trajectories are bounded away from an unsafe set.