By Topic

Improved bounds computation for probabilistic μ

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 $13
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

1 Author(s)
Xiaoyun Zhu ; Control & Dynamical Syst., California Inst. of Technol., Pasadena, CA, USA

Probabilistic μ is a direct extension of the structured singular value μ from the worst-case robustness analysis to the probabilistic framework. Its computation involves approximating the level surface of some performance function in the parameter space, which is more complex than the worst-case μ computation. In particular, providing a sufficiently tight upper bound in the tail of the distribution is extremely difficult. The approach presented in this paper is a mixture of the linear cut and the branch and bound algorithms. It greatly improves the probabilistic μ upper bound on average, which is shown through numerical experiments. The tightness of the bounds can be tested by comparing the hard upper bounds with the soft bounds provided by Monte-Carlo simulations

Published in:

American Control Conference, 2000. Proceedings of the 2000  (Volume:6 )

Date of Conference:

2000