There are many parameters in model reduction problems and some algorithms are prone to trap in local optimum. Based on the small-world principle in social networks
a decimal-coding local short-connection operator and a random long-connection search operator are proposed. Then a decimal-coding small world algorithm(DSWA)is designed
whose validity and feasibility are testified by the simulation of stable and unstable linear system model reduction. Comparing search-space fixation scheme with expansion scheme
the results indicate that search-space expansion scheme is better than search-space fixation scheme
and DSWA can avoid trapping in local optimum to a certain extent. And a comparison between the optimization model and the original model in the indicators of the error and the time-domain and frequency responses
exhibits the better approximate properties of the reduction model obtained by DSWA.
关键词
Keywords
references
JIHSHENG L, JAMES C H. Practical model reduction [J]. IEEE Transactions on Industrial Electronics, 1987, 34(1): 70-77.
BULTHEEL A, VAN BAREL M. Pade techniques for model reduction in linear system theory: a survey [J]. Journal of Computation and Applied Mathematics, 1986, 14(3): 401-438.
ZHONG Weicai, LIU Jing, XUE Mingzhi, et al. A multi-agent genetic algorithm for global numerical optimization [J]. IEEE Transactions on System, Man, and Cybernetics:part B, 2004, 34(2): 1128-1141.
DU Haifeng, ZHUANG Jian, ZHANG Jinhua, et al. Small-world phenomenon for function optimization [J]. Journal of Xi'an Jiaotong University, 2005, 39(9): 1011-1015.
GONG Maoguo, DU Haifeng, JIAO Licheng. Linear system approximation based on artificial immune response [J]. Science in China: E, 2005, 35(12): 1288-1303.
KLEINBERG J M. The small-world phenomenon and decentralized search [J]. SIAM News, 2004, 37(3): 1-2.
GUO Tongyi, HWANG C. Optimal reduced-order models for unstable and nonminimum phase systems [J]. IEEE Transactions on Circuits and Systems: I, 1996, 39(9): 800-805.