Please use this identifier to cite or link to this item: http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/31954
Full metadata record
DC FieldValueLanguage
dc.contributor國立臺灣師範大學電機工程學系zh_tw
dc.contributor.authorC.-C. Hsuen_US
dc.contributor.authorT.-C. Luen_US
dc.contributor.authorW.-Y. Wangen_US
dc.date.accessioned2014-10-30T09:28:15Z-
dc.date.available2014-10-30T09:28:15Z-
dc.date.issued2005-11-01zh_TW
dc.identifierntnulib_tp_E0604_01_032zh_TW
dc.identifier.issn1109-2777zh_TW
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/31954-
dc.description.abstractIn 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.en_US
dc.languageenzh_TW
dc.publisherWorld Scientific and Engineering Academy and Society (WSEAS)en_US
dc.relationWSEAS Transactions on Systems, 4(11), 2073-2080.en_US
dc.titleModel reduction of discrete interval systems using genetic algorithmsen_US
Appears in Collections:教師著作

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.