Recursive constant control policy algorithm for attainable regions analysis

Abstract

This paper proposes an automated technique for attainable regions using recursive constant control (RCC) policy algorithm. This approach uses iterative application of constant control policies to approximate the optimal state varying control policy. The theory of this technique followed from the pioneering work of Feinberg [Feinberg, M. & Hildebrandt, D. (1997). Optimal reactor design from a geometric viewpoint: I Universal properties of the attainable region. Chemical Engineering Science, 52(10), 1637–1665; Feinberg, M. (2000a). Optimal reactor design from a geometric viewpoint II: Critical sidestream reactors. Chemical Engineering Science, 55, 2455–3565; Feinberg, M. (2000b). Optimal reactor design from a geometric viewpoint III: Critical CFSTRs. Chemical Engineering Science, 55, 3553–2479] that optimal control policies that govern combinations of fundamental processes, outline the structure that give access to the final extreme points that form the boundary of the attainable region. In this work, the RCC algorithm is formulated to approximate these control policies from which candidate attainable region (AR)’s are generated. Case studies with three and four-dimensional candidate regions are used for illustrations and resulting structures are discussed.