Learning Competitive Swarm Optimization

Particle swarm optimization (PSO) is a popular method widely used in solving different optimization problems. Unfortunately, in the case of complex multidimensional problems, PSO encounters some troubles associated with the excessive loss of population diversity and exploration ability. This leads to a deterioration in the effectiveness of the method and premature convergence. In order to prevent these inconveniences, in this paper, a learning competitive swarm optimization algorithm (LCSO) based on the particle swarm optimization method and the competition mechanism is proposed. In the first phase of LCSO, the swarm is divided into sub-swarms, each of which can work in parallel. In each sub-swarm, particles participate in the tournament. The participants of the tournament update their knowledge by learning from their competitors. In the second phase, information is exchanged between sub-swarms. The new algorithm was examined on a set of test functions. To evaluate the effectiveness of the proposed LCSO, the test results were compared with those achieved through the competitive swarm optimizer (CSO), comprehensive particle swarm optimizer (CLPSO), PSO, fully informed particle swarm (FIPS), covariance matrix adaptation evolution strategy (CMA-ES) and heterogeneous comprehensive learning particle swarm optimization (HCLPSO). The experimental results indicate that the proposed approach enhances the entropy of the particle swarm and improves the search process. Moreover, the LCSO algorithm is statistically and significantly more efficient than the other tested methods.     

A Graph-Transformational Approach to Swarm Computation

In this paper, we propose a graph-transformational approach to swarm computation that is flexible enough to cover various existing notions of swarms and swarm computation, and it provides a mathematical basis for the analysis of swarms with respect to their correct behavior and efficiency. A graph transformational swarm consists of members of some kinds. They are modeled by graph transformation units providing rules and control conditions to specify the capability of members and kinds. The swarm members act on an environment—represented by a graph—by applying their rules in parallel. Moreover, a swarm has a cooperation condition to coordinate the simultaneous actions of the swarm members and two graph class expressions to specify the initial environments on one hand and to fix the goal on the other hand. Semantically, a swarm runs from an initial environment to one that fulfills the goal by a sequence of simultaneous actions of all its members. As main results, we show that cellular automata and particle swarms can be simulated by graph-transformational swarms. Moreover, we give an illustrative example of a simple ant colony the ants of which forage for food choosing their tracks randomly based on pheromone trails.     

A novel model and behavior analysis for a swarm of multi-agent systems with finite velocity

Inspired by the fact that in most existing swarm models of multi-agent systems the velocity of an agent can be infinite,which is not in accordance with the real applications, we propose a novel swarm model of multi-agent systems where the velocity of an agent is finite. The Lyapunov function method and LaSalle’s invariance principle are employed to show that by using the proposed model all of the agents eventually enter into a bounded region around the swarm center and finally tend to a stationary state. Numerical simulations are provided to demonstrate the effectiveness of the theoretical results.     

薄膜光学常数的粒子群算法

为解决椭偏法测量薄膜厚度和折射率实验数据处理较为复杂的问题,采用一种新的基于群体智能的优化算法——粒子群算法处理实验数据.以单层吸收薄膜的测量为例,利用该算法进行数据处理.实验结果表明,可以同时获得3个薄膜参数(折射率n,消光系数k和薄膜厚度d),而且在确切参数范围未知情况下,大范围内进行搜索仍然能保证快速收敛到最优解.该算法与遗传算法以及利用椭偏仪数据处理软件得出的结果相比较,计算精度高,收敛速度快.     

量子势阱粒子群优化算法的改进研究

为提高量子势阱粒子群优化算法的优化能力, 通过分析目前量子势阱粒子群优化算法的设计过程, 提出了改进的量子势阱粒子群优化算法. 首先, 分别基于Delta势阱、谐振子和方势阱 提出了改进的量子势阱粒子群优化算法, 并提出了基于统计量均值的控制参数设计方法. 然后, 在势阱中心的设计方面, 为强调全局最优粒子的指导作用, 提出了基于自身最优粒子加权平均和动态随机变量的两种设计策略. 实验结果表明, 三种势阱粒子群优化算法性能比较接近, 都优于原算法, 且Delta势阱模型略优于其他两种.     

基于二进制粒子群算法的认知无线电决策引擎

提出了基于粒子群算法的认知无线电决策引擎,并提出了一种种群自适应粒子群算法,利用粒子群算法调整优化无线电参数,运用多载波系统对算法性能进行了仿真分析.实验结果表明基于二进制粒子群算法的认知决策引擎在收敛速度、收敛精度和算法稳定性上都要明显优于经典遗传算法,基于种群自适应粒子群算法的决策引擎则能进一步提高算法初期性能,满足认知无线电实时性要求. 关键词： 认知无线电 粒子群算法 遗传算法 认知决策引擎     

