Optimal control structure selection for process systems

Abstract The problem of process structure driven distributed controller structure selection is addressed in this paper using graph–theoretical methods. The process structure is represented by a directed graph describing the variable structure of the lumped non-linear state space model of the process system. Weights can also be associated to the edges of the structure graph and a one-to-one correspondence can be made between a linearized state space model and the weighted digraph. Two types of distributed controller structures: the stabilizing and disturbance rejective ones are investigated. The optimal stabilizing structures minimize the coupling and the optimal disturbance rejective ones have minimal interaction defined in both of the unweighted and weighted cases. For single input single output stabilizing and disturbance rejective controllers the formulated optimal controller structure selection problem is shown to be solvable in polynomial time. Efficient algorithms for determining the optimal stabilizing controller structure are proposed, based on the algorithms solving the well known Maximum Weighted Matching problem. The concepts and methods are illustrated on a simple example and on the Tennessee Eastman benchmark problem.

[1]  Christodoulos A. Floudas,et al.  Analyzing the interaction of design and control—1. A multiobjective framework and application to binary distillation synthesis , 1994 .

[2]  M. L. Luyben,et al.  Analyzing the interaction of design and control—2. reactor-separator-recycle system , 1994 .

[3]  D. König Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[4]  L. T. Fan,et al.  Integrated synthesis of a process and its fault-tolerant control system , 1995 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  L. T. Fan,et al.  Graph-theoretic approach to process synthesis: Polynomial algorithm for maximal structure generation , 1993 .

[7]  J. W. van der Woude,et al.  On the structure at infinity of a structured system , 1991 .

[8]  Efstratios N. Pistikopoulos,et al.  Optimal design of dynamic systems under uncertainty , 1996 .

[9]  Katalin M. Hangos,et al.  Note on the effect of recycle on the dynamics of chemical process plants , 1995 .

[10]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[11]  P. Hall On Representatives of Subsets , 1935 .

[12]  L. T. Fan,et al.  A GRAPH-THEORETIC APPROACH TO INTEGRATED PROCESS AND CONTROL SYSTEM SYNTHESIS , 1994 .

[13]  Kazuo Murota,et al.  Disturbance Decoupling with Pole Placement for Structured Systems: A Graph-Theoretic Approach , 1995, SIAM J. Matrix Anal. Appl..

[14]  E. F. Vogel,et al.  A plant-wide industrial process control problem , 1993 .

[15]  Kurt Johannes Reinschke,et al.  Multivariable Control a Graph-theoretic Approach , 1988 .

[16]  Thomas Kailath,et al.  Linear Systems , 1980 .

[17]  J. D. Perkins,et al.  Selection of process control structure based on economics , 1994 .

[18]  Zsolt Tuza,et al.  Process Structure Driven Control Structure Selection , 1996 .

[19]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[20]  Richard D. Braatz,et al.  Screening plant designs and control structures for uncertain systems , 1994 .

[21]  Claudio Scali,et al.  Selection of Control Configurations for the Tennessee Eastman Benchmark , 1995 .

[22]  Zsolt Tuza,et al.  Computational aspects of graph theoretic methods in control , 1997 .