µ analysis with real parametric uncertainty
Abstract
The authors give a broad overview, from a LFT (linear fractional transformation) µ perspective, of some of the theoretical and practical issues associated with robustness in the presence of real parametric uncertainty, with a focus on computation. Recent results on the properties of µ in the mixed case are reviewed, including issues of NP completeness, continuity, computation of bounds, the equivalence of µ and its bounds, and some direct comparisons with Kharitonov-type analysis methods. In addition, some advances in the computational aspects of the problem, including a branch-and-bound algorithm, are briefly presented together with the mixed µ problem may have inherently combinatoric worst-case behavior, practical algorithms with modes computational requirements can be developed for problems of medium size (<100 parameters) that are of engineering interest.
Additional Information
© 1991 IEEE. We would like to acknowledge the help of several of our colleagues. Steve Boyd, Jim Demmel, Andy Packard, Pradeep Pandey, Jie Chen, Michael Fan, and Carl Nett provided us with preprints of their papers and/or copies of software, as well as valuable discussions about the issues in this paper. Bobby Bodenheimer assisted in the numerical experiments. This work was supported by ONR, NSF, NASA, and Rockwell International.Attached Files
Published - 00261579.pdf
Files
Name | Size | Download all |
---|---|---|
md5:2cc8596793b7b731e01d3b031898942c
|
545.7 kB | Preview Download |
Additional details
- Alternative title
- mu analysis with real parametric uncertainty
- Eprint ID
- 93928
- Resolver ID
- CaltechAUTHORS:20190318-131438205
- Office of Naval Research (ONR)
- NSF
- NASA
- Rockwell International
- Created
-
2019-03-18Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field