淡江大學機構典藏:Item 987654321/42052
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62797/95867 (66%)
造访人次 : 3734085      在线人数 : 404
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/42052


    题名: Minimum-phase criterion on sampling time for sampled-data interval systems using genetic algorithms
    作者: 許陳鑑;Hsu, Chen-chien;Lu, Tsung-chi
    贡献者: 淡江大學電機工程學系
    关键词: Minimum-phase;Genetic algorithms;Uncertain systems;Interval plant;Sampled-data systems;Discretization;Parallel computation
    日期: 2008-09
    上传时间: 2010-02-23 14:48:06 (UTC+8)
    出版者: Elsevier
    摘要: 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.
    關聯: Applied Soft Computing 8(4), pp.1670-1679
    DOI: 10.1016/j.asoc.2008.01.009
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    0KbUnknown255检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