{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
