Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms | |
---|---|
學年 | 97 |
學期 | 1 |
出版(發表)日期 | 2008-09-01 |
作品名稱 | Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms |
作品名稱(其他語言) | |
著者 | 許陳鑑; Hsu, Chen-chien; Lu, Tsung-chi |
單位 | 淡江大學電機工程學系 |
出版者 | Elsevier |
著錄名稱、卷期、頁數 | Applied Soft Computing 8(4), pp.1670-1679 |
摘要 | 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. |
關鍵字 | Minimum-phase; Genetic algorithms; Uncertain systems; Interval plant; Sampled-data systems; Discretization; Parallel computation |
語言 | en |
ISSN | 1568-4946 |
期刊性質 | |
收錄於 | |
產學合作 | |
通訊作者 | |
審稿制度 | |
國別 | |
公開徵稿 | |
出版型式 | |
相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/42052 ) |