A Computational Geometry Approach to Simplicial Nyquist Maps in Robust Stability (1994)
Abstract:
In this paper we use combinatorial and computational geometry techniques to make the simplicial approximation theorem a computational, rather than conceptual, tool to check robust stability for systems that are not in Kharitonov's class. A simplicial program was developed with a O(n log n) time complexity, where n is the cardinality of the vertex set of points mapped to the complex plane, using the Nyquist map f . Keywords: Topology, computational geometry, simplicial approximation. 1. Introduction Robustness of stability is a crucial issue in robust control. In multivariable control theory, it is well known that the stable multivariable loop transmission L(jw) remains stable after closing the loop if and only if det(I + L(jw)) 6= 0; 8w 2 R, provided that the plot of det(I + L(jw)) does not encircle the origin 0 + j0. In order to check stability for all pertubations 4 2 D, where D is a topological space of structured uncertainties, we define the Nyquist map: f : D \Theta\Omega !...
Citations
| 6121 | Introduction to Algorithms – Cormen, Leiserson, et al. - 2001 |
| 250 | A sweepline algorithm for Voronoi diagrams – Fortune - 1987 |
| 42 | Asymptotic Stability of an Equilibrium Position of a Family of – Kharitonov - 1979 |
| 41 | Elementary concepts of topology – Alexandroff - 1961 |
| 13 | Homology theory: An introduction to algebraic topology – Hilton, Wylie - 1960 |
| 2 | Chih-Yung Cheng and Murilo G. Coutinho, A Survey of Simplicial Algorithms and Topology – Jonckheere - 1993 |
| 1 | Jonckheere and Chih-Yung Cheng, Robust Stability, Morse Theory and Singularity, 32nd CDC – Edmond - 1993 |

