Convex computation of the region of attraction of polynomial control systems
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operator have to be performed on Q to obtain a polyhedron conta ...
We present a novel approach to the reconstruction of depth from light field data. Our method uses dictionary representations and group sparsity constraints to derive a convex formulation. Although our solution results in an increase of the problem dimensio ...
This paper proposes a method for solving robust optimal control problems with modulated uncertainty sets. We consider constrained uncertain linear systems and interpret the uncertainty sets as “robustness margins” or “reserve capacities”. In particular, gi ...
Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional rela ...
We present a novel approach to the reconstruction of depth from light field data. Our method uses dictionary representations and group sparsity constraints to derive a convex formulation. Although our solution results in an increase of the problem dimensio ...
This work presents a method to obtain inner and outer approximations of the region of attraction of a given target set as well as an admissible controller generating the inner approximation. The method is applicable to constrained polynomial dynamical syst ...
We address the long-standing problem of computing the region of attraction (ROA) of a target set (typically a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We ...
Institute of Electrical and Electronics Engineers2014
This paper presents an approach for fixed-order Linear Parameter Varying (LPV) controller design with application to a 2 Degree-of-Freedom (2DOF) gyroscope experimental setup. Inner convex approximation of the non-convex set of all stabilizing fixed-order ...
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
