In this paper we give a rank condition which guarantees the arbitrary pole assignability of a given system by dynamic compensators of degree at most q. By using this rank condition we establish a new strong sufficiency condition which ensures the arbitrary pole assignability of the generic system. Our proof also comes with a concrete numerical procedure to construct a particular compensator which assigns a given set of closed loop poles.
|Number of pages||6|
|Journal||Proceedings of the IEEE Conference on Decision and Control|
|State||Published - 1995|
|Event||Proceedings of the 1995 34th IEEE Conference on Decision and Control. Part 1 (of 4) - New Orleans, LA, USA|
Duration: Dec 13 1995 → Dec 15 1995