Model reduction of discrete interval systems using genetic algorithms

Research output: Contribution to journalArticle

Abstract

In this paper, an evolutionary approach is proposed to derive a reduced-order model for discretetime interval systems based on resemblance of discrete sequence energy between the original and reduced systems. With the use of the recursive algebraic algorithm and interval arithmetic manipulations, the problem to identify boundaries of the uncertain coefficients of the reduced-order model can be formulated as an optimization problem, which is subsequently solved by a proposed genetic algorithm. To demonstrate the effectiveness of the proposed approach, system performance of the reduced-order discrete interval model is validated based on time responses in comparison to existing approaches. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which demands heavy calculation of the fitness function, a parallel computation scheme is also presented to accelerate the evolution process to derive the reduced-order model.

Original languageEnglish
Pages (from-to)2073-2080
Number of pages8
JournalWSEAS Transactions on Systems
Volume4
Issue number11
Publication statusPublished - 2005 Nov 1

Fingerprint

Genetic algorithms

Keywords

  • Discrete interval systems
  • Discrete sequence energy
  • Genetic algorithms
  • Model reduction
  • Parallel computation
  • Uncertain systems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

Model reduction of discrete interval systems using genetic algorithms. / Hsu, Chen Chien; Lu, Tsung Chi; Wang, Wei Yen.

In: WSEAS Transactions on Systems, Vol. 4, No. 11, 01.11.2005, p. 2073-2080.

Research output: Contribution to journalArticle

@article{a1e8e4b871d14bc39ed20522be69ea8f,
title = "Model reduction of discrete interval systems using genetic algorithms",
abstract = "In this paper, an evolutionary approach is proposed to derive a reduced-order model for discretetime interval systems based on resemblance of discrete sequence energy between the original and reduced systems. With the use of the recursive algebraic algorithm and interval arithmetic manipulations, the problem to identify boundaries of the uncertain coefficients of the reduced-order model can be formulated as an optimization problem, which is subsequently solved by a proposed genetic algorithm. To demonstrate the effectiveness of the proposed approach, system performance of the reduced-order discrete interval model is validated based on time responses in comparison to existing approaches. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which demands heavy calculation of the fitness function, a parallel computation scheme is also presented to accelerate the evolution process to derive the reduced-order model.",
keywords = "Discrete interval systems, Discrete sequence energy, Genetic algorithms, Model reduction, Parallel computation, Uncertain systems",
author = "Hsu, {Chen Chien} and Lu, {Tsung Chi} and Wang, {Wei Yen}",
year = "2005",
month = "11",
day = "1",
language = "English",
volume = "4",
pages = "2073--2080",
journal = "WSEAS Transactions on Systems",
issn = "1109-2777",
publisher = "World Scientific and Engineering Academy and Society",
number = "11",

}

TY - JOUR

T1 - Model reduction of discrete interval systems using genetic algorithms

AU - Hsu, Chen Chien

AU - Lu, Tsung Chi

AU - Wang, Wei Yen

PY - 2005/11/1

Y1 - 2005/11/1

N2 - In this paper, an evolutionary approach is proposed to derive a reduced-order model for discretetime interval systems based on resemblance of discrete sequence energy between the original and reduced systems. With the use of the recursive algebraic algorithm and interval arithmetic manipulations, the problem to identify boundaries of the uncertain coefficients of the reduced-order model can be formulated as an optimization problem, which is subsequently solved by a proposed genetic algorithm. To demonstrate the effectiveness of the proposed approach, system performance of the reduced-order discrete interval model is validated based on time responses in comparison to existing approaches. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which demands heavy calculation of the fitness function, a parallel computation scheme is also presented to accelerate the evolution process to derive the reduced-order model.

AB - In this paper, an evolutionary approach is proposed to derive a reduced-order model for discretetime interval systems based on resemblance of discrete sequence energy between the original and reduced systems. With the use of the recursive algebraic algorithm and interval arithmetic manipulations, the problem to identify boundaries of the uncertain coefficients of the reduced-order model can be formulated as an optimization problem, which is subsequently solved by a proposed genetic algorithm. To demonstrate the effectiveness of the proposed approach, system performance of the reduced-order discrete interval model is validated based on time responses in comparison to existing approaches. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which demands heavy calculation of the fitness function, a parallel computation scheme is also presented to accelerate the evolution process to derive the reduced-order model.

KW - Discrete interval systems

KW - Discrete sequence energy

KW - Genetic algorithms

KW - Model reduction

KW - Parallel computation

KW - Uncertain systems

UR - http://www.scopus.com/inward/record.url?scp=33645304349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645304349&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33645304349

VL - 4

SP - 2073

EP - 2080

JO - WSEAS Transactions on Systems

JF - WSEAS Transactions on Systems

SN - 1109-2777

IS - 11

ER -