Abstract
A new algorithm is described for the assignment of closed loop poles in linear time invariant multivariable systems. The approach is similar to the well known dyadic pole placement methods, but does not usually result in a unity rank controller. The algorithm can be put into iterative form in the sense that open loop poles can be relocated or preserved so that by repeating the assignment process, all of the open loop poles can be reassigned. There are only very mild constraints on the destinations of the poles. The paper also shows how any unused degrees of freedom can be exploited to reduce the control effort needed to achieve the pole assignment. Results are given for both the state and the output feedback cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
