Abstract
We present a methodology to address the general multiobjective (GMO) control problem involving the ℓ1 norm, H2 norm, H∞ norm and time-domain constraint (TDC). We show that the problem resulted from imposing a regularizing condition always admits an optimal solution, and suboptimal solutions with performance arbitrarily close to the optimal cost can be obtained by constructing two sequences of finite dimensional convex optimization problems whose objective values converge to the optimum from below and above. A numerical example is presented to illustrate the effectiveness of the proposed methodology.
Original language | English (US) |
---|---|
Pages (from-to) | 2730-2735 |
Number of pages | 6 |
Journal | Proceedings of the American Control Conference |
Volume | 4 |
DOIs | |
State | Published - 2001 |
Keywords
- Inequality (LMI)
- Linear matrix
- Multiobjective control
- Robust optimal control
- Semidefinite programming (SDP)
- Time-domain constraint
- ℓ/H/H