基于LQR技术和蚂蚁系统元启发式的混合极点配置方法

H. Liouane, A. Douik, H. Messaoud
{"title":"基于LQR技术和蚂蚁系统元启发式的混合极点配置方法","authors":"H. Liouane, A. Douik, H. Messaoud","doi":"10.1504/IJAISC.2009.027292","DOIUrl":null,"url":null,"abstract":"We present in this paper a new metaheuristic using Ant System metaheuristic to search an optimal command law in LQR sense that gives for a feedback system a given values by pole assignment. In fact, these hybrid techniques of conventional and non conventional methods present a good compromise between the simplicity of use and the quality of proposed solutions in a reasonable computing time. The results obtained by using this technique show its efficiency in the proposed problem and can be considered as a competitive method for those issued from a complicate mathematic formulation.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Hybrid approach for pole assignment using LQR technique and Ant System metaheuristic\",\"authors\":\"H. Liouane, A. Douik, H. Messaoud\",\"doi\":\"10.1504/IJAISC.2009.027292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present in this paper a new metaheuristic using Ant System metaheuristic to search an optimal command law in LQR sense that gives for a feedback system a given values by pole assignment. In fact, these hybrid techniques of conventional and non conventional methods present a good compromise between the simplicity of use and the quality of proposed solutions in a reasonable computing time. The results obtained by using this technique show its efficiency in the proposed problem and can be considered as a competitive method for those issued from a complicate mathematic formulation.\",\"PeriodicalId\":364571,\"journal\":{\"name\":\"Int. J. Artif. Intell. Soft Comput.\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Artif. Intell. Soft Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAISC.2009.027292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Artif. Intell. Soft Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAISC.2009.027292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的元启发式算法,利用蚁群系统元启发式算法搜索LQR意义上的最优命令律,通过极点赋值给反馈系统一个给定的值。事实上,这些常规和非常规方法的混合技术在使用的简单性和在合理的计算时间内提出的解决方案的质量之间提供了一个很好的折衷。应用该方法得到的结果表明,该方法在该问题中是有效的,可以被认为是解决复杂数学公式问题的一种竞争方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid approach for pole assignment using LQR technique and Ant System metaheuristic
We present in this paper a new metaheuristic using Ant System metaheuristic to search an optimal command law in LQR sense that gives for a feedback system a given values by pole assignment. In fact, these hybrid techniques of conventional and non conventional methods present a good compromise between the simplicity of use and the quality of proposed solutions in a reasonable computing time. The results obtained by using this technique show its efficiency in the proposed problem and can be considered as a competitive method for those issued from a complicate mathematic formulation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信