分数阶Charef传递函数离散逼近的样本时间优化

2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR) Pub Date : 2018-08-01 DOI:10.1109/MMAR.2018.8486078

K. Oprzȩdkiewicz, Klaudia Dziedzic

{"title":"分数阶Charef传递函数离散逼近的样本时间优化","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":"{\"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}","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

摘要

本文给出了分数阶Charef传递函数离散逼近的样本时间优化问题。采用粒子群优化算法，对保证离散模型最佳精度的样本时间进行了数值分配。实验结果表明，粒子群算法能够以较短的计算时间找到样本时间的最优值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)

自引率

0.00%

发文量