{"title":"基于混合插值蚁群优化和Nelder-Mead算法的时滞辨识","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":"{\"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}","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}
Time delays identification by means of a hybrid interpolated ant colony optimization and Nelder-Mead algorithm
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
