Skip to content
naulon
Not checkedNot checked for notices yet.

Optimal tuning procedure for FOPID controller of integrated industrial processes with deadtime

R. Anuja, T.S. Sivarani, M. Germin Nisha

Bulletin of the Polish Academy of Sciences: Technical Sciences · 2022

doi:10.24425/bpasts.2021.139954 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Industrial processes such as batch distillation columns, supply chain, level control etc. integrate dead times in the wake of the transportation times associated with energy, mass and information. The dead time, the cause for the rise in loop variability, also results from the process time and accumulation of time lags. These delays make the system control poor in its asymptotic stability, i.e. its lack of self-regulating savvy. The haste of the controller’s reaction to disturbances and congruence with the design specifications are largely influenced by the dead time; hence it exhorts a heed. This article is aimed at answering the following question: “How can a fractional order proportional integral derivative controller (FOPIDC) be tuned to become a perfect dead time compensator apposite to the dead time integrated industrial process?” The traditional feedback controllers and their tuning methods do not offer adequate resiliency for the controller to combat out the dead time. The whale optimization algorithm (WOA), which is a nascent (2016 developed) swarm-based meta-heuristic algorithm impersonating the hunting maneuver of a humpback whale, is employed in this paper for tuning the FOPIDC. A comprehensive study is performed and the design is corroborated in the MATLAB/Simulink platform using the FOMCON toolbox. The triumph of the WOA tuning is demonstrated through the critical result comparison of WOA tuning with Bat and particle swarm optimization (PSO) algorithm-based tuning methods. Bode plot based stability analysis and the time domain specification based transient analysis are the main study methodologies used.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.