Global Optimization of H ∞ problems: Application to robust control synthesis under structural constraints
Résumé
In this paper, a new technique to compute a synthesis structured Robust Control Law is developed. This technique is based on global optimization methods using a Branch-and-Bound algorithm. The original problem is reformulated as a min/max problem with non-convex constraint. Our approach uses interval arithmetic to compute bounds and accelerate the convergence.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...