𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple algorithm for the time-optimal control of chemical processes

✍ Scribed by John N. Beard Jr.; Frank R. Groves Jr.; Adrain E. Johnson Jr.


Publisher
American Institute of Chemical Engineers
Year
1974
Tongue
English
Weight
668 KB
Volume
20
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A simple algorithm for the time‐optimal control of chemical processes during setpoint changes, in processes which can be described by a second‐order lag plus dead time model, is described. Knowledge of the unsteady state model parameters is not required because the algorithm uses a dimensionless phase plane on which the switching curves are independent of system parameters for a given forcing function. The algorithm gives the parameters of a second‐order lag plus dead time model as a by product of the setpoint change. It is easily tuned and is relatively insensitive to changes in the process dynamics. The algorithm does not require a large computer or long computing times and has been implemented on both analog and digital computers in controlling computer simulated systems.


πŸ“œ SIMILAR VOLUMES


A Riccati-equation-based algorithm for c
✍ Joe Imae πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 2 views

In this paper we consider continuous-time unconstrained optimal control problems. We propose a computational method which is essentially based on the closed-loop solutions of the linear quadratic optimal control problems. In the proposed algorithm, Riccati differential equations play an important ro

A Simple Optimal Parallel Algorithm for
✍ S.T. Peng; W.T. Lo πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin