By Topic

Computing the controllability radius: a semi-definite programming approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
B. Dumitrescu ; Department of Automatic Control and Computers, `Politehnica¿ University of Bucharest, Spl. Independent¿ei 313, 060042 Bucharest, Romania Tampere International Center for Signal Processing, Tampere University of Technology, Tampere, Finland E-mail: ; B. C. Sicleru ; R. Stefan

A semi-definite programming (SDP) approach to compute the controllability radius is proposed in this paper. The initial nonconvex optimisation problem is transformed into the minimisation of the smallest eigenvalue of a bivariate real or trigonometric polynomial with matrix coefficients. A sum-of-squares relaxation leads to the SDP formulation. A similar technique is used for the computation of the stabilisability radius. The approach is extended to the computation of the worst-case controllability radius for systems that depend polynomially on a small number of parameters. Experimental results show that the proposed methods compete well with previous ones in a complexity/accuracy trade-off.

Published in:

IET Control Theory & Applications  (Volume:3 ,  Issue: 6 )