Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Sensors deployment optimization in multi-dimensional space based on improved particle swarm optimization algorithm

Sensors deployment optimization has become one of the most attractive fields in recent years. However, most of the previous work focused on the deployment problem in 2D space.Compared to the traditional form, sensors deployment in multidimensional space has greater research significance and practical potential to satisfy the detecting needs in complex environment.Aiming at solving this issue, a multi-dimensional space sensor network model is established, and the radar system is selected as an example. Considering the possible working mode of the radar system(e.g., searching and tracking), two distinctive deployment models are proposed based on maximum coverage area and maximum target detection probability in the attack direction respectively. The latter one is usually ignored in the previous literature.For uncovering the optimal deployment of the sensor network, the particle swarm optimization(PSO) algorithm is improved using the proposed weights determination scheme, in which the linear decreasing, the pooling strategy and the cloud theory are combined for weights updating. Experimental results illustrate the effectiveness of the proposed method.

ACCQPSO:一种改进的量子粒子群优化算法及其应用

针对量子粒子群优化算法前期易陷入局部极值点、后期寻优精度不高等问题,文章提出一种自适应交叉算子的混沌量子粒子群优化算法,并将其应用于BP神经网络超参数寻优。首先,利用Logistics映射初始种群为混沌序列进行最优解搜索,增强初始种群的随机性与遍历性,提高算法寻优能力;然后,通过纵向交叉操作进行种群中个体的信息交换,并引入自适应交叉概率公式,增加种群多样性,提高算法的寻优精度;最后,在实验中,一方面,选取8个函数在高低两个维度进行验证,同时进行Wilcoxon秩和检验分析以及消融实验,验证该算法相较其他算法的有效性;另一方面,通过算法优化BP神经网络应用到网络安全态势预测任务中,实验结果表明该算法收敛速度相较于对比算法有大幅度提升。

Improved particle swarm optimization algorithm for fuzzy multi-class SVM

An improved particle swarm optimization（PSO） algorithm is proposed to train the fuzzy support vector machine（FSVM） for pattern multi-classification.In the improved algorithm,the particles studies not only from itself and the best one but also from the mean value of some other particles.In addition,adaptive mutation was introduced to reduce the rate of premature convergence.The experimental results on the synthetic aperture radar（SAR） target recognition of moving and stationary target acquisition and recognition（MSTAR） dataset and character recognition of MNIST database show that the improved algorithm is feasible and effective for fuzzy multi-class SVM training.

Identification of strategy parameters for particle swarm optimizer through Taguchi method

Particle swarm optimization (PSO), like other evolutionary algorithms is a population-based stochastic algorithm inspired from the metaphor of social interaction in birds, insects, wasps, etc. It has been used for finding promising solutions in complex search space through the interaction of particles in a swarm. It is a well recognized fact that the performance of evolu- tionary algorithms to a great extent depends on the choice of appropriate strategy/operating parameters like population size, crossover rate, mutation rate, crossover operator, etc. Generally, these parameters are selected through hit and trial process, which is very unsystematic and requires rigorous experimentation. This paper proposes a systematic based on Taguchi method reasoning scheme for rapidly identifying the strategy parameters for the PSO algorithm. The Taguchi method is a robust design approach using fractional factorial design to study a large number of parameters with small number of experiments. Computer simulations have been performed on two benchmark functions—Rosenbrock function and Griewank function—to validate the approach.

基于PSO的电动汽车规模化充电接入配电网柔性负荷多目标优化控制

为了降低电动汽车大规模接入配电网后产生的负荷波动和网损,提出了基于粒子群优化(PSO)算法的电动汽车规模化充电接入配电网柔性负荷多目标优化控制方法。首先,建立交通网-配电网耦合模型,并结合出行链模型分析用户的充电需求,搭建接入电动汽车能量状态预测模型;其次,以最小化配电网负荷波动标准差和网损作为优化目标,设计电动汽车规模化充电接入配电网柔性负荷多目标优化函数,同时引入分布熵设计惯性权重更新策略,优化PSO算法;最后,采用改进的PSO算法在函数约束条件的基础上实现配电网的柔性负荷控制。测试结果表明,所提出的方法可准确分析用户的充电需求,降低配电网负荷波动峰值及网损。

