» Download Article

Authors
Shah, Gaurang; Volker, Marten; Sonntag, Christian; Engell, Sebastian

Identifier
10.3182/20080706-5-KR-1001.01175

Index Terms
Analysis of reliability and safety; Process control applications; Design and control

Abstract
In industrial practice, extensive simulations are performed in order to analyse the safety and the correct operation of controlled chemical processes. One aspect of verifying the safe operation is to prove that the states of the system stay within a safe region for a certain set of inputs or disturbances which is the main theme of this paper. Recently, a rigorous method for this type of verification problem has been proposed which makes use of Barrier Certificates for verifying whether an undesired set of states can be reached. If the system dynamics can be described in polynomial form, the safety of the system can be proven algorithmically. The determination of a barrier certificate is a sum-of-squares (SOS) problem which can further be transformed into a non-convex Bilinear Matrix Inequality (BMI) problem. This paper deals with proving the safety of a Continuously Stirred Tank Reactor (CSTR), a non-linear system, using barrier certificates. Uncertainties are represented by a bounded disturbance acting on the system. Safety is explicitly proven for a convex set of initial conditions and a non-convex unbounded unsafe set. Two situations are considered, the uncontrolled plant and the closed-loop system with a state-feedback controller. For the solution of the BMI problem, three different numerical approaches are compared. It turned out that solving the non-convex BMI problem directly is more efficient than solving it using the convex iterative approach.

References

REFERENCES

S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan.
Linear Matrix Inequalities in System and Control The-
ory. SIAM, Philadelphia, PA, 1994.

H. K. Khalil. Nonlinear Systems. Prentice-Hall, Inc.,
Upper Saddle River, NJ, second edition, 1996.

K. U. Klatt and S. Engell. Gain-scheduling trajectory
control of a continuous stirred tank reactor. Computers
& Chem. Engg., 22(4-5):491�502, 1998.

J. B. Lasserre. Global optimization with polynomials and
the problem of moments. SIAM Journal on Optimiza-
tion, 11(3):796�817, 2001.

Johan L�fberg. YALMIP: a toolbox for modelling and optimization
in MATLAB. IEEE Intl. Symp. on Computer
Aided Control Systems Design, pages 284�289, Sept.
2004. http://control.ee.ethz.ch/~joloef/yalmip.php.

Y. Nesterov and A. Nemirovsky. Interior-Point Poly-
nomial Algorithms in Convex Programming. SIAM,
Philadelphia, USA, 1994.

A. Papachristodoulou and S. Prajna. On the Construction
of Lyapunov Functions Using the Sum of Squares Decomposition.
In Proc. of the 41st IEEE CDC, volume 3,
pages 3482 � 3487, 2002.

A. Papachristodoulou and S. Prajna. Lecture Notes in
Control and Information Sciences: Positive Polynomi-
als in Control, volume 312, chapter Analysis of Nonpolynomial
Systems Using the Sum of Squares Decomposition.
Springer-Verlag, Berlin/Heidelberg, 2005.

P. A. Parrilo. Structured Semidefinite Programs and Semi-
algebraic Geometry methods in Robustness and Opti-
mization. PhD thesis, CalTech, Pasadena, CA, 2000.

S. Prajna and A. Jadbabaie. Hybrid Systems: Compu-
tation and Control, chapter Safety Verification of Hybrid
Systems Using Barrier Certificates, pages 477�492.
Springer-Verlag, 2004.

M.A. Savageau and E. O. Voit. Recasting Nonlinear
Differential-Equations as S-Systems - A Canonical Nonlinear
Form. Math. Biosciences, 87:83�115, 1987.

G. Stengle. A Nullstellensatz and a Positivstellensatz in
semialgebraic geometry. Mathematische Annalen, 207:
87�97, 1974.

M. Stingl. On the Solution of Nonlinear Semidefinite
Programs by Augmented Lagrangian Methods. PhD
thesis, Universit�t Erlangen-N�rnberg, Germany, 2005.

J. F. Sturm. Using SeDuMi 1.02, a MATLAB toolbox
for optimization over symmetric cones. Opti-
mization Methods and Software, 11(1-4):625�653, 1999.
http://sedumi.mcmaster.ca/.