Abstract
This chapter contains the control algorithms for Finite Spectrum Assignment (FSA). The development of four algorithms corresponding to varying degrees of system complexity are presented. The first, which is the basic one due to Ichikawa (1985), is derived under the assumption that the process contains distinct poles. The second algorithm relaxes this assumption and extends the basic FSA algorithm to systems with multiple poles. Both algorithms deal with single-variable processes. The FSA treatment on multivariable processes is provided in the third algorithm. Finally, the last algorithm provides asymptotic tracking and regulation of stable FSA systems operating under modelling errors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this chapter
Cite this chapter
Wang, QG., Lee, T.H., Tan, K.K. (1999). FSA Algorithms Development. In: Finite-Spectrum Assignment for Time-Delay Systems. Lecture Notes in Control and Information Sciences, vol 239. Springer, London. https://doi.org/10.1007/978-1-84628-531-8_2
Download citation
DOI: https://doi.org/10.1007/978-1-84628-531-8_2
Publisher Name: Springer, London
Print ISBN: 978-1-85233-065-1
Online ISBN: 978-1-84628-531-8
eBook Packages: Springer Book Archive