基于动量自适应学习率PSO-BP神经网络的钻速预测模型研究

机械钻速(rate of penetration,ROP)是钻井作业优化和减少成本的关键因素,钻井时有效地预测ROP是提升钻进效率的关键。由于井下钻进时复杂多变的情况和地层的非均质性,通过传统的ROP方程和回归分析方法来预测钻速受到了一定的限制。为了实现对钻速的高精度预测,对现有BP (back propagation)神经网络进行优化,提出了一种新的神经网络模型,即动态自适应学习率的粒子群优化BP神经网络,利用录井数据建立目标井预测模型来对钻速进行预测。在训练过程中对BP神经网络进行优化,利用启发式算法,即附加动量法和自适应学习率,将两种方法结合起来形成动态自适应学习率的BP改进算法,提高了BP神经网络的训练速度和拟合精度,获得了更好的泛化性能。将BP神经网络与遗传优化算法(genetic algorithm,GA)和粒子群优化算法(particle swarm optimization,PSO)结合,得到优化后的动态自适应学习率BP神经网络。研究利用XX8-1-2井的录井数据进行实验,对比BP神经网络、PSO-BP神经网络、GA-BP神经网络3种不同的改进后神经网络的预测结果。实验结果表明:优化后的PSO-BP神经网络的预测性能最好,具有更高的效率和可靠性,能够有效的利用工程数据,在有一定数据采集量的区域提供较为准确的ROP预测。

Data-based Fault Tolerant Control for Affine Nonlinear Systems Through Particle Swarm Optimized Neural Networks

In this paper, a data-based fault tolerant control(FTC) scheme is investigated for unknown continuous-time(CT)affine nonlinear systems with actuator faults. First, a neural network(NN) identifier based on particle swarm optimization(PSO) is constructed to model the unknown system dynamics. By utilizing the estimated system states, the particle swarm optimized critic neural network(PSOCNN) is employed to solve the Hamilton-Jacobi-Bellman equation(HJBE) more efficiently.Then, a data-based FTC scheme, which consists of the NN identifier and the fault compensator, is proposed to achieve actuator fault tolerance. The stability of the closed-loop system under actuator faults is guaranteed by the Lyapunov stability theorem. Finally, simulations are provided to demonstrate the effectiveness of the developed method.

自适应卡尔曼滤波与PSO-GA-BP算法的机器人误差补偿

采用七轴机器人设备夹持激光器的方式对某型号发射筒进行切割开孔加工。在加工过程中,因轨迹精度和绝对定位精度较低,容易对型号产品发射筒产生损伤和误差切割等问题,运用D-H算法建立七轴机器人理想模型,运用正逆运动学数值算法对理想模型进行验证,运用理想模型的理论位姿参数和激光跟踪仪的测量位姿参数基于Sage-Husa自适应卡尔曼滤波求解七轴机器人真实位姿坐标信息,得到理想位姿参数和真实位姿坐标信息的关节误差,然后结合粒子群优化-遗传算法-BP神经网络联合算法对七轴机器人建立误差预测模型,采用七轴机器人理论位姿参数作为输入样本,真实位姿与理论位姿的各关节角度差作为输出样本,通过库卡机器人Workvisual 5.0软件按照模型输出值对七轴机器人的各关节角度值进行补偿。经过仿真实验和加工,各关节误差补偿后的七轴机器人轨迹误差和绝对定位误差减小72%,满足工艺要求。

基于改进AHP-PSO的三模盾构掘进模式地质适应性研究

为提出一种可靠的复合盾构各掘进模式地质适应性分析方法,根据地质条件、地质风险、设计参数和工程需求评估影响盾构掘进的关键参数,并基于层次分析法(analytic hierarchy process,AHP)算法建立三模盾构的土压、泥水、隧道掘进机(tunnel boring machine,TBM)3种掘进模式的地质适应性评价模型。同时,通过混合逻辑结构改进AHP算法,并结合粒子群优化(particle swarm optimization,PSO)算法提高了其一致性检验和权重求解的能力。最后,以广州地铁7号线二期工程萝岗-水西区间三模式盾构施工工程为例进行三模式盾构地质适应性分析及掘进模式选取,得到的掘进模式选取方案在实际工程应用中取得了较好的掘进质量和掘进效率。该工程证实研究成果能对相关工程施工提供可靠的掘进模式选取方法。

