Application of Stochastic Fractal Search in order reduction of large scale LTI systems

I. Khanam, G. Parmar
{"title":"Application of Stochastic Fractal Search in order reduction of large scale LTI systems","authors":"I. Khanam, G. Parmar","doi":"10.1109/COMPTELIX.2017.8003962","DOIUrl":null,"url":null,"abstract":"Order reduction of large scale single-input single-output (SISO) linear time invariant (LTI) systems using stochastic fractal search (SFS) algorithm has been presented. Stochastic Fractal Search (SFS) is a metahuristic algorithm growth using the concept of fractal. SFS employs the diffusion property observed in random fractals to explore the search space. Stochastic rules like; Gaussian walks are used to change the iteration process to generate random fractals. Here, for order reduction of LTI system, SFS Algorithm is used. Integral square error (ISE) in between the transient responses of original higher order and reduced order system has been taken as an objective function, which has been minimized. The step and frequency responses of both low and high order systems have also been compared along with the transient response's parameters. A comparative study of ISE with the other existing techniques in the literature has also been given in the tabular form to show the superiority of the algorithm.","PeriodicalId":6917,"journal":{"name":"2017 International Conference on Computer, Communications and Electronics (Comptelix)","volume":"18 1","pages":"190-194"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Communications and Electronics (Comptelix)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPTELIX.2017.8003962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Order reduction of large scale single-input single-output (SISO) linear time invariant (LTI) systems using stochastic fractal search (SFS) algorithm has been presented. Stochastic Fractal Search (SFS) is a metahuristic algorithm growth using the concept of fractal. SFS employs the diffusion property observed in random fractals to explore the search space. Stochastic rules like; Gaussian walks are used to change the iteration process to generate random fractals. Here, for order reduction of LTI system, SFS Algorithm is used. Integral square error (ISE) in between the transient responses of original higher order and reduced order system has been taken as an objective function, which has been minimized. The step and frequency responses of both low and high order systems have also been compared along with the transient response's parameters. A comparative study of ISE with the other existing techniques in the literature has also been given in the tabular form to show the superiority of the algorithm.
随机分形搜索在大规模LTI系统降阶中的应用
利用随机分形搜索(SFS)算法对大规模单输入单输出(SISO)线性时不变(LTI)系统进行了降阶。随机分形搜索(SFS)是一种基于分形概念的元算法。SFS利用随机分形中观察到的扩散特性来探索搜索空间。随机规则像;高斯游走用于改变迭代过程以生成随机分形。这里,对于LTI系统的降阶,使用了SFS算法。将原高阶系统和降阶系统的瞬态响应之间的积分平方误差(ISE)作为目标函数,并将其最小化。还比较了低阶和高阶系统的阶跃响应和频率响应以及瞬态响应参数。ISE与文献中其他现有技术的比较研究也以表格形式给出,以显示算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信