Convex computation of the region of attraction of polynomial control systems
Publications associées (43)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
The objective of this dissertation is to develop data-driven frequency-domain methods for designing robust controllers through the use of convex optimization algorithms. Many of today's industrial processes are becoming more complex, and modeling accurate ...
Recently, a new data-driven method for robust control with H∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the p ...
Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...
Recently, a new data-driven method for robust control with H-infinity performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controller ...
The frequency-domain data of a multivariable system in different operating points is used to design a robust controller with respect to the measurement noise and multimodel uncertainty. The controller is fully parametrized in terms of matrix polynomial fun ...
Recently, a new data-driven method for robust control with H ∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the ...
This paper describes synthesis of controllers involving Quadratic Programming (QP) optimization problems for control of nonlinear systems. The QP structure allows an implementation of the controller as a piecewise affine function, pre-computed offline, whi ...
We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment. We address the problem of determining the routing of material between co ...
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...
We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinato ...