Abstract

AbstractThe proposed on‐line adaptive optimization technique incorporates a priori knowledge in the form of approximate steady‐state models. The steady‐state geometric characteristics of the model are periodically recalculated using a Hammerstein system and recursive least squares. The algorithm is self‐tuning in the sense that it converges to the optimal performance provided that a matching condition is satisfied and that the data are persistently exited. Simulation and experimental studies performed on a continuous fermentation system have been conducted to illustrate the performance of the optimization algorithm and demonstrate the viability of adaptive extremum control.

Full Text
Paper version not known

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 call

Disclaimer: 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.