Abstract
By the use of a simple predictor for dead time compensation, we show that an explicit pole-assignment algorithm can become or practical importance for processes with relatively large time delays. With the omission of the delay term in the closed-loop characteristic polynomial, solution of the pole-assignment control algorithm becomes computationally more efficient. The closed-loop system with an adaptive pole-assignment algorithm and a dead time compensation scheme is shown to be globally stable. The stability analysis is applicable to both minimum-phase and non-minimum-phase systems. For a particular class of processes, it is shown that the pole-assignment algorithm can take the form of a velocity-type, three-term, adaptive PID controller.
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.