无人驾驶汽车跨区域的APSO联合任务卸载优化

为了解决车路协同中无人驾驶汽车跨区域计算任务卸载问题,构建了一种无人驾驶汽车和路侧单元(road side unit,RSU)的联合任务卸载优化模型,旨在将计算任务的总能耗和时延的加权和最小化,即求出计算任务的总能耗和时延的加权和的最小值,为此提出自适应粒子群优化算法(adaptive particle swarm optimization,APSO)优化车辆计算任务卸载过程中的任务卸载策略和任务发射功率来达到计算任务的总能耗和时延的加权和的最小值。结果表明:基于APSO的无人驾驶汽车的跨区域联合任务卸载优化模型能显著降低无人驾驶汽车计算任务的总能耗和时延的加权和,同时对于所构建的跨区域联合任务卸载优化模型采用APSO求解优于采用模拟退火算法(simulated annealing,SA)和遗传算法(genetic algorithm,GA)求解。

基于角域特征PSO的海面目标HRRP识别方法

针对特征空间中各类海面目标特征混叠严重和高分辨距离像(high resolution range profile, HRRP)的角度特征利用率低的问题,提出了一种基于角域特征粒子群优化(particle swarm optimization, PSO)的海面目标HRRP识别方法。该方法引入HRRP的角度信息优化特征空间,增加特征空间的整体可分性;利用自适应分帧算法对特征空间进行角域划分,增加特征空间的局部可分性,并利用PSO算法确定特征空间角域划分时最优的单帧最小样本数目,增强方法的鲁棒性与适用性。实验结果表明,通过将特征空间优化和区域划分进行结合,可以有效提升多类海面目标的分类识别性能,PSO算法可以有效增强方法的抗误差性和抗噪鲁棒性。

基于改进DPSO非退出故障下多无人机任务规划

针对非退出故障下多无人机(unmanned aerial vehicle,UAV)协同任务规划问题,提出了一种基于混合策略改进的离散粒子群算法(mixed strategy improved discrete particle swarm optimization,MSDPSO)。该方法首先采用Sobol序列进行种群初始化,提高解空间的覆盖率;然后,提出非线性时变策略,加快算法的收敛速度;并引入柯西算子,增强离散粒子群算法的搜索空间;同时,还提出自适应交叉学习策略,丰富种群多样性,进而提升算法的全局寻优能力。综合改进的离散粒子群算法不仅加快了收敛速度,并且解的最优性也得到了提高。此外,运用三次样条插值算法进行无人机航迹规划,最后,将改进算法在三维空间中进行无人机故障前后的对比仿真实验,结果表明:所设计的算法具有显著的寻优有效性,为部分无人机发生轻微故障后,多机协同执行任务规划的问题提供了理论依据。

基于PSO算法的反无地基战术激光系统部署方法

现代战争中,传统防空系统难以有效且高效费比地杀伤无人机集群目标,地基激光系统已成为要地防御场景下反无人机集群的重要手段。研究地基激光系统部署将有助于充分发挥地基激光系统的作战能力。基于功率密度概念推导了地基激光系统对匀速直线飞行无人机目标的毁伤模型,在此基础上设计了一种评价部署方案优劣的适应度函数,利用粒子群优化算法给出了在不同可部署激光系统规格、数量下,面对不同无人机可能来袭方位、高度、速度下的优化部署方案,并与将全部激光系统部署于要地中心的方案以及随机方案进行了比较,验证了算法给出方案的正确性。

智能算法的亚群优化策略综述

群智能算法的优化是提升群智能算法性能的一个主要途径,随着群智能算法越来越广泛地运用到各类模型优化、生产调度、路径规划等问题中,对智能算法性能的要求也越来越高。亚群策略作为一种优化群智能算法的重要手段,能够灵活地平衡算法的全局勘探能力和局部开发能力,已经成为群智能算法的研究热点之一。为了促进亚群优化策略的发展和应用,对动态亚群策略、基于主从范式的亚群策略和基于网络结构的亚群策略进行了详细调查,阐述了各类亚群策略的结构特点、改进方式和应用场景。最后,总结了亚群策略目前存在的问题以及未来的研究趋势和发展方向。

