×

A gradient flow approach to the robust pole-placement problem. (English) Zbl 0824.93027

Summary: The paper provides a computational procedure for a type of robust pole- placement problem. By exploiting the differentiability of the objective function based on the Frobenius norm condition number, the minimization problem is formulated in terms of a gradient flow to which standard ODE numerical routines can be applied. It is shown that a minimum point exists for the objective function. The algorithm is efficient and faces no singularity problem with the resulting eigenvector matrix. A numerical example is used to illustrate the technique and comparison with other methods is made.

MSC:

93B55 Pole and zero placement problems
93B40 Computational methods in systems theory (MSC2010)
93C05 Linear systems in control theory
93B35 Sensitivity (robustness)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] and , State Variable Methods in Automatic Control, John Wiley, New York, 1988.
[2] Kautsky, Int. J. Control 41 pp 1129– (1985)
[3] Jiang, IEE Proc. D. 138 pp 172– (1991) · Zbl 0743.93041
[4] Introduction to Matrix Computations, Academic Press, New York, 1973. · Zbl 0302.65021
[5] and , Matrix Analysis, Cambridge University Press, New York, 1985. · Zbl 0576.15001
[6] Byers, Int. J. Control 49 pp 97– (1989)
[7] ’Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems’, Proc. 27th CDC, 1988, pp. 799–803.
[8] Perkins, Sys. & Contr. Lett 14 pp 369– (1990)
[9] Helmke, Sys. & Contr. Lett 16 pp 159– (1991)
[10] Bhattacharyya, Sys. & Contr. Lett. 1 pp 261– (1982)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.