Reduced Order H∞ Synthesis using a Particle Swarm Optimization Method

Abstract: H∞ controller synthesis is a well known design method for which efficient dedicated methods have been developed. However, such methods compute a full order controller which has often to be reduced to be implemented. Indeed, the reduced order H∞ synthesis is a non convex optimization problem due to rank constraints. In this paper, a particle swarm optimization method is used to solve such a problem. Numerical results show that the computed controller has a lower H∞ norm than the controller computed from a classical Hankel reduction of the full order H∞ controller.

[1]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[2]  L. Ghaoui,et al.  A cone complementarity linearization algorithm for static output-feedback and related problems , 1996, Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design.

[3]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[4]  K. Glover,et al.  State-space formulae for all stabilizing controllers that satisfy and H ∞ norm bound and relations to risk sensitivity , 1988 .

[5]  P. Gahinet,et al.  A linear matrix inequality approach to H∞ control , 1994 .