量子粒子群优化算法的收敛性分析及控制参数研究

通过分析粒子群优化算法的特点,将粒子放在量子空间来描述,建立粒子的量子势能场模型,并结合群体的群集性推导了量子粒子群优化(QPSO)算法.在随机算法全局收敛定理的框架下,讨论了QPSO算法的收敛性,证明QPSO算法是一种全局收敛的算法.针对QPSO算法的唯一控制参数,提出了三种控制策略,结合标准测试函数的仿真结果给出了具有实际指导意义的控制参数选择方法.     

群体智能优化中的虚拟碰撞：雨林算法

启发式优化算法中寻优代理过早收敛易陷入局部最优. 本文对此进行机理分析并发现, 虚拟碰撞作为一种隐性过早收敛现象将直接影响群体智能优化算法的准确性与快速性, 而采样过程的无约束性和样本分布信息的缺失是导致虚拟碰撞的根本原因. 为解决上述问题, 本文提出雨林优化算法. 该算法仿照植物生长模式, 利用规模可变种群代替规模限定种群进行分区分级寻优采样, 并结合均匀与非均匀采样原则来权衡优化算法的探索与挖掘, 可以有效减少虚拟碰撞的发生, 在提高寻优效率的同时, 获取精准性和稳定性较高的全局最优解. 与遗传算法、粒子群算法对标称函数的寻优对比实验表明, 雨林算法在快速性、准确性以及泛化能力等方面均具有优势. 关键词： 优化算法 群体智能 进化计算 计算智能     

基于粒子群分类器的雷达目标一维像识别

设计了一种用于雷达一维像识别的粒子群分类算法.新算法首先对数据样本预处理,利用粒子群优化算法通过训练数据进行分类规则的提取,根据提取得到的规则对雷达一维像进行分类识别.基于Bayes定理和随机状态转移过程对新算法的收敛性进行分析.通过对三种飞机缩比模型的实测数据的识别实验,验证了新算法对实测数据和加噪数据均具有较高的识别率.     

基于量子粒子群算法的自适应随机共振方法研究

为提升随机共振理论在微弱信号检测领域中的实用性,以随机共振系统参数为研究对象,提出了基于量子粒子群算法的自适应随机共振方法.首先将自适应随机共振问题转化为多参数并行寻优问题,然后分别在Langevin系统和Duffing振子系统下进行仿真实验.在Langevin系统中,将量子粒子群算法和描点法进行了寻优结果对比;在Duffing振子系统中,Duffing振子系统的寻优结果则直接与Langevin系统的寻优结果进行了对比.实验结果表明:在寻优结果和寻优效率上,基于量子粒子群算法的自适应随机共振方法要明显高于描点法;在相同条件下,Duffing振子系统的寻优结果要优于Langevin系统的寻优结果;在两种系统下,输入信号信噪比越低就越能体现出量子粒子群算法的优越性.最后还对随机共振系统参数的寻优结果进行了规律性总结.     

基于混沌蚂蚁群算法的Lorenz混沌系统的参数估计

通过构造一个适当的适应度函数，首先将混沌系统的参数估计问题转化为参数的寻优问题，之后利用混沌蚂蚁群算法的全局优化搜索能力对这个问题进行求解.以典型的Lorenz混沌系统为例进行了数值模拟.实验数值仿真结果表明，使用该方法可以对混沌系统的未知参数进行有效地估计.     

Admissible consensus and consensualization of high-order linear time-invariant singular swarm systems

Admissible consensus analysis and consensualizing controller design problems for high-order linear time-invariant singular swarm systems are investigated. Firstly, by projecting the state of a singular swarm system onto a consensus subspace and a complement consensus subspace, a necessary and sufficient condition for admissible consensus is presented in terms of linear matrix inequalities (LMIs). An approach to decrease the calculation complexity is proposed, by which only three LMIs independent of the number of agents need to be checked. Then, by using the changing variable method, sufficient conditions for admissible consensualization are shown. An explicit expression of the consensus function is given, and it is shown that the modes of the consensus function can be arbitrarily placed if each agent is R$R$-controllable and impulse controllable and the interaction topology has a spanning tree. Finally, theoretical results are applied to deal with cooperative control problems of multi-agent supporting systems.     

用于认知无线电协作频谱感知的混合蛙跳算法群体初始化技术

提出了一种用于认知无线电线性加权协作频谱感知的改进混合蛙跳算法(shuffled frog leaping algorithm, SFLA) 的群体初始化技术, 提出在SFLA初始群体中包含基于修正偏差因子所得的解, 从而改进算法初期性能. 仿真结果表明相比于传统群体初始化技术, 本文所提出的群体初始化技术能够以更快的速率得到期望解, 从而节约计算时间, 更有利于实时应用 关键词： 认知无线电 频谱感知 混合蛙跳算法 群体初始化     

