Robust Pole Placement of Systems with Polytopic Uncertainty Via Convex Optimization
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.
With cyber-physical systems opening to the outside world, security can no longer be considered a secondary issue. One of the key aspects in security of cyber-phyiscal systems is to deal with intrusions. In this paper, we highlight the several unique proper ...
A new method for robust fixed-order H∞ controller design for uncertain time-delay systems is presented. It is shown that the H∞ robust performance condition can be represented by a set of convex constraints with respect to the parameters of a linearly para ...
Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...
Energy efficiency is a major design issue in the context of Wireless Sensor Networks (WSN). If the acquired data is to be sent to a far-away base station, collaborative beamforming performed by the sensors may help to distribute the communication load amon ...
We study the design of sampling trajectories for stable sampling and the reconstruction of bandlimited spatial fields using mobile sensors. The spectrum is assumed to be a symmetric convex set. As a performance metric we use the path density of the set of ...
Exploiting recent regularity estimates for the Monge-Ampère equation, under some suitable assumptions on the initial data we prove global-in-time existence of Eulerian distributional solutions to the semigeostrophic equations in 3-dimensional convex domain ...
Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...
In this paper a new approach for fixed-structure H2 controller design in terms of solutions to a set of linear matrix inequalities are given. Both discrete- and continuous-time single-input single-output (SISO) time- invariant systems are considered. Then ...
We consider a family of elliptic equations introduced in the context of traffic congestion. They have the form del . (del F(del u)) = f where F is a convex function which vanishes inside some convex set and is elliptic outside. Under some natural assumptio ...
A new method for robust fixed-order H∞ controller design for uncertain time-delayed MIMO systems is presented. It is shown that the H∞ robust performance condition can be represented by a set of convex constraints with respect to the parameters of a linear ...
