Time delays identification by means of a hybrid interpolated ant colony optimization and Nelder-Mead algorithm

Janusz P. Papliński
{"title":"Time delays identification by means of a hybrid interpolated ant colony optimization and Nelder-Mead algorithm","authors":"Janusz P. Papliński","doi":"10.1109/PC.2013.6581380","DOIUrl":null,"url":null,"abstract":"The paper presents a possibility of application a hybrid algorithm compound of a global algorithm Interpolated Ant Colony Optimization and local Directional Derivatives Simplex (IACO-DDS) to identification of the time delays in the linear plant. The Interpolated Ant Colony Optimization algorithm (IACO) can be used to continuous problems. The Derivatives Simplex belongs to the class of a modified Nelder Mead Algorithm. The IACO-DDS algorithm is compared with the simple IACO in terms of their speed and efficiency for unimodal and multimodal search space. The investigation was made for the sixteen plants with random parameters, divide into two group: the simple and difficult to identification plants.","PeriodicalId":232418,"journal":{"name":"2013 International Conference on Process Control (PC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Process Control (PC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PC.2013.6581380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The paper presents a possibility of application a hybrid algorithm compound of a global algorithm Interpolated Ant Colony Optimization and local Directional Derivatives Simplex (IACO-DDS) to identification of the time delays in the linear plant. The Interpolated Ant Colony Optimization algorithm (IACO) can be used to continuous problems. The Derivatives Simplex belongs to the class of a modified Nelder Mead Algorithm. The IACO-DDS algorithm is compared with the simple IACO in terms of their speed and efficiency for unimodal and multimodal search space. The investigation was made for the sixteen plants with random parameters, divide into two group: the simple and difficult to identification plants.
基于混合插值蚁群优化和Nelder-Mead算法的时滞辨识
本文提出了将全局插值蚁群优化算法与局部定向导数单纯形算法(IACO-DDS)的混合算法应用于线性对象时滞辨识的可能性。插值蚁群优化算法(IACO)可用于求解连续问题。导数单纯形属于一类改进的Nelder Mead算法。将IACO- dds算法与简单IACO算法在单峰和多峰搜索空间的速度和效率进行了比较。对16种随机参数的植物进行调查,将其分为简单和难识别两组。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信