改进的粒子群优化目标跟踪方法

针对粒子群优化算法应用在目标跟踪时,其惯性权重调节机制的局限性,提出了改进的粒子群优化目标跟踪方法。首先,对目标及粒子群算法中相应参数进行初始化;接着,引入粒子进化率的概念,对惯性权重调节机制进行改进,根据每代每个粒子的不同状态及时调整惯性权重;然后,在更新粒子的速度和位置的同时,更新个体最优解和全局最优解,进行下一次迭代;最后,比较粒子的适应度,选择相似性函数值最大的区域为目标。实验结果表明,该方法与使用自适应惯性权重调节机制的粒子群优化目标跟踪方法相比,减少了获取相同适应度所需的迭代次数,运算效率提高了42.9%。实现了目标在相似性函数出现"多峰"情况下的准确定位,对目标出现部分遮挡的情况具有很好的适应性。     

一种基于离散粒子群优化算法的高光谱图像端元提取方法

针对混合像元分解过程中,由于数据噪声引起的端元提取不准确问题,引入了群智能算法中的粒子群优化算法,并对粒子群优化算法进行了改进,重新定义了位置和速度的表示方法和更新策略,得到离散粒子群优化(discrete particle swarm optimization,D-PSO),能够在离散空间中进行搜索,解决组合优化问题。同时,通过定义目标函数和可行解空间,将端元提取问题改写成组合优化问题,最终实现利用D-PSO进行端元提取。在给出算法的详细流程之后,文章通过一组模拟数据实验和一组实际数据实验验证了D-PSO算法对于具有较大噪声的数据的适应性和提取端元的可信程度,并分析了不同参数对于算法性能的影响。     

基于量子粒子群算法的混沌系统参数辨识

针对混沌系统参数辨识问题, 在基本群智能算法粒子群优化算法的基础上, 提出量子粒子群算法, 测试函数证明了算法具有良好的全局优化能力. 进而将其应用于混沌系统参数辨识问题, 将参数辨识问题转化为多维函数空间上的优化问题. 通过对平衡板热对流典型混沌系统Lorenz系统进行研究, 并与基本算法和遗传算法比较. 仿真实验证明, 算法的有效性, 对混沌理论的发展有着非常重要的意义. 关键词： 量子粒子群算法 混沌系统 系统辨识     

基于随机粒子群的Newton-SVD方法的电测井反演

提出一种基于随机粒子群的Newton-SVD方法对双侧向测井进行双参数反演(原状地层电阻率,侵入带半径),运用随机粒子群方法得到双侧向测井反演的一个较为合理的初始值,结合Newton-SVD方法进行双侧向测井反演,提高测井反演的稳定性、可靠性,给出一种设定测井反演初始值的方法,通过对加入噪声的理想模型和实际资料进行处理表明,该方法可有效、准确地消除复杂测井环境的影响,得到真实的地层参数.     

A Diversity Model Based on Dimension Entropy and Its Application to Swarm Intelligence Algorithm

The swarm intelligence algorithm has become an important method to solve optimization problems because of its excellent self-organization, self-adaptation, and self-learning characteristics. However, when a traditional swarm intelligence algorithm faces high and complex multi-peak problems, population diversity is quickly lost, which leads to the premature convergence of the algorithm. In order to solve this problem, dimension entropy is proposed as a measure of population diversity, and a diversity control mechanism is proposed to guide the updating of the swarm intelligence algorithm. It maintains the diversity of the algorithm in the early stage and ensures the convergence of the algorithm in the later stage. Experimental results show that the performance of the improved algorithm is better than that of the original algorithm.     

基于Bloch球面搜索的量子粒子群优化算法

通过分析量子势阱粒子群优化算法的设计过程,提出一种基于Bloch球面搜索的量子粒子群优化算法.首先用基于Bloch球面描述的量子位描述粒子,用泡利矩阵建立旋转轴,用Delta势阱模型计算旋转角度,用量子位在Bloch球面上的绕轴旋转实现搜索.然后用Hadamard门实现粒子变异,以避免早熟收敛.这种旋转可使当前量子位沿着Bloch球面上的大圆逼近目标量子位,从而可加速优化进程.仿真结果表明,该算法的优化能力优于原算法.     

基于粒子群优化算法的自适应图像分割方法

提出了一种基于粒子群优化算法的图像分割新方法。粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域缩短了寻找阈值的时间。将PSO用于基于改进的最佳加权熵阈值法的图像分割中,试验结果表明,该方法不仅能够避免陷入局部极值,而且其速度得到了明显的改善,是一种有效的图像分割新方法。