TITLE

Design of Robust PID Controller Using Hybrid Algorithm for Reduced Order Interval System

AUTHOR(S)
Thirumalaimuthu, Babu; Natarajan, Pappa
PUB. DATE
August 2012
SOURCE
Asian Journal of Scientific Research;2012, Vol. 5 Issue 3, p108
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A System with parameter variation within bound creates interval in coefficients in the System polynomial and hence it is called as interval System. In this study, a model order reduction for linear interval System is attempted. A convergence technique is attempted to reduce the numerator polynomial. The denominator polynomial is reduced by using the methods such as retention of Markov parameter and time moments technique. A numerical approach is proposed to compute the reduced order interval model for a higher order linear time variant model. Also in this study, a novel technique using Particle Swarm assisted Bacterial Foraging Optimization (PSO-BFO) based hybrid algorithm is proposed to search the PID controller parameters such as Kp, Ki and Kd. The algorithm is to obtain the best possible PID parameters with Integral Squared Error (ISE) criterion minimization is as the objective function. Initially the controller parameters are obtained for reduced order model; then it is tested with the higher order model. A simulation is carried out to shows that the effectiveness of proposed model reduction algorithm and the controller performance. From the result it is observed that, the projected method provides enhanced performance for the interval System.
ACCESSION #
75899605

 

Related Articles

  • A recipe for Bayesian network driven stock assessment. Hammond, T. R. // Canadian Journal of Fisheries & Aquatic Sciences;Sep2004, Vol. 61 Issue 9, p1647 

    Markov Chain Monte Carlo (MCMC), the most widely used algorithm in Bayesian statistics, can fail to converge. Although convergence is tested by various diagnostics, these can only reveal failure, never success. To avoid these difficulties, this paper suggests a recipe for using Bayesian network...

  • Langevin-Type Models II: Self-Targeting Candidates for MCMC Algorithms. Stramer, O.; Tweedie, R. L. // Methodology & Computing in Applied Probability;Oct1999, Vol. 1 Issue 3, p307 

    The Metropolis-Hastings algorithm for estimating a distribution π is based on choosing a candidate Markov chain and then accepting or rejecting moves of the candidate to produce a chain known to have π as the invariant measure. The tradiiional methods use candidates essentially...

  • A Novel Convergence Accelerator for the LMS Adaptive Filter. Sheu, Jeng-Shin; Woo, Tai-Kuo; Wen, Jyh-Horng // Circuits, Systems & Signal Processing;Feb2012, Vol. 31 Issue 1, p283 

    Due to its ease of implementation, the least mean square (LMS) algorithm is one of the most well-known algorithms for mobile communication systems. However, the main limitation of this approach is its relatively slow convergence rate. This paper proposes a booster using the Markov chain concept...

  • Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. ROBERTS, G. O.; TWEEDIE, R. L. // Biometrika;1996, Vol. 83 Issue 1, p95 

    We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and Metropolis algorithms. For those based on random walk candidate distributions, we find sufficient conditions for moments and moment...

  • CONVERGENCE OF MARKOV CHAINS IN THE RELATIVE SUPREMUM NORM. Holden, Lars // Journal of Applied Probability;Dec2000, Vol. 37 Issue 4, p1074 

    Features a study which proved that the Doeblin condition implies convergence in the relative supremum norm for a general Markov chain. Use of the Doeblin condition to bound the eigenvalues of the transition density; Examples that used the Metropolis-Hastings algorithm; Discussion and conclusion.

  • Convergence of Periodical Evolutionary Computation. WU Sheng-Ping // Nature & Science;Sep2011, Vol. 9 Issue 9, p172 

    This article study the convergence of the Genetic Evolution Computation with the algorithm that can be described by discrete Markov Chain with constant transfer probabilities matrix, for example, the algorithm with the periodical mutations in crossing, and static strategy. They likely converge...

  • DNA motif alignment by evolving a population of Markov chains. Chengpeng Bi // BMC Bioinformatics;2009 Supplement 1, Vol. 10, Special section p1 

    Background: Deciphering cis-regulatory elements or de novo motif-finding in genomes still remains elusive although much algorithmic effort has been expended. The Markov chain Monte Carlo (MCMC) method such as Gibbs motif samplers has been widely employed to solve the de novo motif-finding...

  • Segmental Hidden Markov Models with Random Effects for Waveform Modeling. Seyoung Kim; Smyth, Padhraic; Roweis, Sam // Journal of Machine Learning Research;6/1/2006, Vol. 7 Issue 6, p945 

    This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize waveform shape and shape variation is captured by adding random effects to the segmental model. The resulting...

  • QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS. ANDRIEU, CHRISTOPHE; FORT, GERSENDE; VIHOLA, MATTI // Journal of Applied Probability;Jun2015, Vol. 52 Issue 2, p391 

    We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics