Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms

Chen-Chien James Hsu, Tsung Chi Lu

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In this paper, a genetic algorithm-based approach is proposed to determine a desired sampling-time range which guarantees minimum phase behaviour for the sampled-data system of an interval plant preceded by a zero-order hold (ZOH). Based on a worst-case analysis, the identification problem of the sampling-time range is first formulated as an optimization problem, which is subsequently solved under a GA-based framework incorporating two genetic algorithms. The first genetic algorithm searches both the uncertain plant parameters and sampling time to dynamically reduce the search range for locating the desired sampling-time boundaries based on verification results from the second genetic algorithm. As a result, the desired sampling-time range ensuring minimum phase behaviour of the sampled-data interval system can be evolutionarily obtained. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which requires undertaking a large number of evolution cycles, parallel computation for the proposed genetic algorithm is therefore proposed to accelerate the derivation process. Illustrated examples in this paper have demonstrated that the proposed GA-based approach is capable of accurately locating the boundaries of the desired sampling-time range.

Original languageEnglish
Pages (from-to)1670-1679
Number of pages10
JournalApplied Soft Computing Journal
Volume8
Issue number4
DOIs
Publication statusPublished - 2008 Sep 1

Fingerprint

Genetic algorithms
Sampling
Phase behavior

Keywords

  • Discretization
  • Genetic algorithms
  • Interval plant
  • Minimum-phase
  • Parallel computation
  • Sampled-data systems
  • Uncertain systems

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Artificial Intelligence

Cite this

Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms. / Hsu, Chen-Chien James; Lu, Tsung Chi.

In: Applied Soft Computing Journal, Vol. 8, No. 4, 01.09.2008, p. 1670-1679.

Research output: Contribution to journalArticle

@article{d4a90345d8f24b22b9df16e91e917e64,
title = "Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms",
abstract = "In this paper, a genetic algorithm-based approach is proposed to determine a desired sampling-time range which guarantees minimum phase behaviour for the sampled-data system of an interval plant preceded by a zero-order hold (ZOH). Based on a worst-case analysis, the identification problem of the sampling-time range is first formulated as an optimization problem, which is subsequently solved under a GA-based framework incorporating two genetic algorithms. The first genetic algorithm searches both the uncertain plant parameters and sampling time to dynamically reduce the search range for locating the desired sampling-time boundaries based on verification results from the second genetic algorithm. As a result, the desired sampling-time range ensuring minimum phase behaviour of the sampled-data interval system can be evolutionarily obtained. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which requires undertaking a large number of evolution cycles, parallel computation for the proposed genetic algorithm is therefore proposed to accelerate the derivation process. Illustrated examples in this paper have demonstrated that the proposed GA-based approach is capable of accurately locating the boundaries of the desired sampling-time range.",
keywords = "Discretization, Genetic algorithms, Interval plant, Minimum-phase, Parallel computation, Sampled-data systems, Uncertain systems",
author = "Hsu, {Chen-Chien James} and Lu, {Tsung Chi}",
year = "2008",
month = "9",
day = "1",
doi = "10.1016/j.asoc.2008.01.009",
language = "English",
volume = "8",
pages = "1670--1679",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",
number = "4",

}

TY - JOUR

T1 - Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms

AU - Hsu, Chen-Chien James

AU - Lu, Tsung Chi

PY - 2008/9/1

Y1 - 2008/9/1

N2 - In this paper, a genetic algorithm-based approach is proposed to determine a desired sampling-time range which guarantees minimum phase behaviour for the sampled-data system of an interval plant preceded by a zero-order hold (ZOH). Based on a worst-case analysis, the identification problem of the sampling-time range is first formulated as an optimization problem, which is subsequently solved under a GA-based framework incorporating two genetic algorithms. The first genetic algorithm searches both the uncertain plant parameters and sampling time to dynamically reduce the search range for locating the desired sampling-time boundaries based on verification results from the second genetic algorithm. As a result, the desired sampling-time range ensuring minimum phase behaviour of the sampled-data interval system can be evolutionarily obtained. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which requires undertaking a large number of evolution cycles, parallel computation for the proposed genetic algorithm is therefore proposed to accelerate the derivation process. Illustrated examples in this paper have demonstrated that the proposed GA-based approach is capable of accurately locating the boundaries of the desired sampling-time range.

AB - In this paper, a genetic algorithm-based approach is proposed to determine a desired sampling-time range which guarantees minimum phase behaviour for the sampled-data system of an interval plant preceded by a zero-order hold (ZOH). Based on a worst-case analysis, the identification problem of the sampling-time range is first formulated as an optimization problem, which is subsequently solved under a GA-based framework incorporating two genetic algorithms. The first genetic algorithm searches both the uncertain plant parameters and sampling time to dynamically reduce the search range for locating the desired sampling-time boundaries based on verification results from the second genetic algorithm. As a result, the desired sampling-time range ensuring minimum phase behaviour of the sampled-data interval system can be evolutionarily obtained. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature which requires undertaking a large number of evolution cycles, parallel computation for the proposed genetic algorithm is therefore proposed to accelerate the derivation process. Illustrated examples in this paper have demonstrated that the proposed GA-based approach is capable of accurately locating the boundaries of the desired sampling-time range.

KW - Discretization

KW - Genetic algorithms

KW - Interval plant

KW - Minimum-phase

KW - Parallel computation

KW - Sampled-data systems

KW - Uncertain systems

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

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

U2 - 10.1016/j.asoc.2008.01.009

DO - 10.1016/j.asoc.2008.01.009

M3 - Article

AN - SCOPUS:50149110060

VL - 8

SP - 1670

EP - 1679

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

IS - 4

ER -