A study of particle swarm optimization for cognitive machines

Dario Schor, W. Kinsner
{"title":"A study of particle swarm optimization for cognitive machines","authors":"Dario Schor, W. Kinsner","doi":"10.1109/COGINF.2010.5599684","DOIUrl":null,"url":null,"abstract":"This paper presents a study of the properties of optimization algorithms for use in cognitive machines through five key measures: (i) speed of convergence, (ii) degree of exploration of the parameter space, (iii) storage and system size, (iv) adaptability, and (v) multi-scale capabilities. Based on these factors, a novel study of the trajectories of a particle in the particle swarm optimization algorithm is performed both in the time and frequency domain. The analysis shows that the trajectories of particles can be separated into a transient and a steady state periods where the transient is wide-sense stationary with long term dependancies that show the evolutionary properties of the algorithm as it converges on a solution. The steady state shows an increased degree of exploration of the parameter space that allow the algorithm to improve on the solution found over time. The results show the advantages of particle swarm optimization and inherent properties that make this optimization algorithm a suitable choice for use in cognitive machines. The information learned from this analysis can further be used to extract complexity measures to classify the behavior and control of particle swarm optimization, and make proper quick decisions on what to do next. The decision process often requires more alternatives to be considered in a short window of time than it is physically possible for a real-time system [Kins04]. Thus, in order to make good decisions without exploring all possible paths, a cognitive system requires optimization techniques that can survey the possible options, and quickly select the best option possible. The paper reviews the requirements for an ideal optimization technique for use in cognitive systems and proposes the particle swarm optimization algorithm as one technique that is designed to satisfy these requirements. In order to show the properties of PSO, a novel trajectory, time, and frequency domain analyses of single particles along individual dimensions are presented.","PeriodicalId":365083,"journal":{"name":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGINF.2010.5599684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

This paper presents a study of the properties of optimization algorithms for use in cognitive machines through five key measures: (i) speed of convergence, (ii) degree of exploration of the parameter space, (iii) storage and system size, (iv) adaptability, and (v) multi-scale capabilities. Based on these factors, a novel study of the trajectories of a particle in the particle swarm optimization algorithm is performed both in the time and frequency domain. The analysis shows that the trajectories of particles can be separated into a transient and a steady state periods where the transient is wide-sense stationary with long term dependancies that show the evolutionary properties of the algorithm as it converges on a solution. The steady state shows an increased degree of exploration of the parameter space that allow the algorithm to improve on the solution found over time. The results show the advantages of particle swarm optimization and inherent properties that make this optimization algorithm a suitable choice for use in cognitive machines. The information learned from this analysis can further be used to extract complexity measures to classify the behavior and control of particle swarm optimization, and make proper quick decisions on what to do next. The decision process often requires more alternatives to be considered in a short window of time than it is physically possible for a real-time system [Kins04]. Thus, in order to make good decisions without exploring all possible paths, a cognitive system requires optimization techniques that can survey the possible options, and quickly select the best option possible. The paper reviews the requirements for an ideal optimization technique for use in cognitive systems and proposes the particle swarm optimization algorithm as one technique that is designed to satisfy these requirements. In order to show the properties of PSO, a novel trajectory, time, and frequency domain analyses of single particles along individual dimensions are presented.
认知机器的粒子群优化研究
本文通过五个关键指标研究了用于认知机器的优化算法的特性:(i)收敛速度,(ii)对参数空间的探索程度,(iii)存储和系统大小,(iv)适应性,以及(v)多尺度能力。基于这些因素,对粒子群优化算法中粒子的运动轨迹进行了时域和频域研究。分析表明,粒子的轨迹可以分为瞬态和稳态周期,其中瞬态是广义平稳的,具有长期依赖关系,显示了算法收敛于解时的进化特性。稳定状态显示了对参数空间的探索程度的增加,这使得算法可以随着时间的推移改进所找到的解。结果表明,粒子群优化算法的优点和固有的特性使该算法适合应用于认知机器。从该分析中获得的信息可以进一步用于提取复杂性度量,以对粒子群优化的行为和控制进行分类,并对下一步的操作做出适当的快速决策。决策过程通常需要在较短的时间窗口内考虑更多的选择,而不是实时系统的物理可能[Kins04]。因此,为了在不探索所有可能路径的情况下做出正确的决策,认知系统需要能够调查所有可能选项并快速选择最佳选项的优化技术。本文回顾了认知系统对理想优化技术的要求,并提出了粒子群优化算法作为一种满足这些要求的技术。为了展示粒子群的特性,提出了一种新的单粒子沿各个维度的轨迹、时间和频域分析方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书