引入PID反馈的SHAEKF算法估算电池SOC

电池荷电状态(SOC)的估算精度是电动汽车电池组的重要指标。为提升SOC估算精度,在融合Sage-Husa扩展卡尔曼滤波(SHEKF)算法与自适应扩展卡尔曼滤波(AEKF)算法的基础上,增加比例积分微分(PID)反馈环节,形成改进算法。采用粒子群优化(PSO)算法对二阶RC等效电路模型进行参数辨识;用开源电池数据集对模型和算法进行实验和分析。改进的SHAEKF算法在电池动态应力测试(DST)、北京动态应力测试(BJDST)和美国联邦城市驾驶(FUDS)等工况下的平均估计误差都在1%以内,与单纯的融合算法SHAEKF算法相比,最大误差可减小5%。

基于PSO改进深度置信网络的滚动轴承故障诊断

针对深度置信网络(Deep Belief Network,DBN)用于轴承故障诊断时,网络层结构调试比较费时等问题,提出一种基于粒子群优化(Particle Swarm Optimization,PSO)的DBN算法,以及基于该算法的轴承故障诊断模型。该模型利用PSO算法优选DBN网络结构,并通过自适应时刻估计法微调模型参数,随后运用具有最优结构的DBN模型直接从原始振动信号中提取低维故障特征,并将其输入到Soft-max分类器中识别轴承的故障模式。该算法与支持向量机、BP神经网络、DBN、堆叠降噪自编码等方法进行对比分析,实验结果表明,PSO改进的DBN算法具有更高的准确率以及更好的鲁棒性。

面向动态公交的离散分层记忆粒子群优化算法

随着智慧城市、智慧交通的发展,移动互联网和公交智能基础设施以及相关数据的不断完善,通过用户手机预约公交服务的新型公交运营方式——动态公交,已经成为许多城市公交发展的重要探索方向。但目前,对动态公交问题的建模、算法研究不足。基于这一研究现状,提出动态公交问题模型和面向动态公交的离散分层记忆粒子群优化(PSO)算法。首先给出动态公交问题的目标函数和约束条件,给出动态公交问题的解的形式,并定义解的编辑距离;其次提出使用数据驱动的预计算路径集生成PSO算法的优质初始解的方法,给出基于解的编辑距离的PSO算法中粒子的变异概率和自适应收敛系数的计算方式;最后提出将粒子群分层求解的方法,其中低层粒子群可复用、可继承,从而减少单时间片内、时间片间复制和重初始化带来的性能损耗。基于重庆市北碚区蔡家岗街道的真实场景和亿级历史数据建立仿真环境进行实验,实验结果表明:相对于不分层PSO算法,分层PSO算法通过复用和继承能缩短超80%计算用时;自适应参数和变异机制能帮助算法更稳定地收敛到更优解;相对于传统公交系统,动态公交能在同等运力限制下,提高22%的乘客接单率,节省39.1%的乘客出行时间,所提算法能满足公交运营商在片区内进行动态公交调度的需求;相对于对比算法,所提算法平均缩短了85.3%的计算用时,并且在仅耗用80%里程的情况下提高了至少12%的接单率。

基于MAPSO算法的小波神经网络训练方法研究

为提高小波神经网络(Wavelet Neural Network,WNN)的建模质量,针对标准粒子群(Particle Swarm Optimization,PSO)算法优化WNN存在的早熟和局部收敛问题,提出一种基于多粒子信息共享(Multi-particle information share)和自适应惯性权重(Adaptive inertia weight)策略的PSO方法(MAPSO)用于WNN训练。多粒子信息共享采用多粒子信息来修正各粒子下一次的行动策略,以降低粒子陷入局部最优的可能性;惯性权重自适应调整根据群体早熟收敛程度,按个体适应度自适应调整惯性权重,以使陷入局部最优粒子跳出。同时,给出了算法实现的基本流程。仿真结果表明MAPSO算法既具有PSO算法的简捷性,又能够提高WNN学习速度和精度及全局搜索能力,是小波网络的有效训练方法。