PARAMETER ESTIMATION OF VALVE STICTION USING ANT COLONY OPTIMIZATION
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff08c80b000000d48d010001000200
In this paper, a procedure for quantifying valve stiction in control loops based on ant colony optimization has been proposed. Pneumatic control valves are widely used in the process industry. The control valve contains non-linearities such as stiction, backlash, and deadband that in turn cause oscillations in the process output. Stiction is one of the long-standing problems and it is the most severe problem in the control valves. Thus the measurement data from an oscillating control loop can be used as a possible diagnostic signal to provide an estimate of the stiction magnitude. Quantification of control valve stiction is still a challenging issue. Prior to doing stiction detection and quantification, it is necessary to choose a suitable model structure to describe control-valve stiction. To understand the stiction phenomenon, the Stenman model is used. Ant Colony Optimization (ACO), an intelligent swarm algorithm, proves effective in various fields. The ACO algorithm is inspired from the natural trail following behaviour of ants. The parameters of the Stenman model are estimated using ant colony optimization, from the input-output data by minimizing the error between the actual stiction model output and the simulated stiction model output. Using ant colony optimization, Stenman model with known nonlinear structure and unknown parameters can be estimated.

Authors
S. Kalaivani1 , D. Karthiga2
Muthayammal Engineering College, India1 ,Annamalai University, India2, India

Keywords
Control Valve Stiction, Nonlinear System Identification, Stenman Model, Ant Colony Optimization
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000000
Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 2 , Issue: 4 , Pages: 371-376 )
Date of Publication :
July 2012
Page Views :
216
Full Text Views :

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.