Sample Time Optimization for the Discrete Approximation of the Fractional Order Charef Transfer Function

K. Oprzȩdkiewicz, Klaudia Dziedzic
{"title":"Sample Time Optimization for the Discrete Approximation of the Fractional Order Charef Transfer Function","authors":"K. Oprzȩdkiewicz, Klaudia Dziedzic","doi":"10.1109/MMAR.2018.8486078","DOIUrl":null,"url":null,"abstract":"In the paper the sample time optimization problem for the discrete approximation of fractional order Charef transfer function is presented. The sample time assuring the best accuracy of discrete model is assigned numerically using Particle Swarm Optimization (PSO) algorithm. Results of experiments show that the PSO method allows to find the optimal value of the sample time with relatively short duration of calculations.","PeriodicalId":201658,"journal":{"name":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2018.8486078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the paper the sample time optimization problem for the discrete approximation of fractional order Charef transfer function is presented. The sample time assuring the best accuracy of discrete model is assigned numerically using Particle Swarm Optimization (PSO) algorithm. Results of experiments show that the PSO method allows to find the optimal value of the sample time with relatively short duration of calculations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分数阶Charef传递函数离散逼近的样本时间优化
本文给出了分数阶Charef传递函数离散逼近的样本时间优化问题。采用粒子群优化算法,对保证离散模型最佳精度的样本时间进行了数值分配。实验结果表明,粒子群算法能够以较短的计算时间找到样本时间的最优值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Model-Free Control Approach for Fixed-Wing UAVs with Uncertain Parameters Analysis Adaptive Gradient-Based Luenberger Observer Implemented for Electric Drive with Elastic Joint High Performance Control of a Coupled Tanks System as an Example for Control Teaching Accelerating Newton Algorithms of Inverse Kinematics for Robot Manipulators Variable-, Fractional-Order RST/PID Controller Transient Characteristics Calculation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1