Unmanned wave glider heading model identification and control by artificial fish swarm algorithm

We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,the rigid-flexible multi-body system of the UWG was simplified as a rigid system composed of“thruster+float body”,based on which a planar motion model of the UWG was established.Second,we obtained the model parameters using an empirical method combined with parameter identification,which means that some parameters were estimated by the empirical method.In view of the specificity and importance of the heading control,heading model parameters were identified through the artificial fish swarm algorithm based on tank test data,so that we could take full advantage of the limited trial data to factually describe the dynamic characteristics of the system.Based on the established heading motion model,parameters of the heading S-surface controller were optimized using the artificial fish swarm algorithm.Heading motion comparison and maritime control experiments of the“Ocean Rambler”UWG were completed.Tank test results show high precision of heading motion prediction including heading angle and yawing angular velocity.The UWG shows good control performance in tank tests and sea trials.The efficiency of the proposed method is verified.

Robust Hybrid Artificial Fish Swarm Simulated Annealing Optimization Algorithm for Secured Free Scale Networks against Malicious Attacks

Due to the recent proliferation of cyber-attacks,highly robust wireless sensor networks(WSN)become a critical issue as they survive node failures.Scale-free WSN is essential because they endure random attacks effectively.But they are susceptible to malicious attacks,which mainly targets particular significant nodes.Therefore,the robustness of the network becomes important for ensuring the network security.This paper presents a Robust Hybrid Artificial Fish Swarm Simulated Annealing Optimization(RHAFS-SA)Algorithm.It is introduced for improving the robust nature of free scale networks over malicious attacks(MA)with no change in degree distribution.The proposed RHAFS-SA is an enhanced version of the Improved Artificial Fish Swarm algorithm(IAFSA)by the simulated annealing(SA)algorithm.The proposed RHAFS-SA algorithm eliminates the IAFSA from unforeseen vibration and speeds up the convergence rate.For experimentation,free scale networks are produced by the Barabási–Albert(BA)model,and real-world networks are employed for testing the outcome on both synthetic-free scale and real-world networks.The experimental results exhibited that the RHAFS-SA model is superior to other models interms of diverse aspects.

Development of an Artificial Fish Swarm Algorithm Based on aWireless Sensor Networks in a Hydrodynamic Background

The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.

Artificial Fish Swarm Optimization with Deep Learning Enabled Opinion Mining Approach

Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.

基于改进Fish-Search算法的机弹协同航线规划

文中提出利用改进的鱼群算法解决一类机弹协同问题中飞机协同航线规划问题的方法。首先对此类协同问题进行了数学描述,综合考虑了机弹协同中的可通视性、航线危险代价、最大协同距离和机弹相对方位等多种关键因素,建立了机弹协同规划中飞机航线的约束条件和评价指标;针对此类规划问题的特点,提出了利用鱼群算法进行求解的方法;通过对鱼群算法进行禁忌公告和生存机制等改进,提高了规划算法的收敛速度,对改进前后的算法进行了仿真对比;最后,通过仿真证明文中所提出的改进算法能够解决此类机弹协同航线规划问题。

Approach to WTA in air combat using IAFSA-IHS algorithm

In this paper, a static weapon target assignment（WTA）problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm（IAFSA-IHS） is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.

Research on Flight First Service Model and Algorithms for the Gate Assignment Problem

Aiming at the problem of gate allocation of transit flights,a flight first service model is established.Under the constraints of maximizing the utilization rate of gates and minimizing the transit time,the idea of“first flight serving first”is used to allocate the first time,and then the hybrid algorithm of artificial fish swarm and simulated annealing is used to find the optimal solution.That means the fish swarm algorithm with the swallowing behavior is employed to find the optimal solution quickly,and the simulated annealing algorithm is used to obtain a global optimal allocation scheme for the optimal local region.The experimental data show that the maximum utilization of the gate is 27.81%higher than that of the“first come first serve”method when the apron is not limited,and the hybrid algorithm has fewer iterations than the simulated annealing algorithm alone,with the overall passenger transfer tension reducing by 1.615;the hybrid algorithm has faster convergence and better performance than the artificial fish swarm algorithm alone.The experimental results indicate that the hybrid algorithm of fish swarm and simulated annealing can achieve higher utilization rate of gates and lower passenger transfer tension under the idea of“first flight serving first”.

SVC Video Transmission Optimization Algorithm in Software Defined Network

Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.

考虑系统稳定边界的同步调相机励磁与升压变参数联合优化

现有提升调相机动态无功特性的参数优化方法侧重于电磁参数的优化,这给生产企业带来较高的工艺要求和较大的成本压力。针对该问题提出考虑系统稳定约束的调相机励磁系统及升压变参数联合优化方法,分析其对电磁参数优化的可替代性。首先,推导了基于Park模型下调相机的无功频域特性,与6阶实用模型下的无功频域特性对比,基于调相机的Park模型可提升调相机动态无功特性的分析精度。然后,提出根据调相机并网系统的稳定边界确定参数的优化区间,采用频域灵敏度方法确定重点参数,并基于人工鱼群算法进行参数优化。最后,通过仿真结果表明,励磁系统与升压变参数的联合优化,可获得与仅优化电磁参数时相近的调相机动态无功性能,验证了电磁参数优化的可替代性,从而降低调相机的制造成本,扩大同步调相机的应用场合和范围。

基于PSO与AFSA的GNSS整周模糊度种群融合优化算法

载波相位测量是实现全球导航卫星系统(Global navigation satellite system, GNSS)快速高精度定位的重要途径,而准确解算整周模糊度是其中的关键步骤之一.粒子群算法(Particle swarm optimization, PSO)收敛速度快但易陷入局部最优,人工鱼群算法(Artificial fish swarm algorithm, AFSA)全局优化性能好但收敛速度慢,因此融合两种算法的优点,提出一种GNSS整周模糊度种群融合优化算法(PSOAF).首先,通过载波相位双差方程求解整周模糊度的浮点解和对应的协方差矩阵.然后,采用反整数Cholesky算法对模糊度浮点解作降相关处理.其次,针对整数最小二乘估计的不足通过优化适应度函数来提高算法的收敛性和搜索性能.最后,通过PSOAF算法对整周模糊度进行解算.通过经典算例和试验研究表明:PSOAF算法可以更快地收敛于最优解,搜索效率也更为出色,解算的基线精度可以控制在10 mm以内,在短基线的实际情况下具有较高的应用价值.

基于改进小波神经网络的实时系统任务流量预测方法

针对当前航空装备实时系统对非周期实时任务无法预知难以实现可靠调度的困难,开展对航空装备实时系统非周期任务流量预测方法的研究。以小波神经网络为基础结合航空装备实时系统的特性建立任务流量预测模型,并提出利用人工鱼群算法对小波预测模型关键参数进行优化,避免陷入局部最优解,最终构建一种人工鱼群算法改进的小波神经网络任务流量预测系统。利用提出的预测模型开展实时任务流量预测对比仿真实验,实验结果表明,建立的基于改进小波神经网络的实时系统任务流量预测系统对非周期实时任务具有较高的预测精度,预测效果优于原始小波神经网络模型及T-S模糊神经网络模型。

基于人工鱼群-遗传算法的多品种小批量零件数控加工工艺优化研究

基于多品种小批量零件加工成本高的问题,基于人工鱼群-遗传算法(AFSA-GA)构建了数控机床能耗模型,以实现零件加工能耗下降。首先,将数控机床功率划分为各工序功率模型,基于功率模型与工作时间关系得出机床运转能耗模型,结合产品表面粗糙度模型,对各工序能耗模型及整体粗糙度进行归一化处理,形成整体能耗模型;其次,以能耗及粗糙度为目标函数,建立AFSA-GA算法,通过对各工序能耗求解得出最适当的机床功率及其所对应的能耗和表面粗糙度;最后,针对所获得的最优功率,进行优化结果的验证,为五轴机床的实际加工提供解决方案。

基于CSA-AFSA算法的集装箱港口连续型泊位分配优化

为提升集装箱港口运营效率,笔者研究了考虑潮汐因素与泊位偏好的连续型泊位分配问题。引入了船舶时空矩形不可重叠约束和潮汐时间窗约束,构建以最小化船舶等待、延迟离港、泊位偏离以及在港期间油耗费用和最小为目标的混合整数线性规划模型;根据模型特征,采用CPLEX求解软件、鱼群算法、布谷鸟搜索算法和布谷鸟鱼群混合算法进行求解,以计划周期为36 h的20个不同规模的船舶到港数据为研究算例,通过算例求解得到符和潮汐时间窗、泊位偏好等要求的泊位分配方案。算例求解表明:算例规模较小时,CPLEX可以在较短时间内求出最优泊位分配方案;算例规模较大时,CPLEX求解时间较长,布谷鸟鱼群混合算法可以在平均3 min内求出与CPLEX差距为0.39%~4.20%的次优解;不同算法间的对比表明,布谷鸟鱼群混合算法求解能力更优,混合算法所得泊位分配方案中,乘潮船舶的进出港时刻均在潮汐高水位时段,且85%以上的船舶在偏好泊靠点200 m内接受装卸服务。

基于人工鱼群算法的篮球跳投轨迹实时跟踪

篮球运动轨迹跟踪方法由于轨迹特征提取效果差,导致跟踪误差高,提出一种基于人工鱼群算法的篮球跳投轨迹实时跟踪方法。提取三维坐标系下图像中篮球边缘轮廓信息,通过滤波函数消除篮球跳投图像噪声,基于人工鱼群算法提取图像中篮球跳投轨迹特征,寻找篮球运动轨迹的最优解集,改进篮球实时跟踪匹配路径,形成轨迹跟踪函数。实验结果可知,该方法的平均轨迹跟踪误差为18.28mm,与常规方法相比降低了6.22mm以上。因此,该跟踪方法的篮球轨迹跟踪精度更高,并且实时跟踪轨迹与真实轨迹更吻合。

基于改进人工鱼群算法的车辆可靠性估计技术

在零部件研发过程中,对零部件进行可靠性估计至关重要,而威布尔分布被广泛用于模拟失效分布,因此对威布尔分布的参数估计对零部件可靠性预测和分析非常关键。对此,文章提出了一种用于车辆零部件可靠性评估的基于改进人工鱼群算法的新型威布尔分布估计方法,首先从理论上构建了威布尔分布的最大似然估计模型,并对相关模型进行详细的介绍;然后基于人工鱼群算法求解效率低和质量不高的缺陷,通过引入Levy飞行策略和感知距离自适应调节策略对原始人工鱼群算法其进行改进;最后,运用改进人工鱼群算法进行蒙特卡洛模拟仿真试验,进而对威布尔分布参数拟合效果进行比较和分析。结果表明,对于威布尔分布的参数估计,文章所提出的改进人工鱼群算法比其他元启发式算法给出了更准确的参数估计,能够为汽车零部件开发与可靠性评估提供科学有效的指导。

超网络体系作战下的打击目标优选模型

针对当前进行海上作战体系目标优选分析与决策时对打击代价考虑不足的问题,提出综合考虑目标节点重要度和打击费效度的网络节点分析模型。利用超网络构建海上作战体系网络模型,通过度和介数等指标评估网络中节点的重要度;利用打击费效比为指标评估网络中节点的打击代价,进而将目标分析与选择问题转化为多目标优化问题,建立寻优模型,并通过人工鱼群算法进行寻优求解。最后对模型进行案例仿真应用,通过专家Delphi法评估检验,结果表明所建立的模型方法可行,对水面舰队体系的目标分析与选择具有借鉴作用。

面向能源互联的主动配电网选址定容研究

传统主动配电网选址定容忽略了能源系统多能互补协调特性,导致成本较高。为此,提出一种基于能源互联的主动配电网选址定容方法。基于能源互联建立目标函数,采用全寿命周期成本理论计及设备购置成本、安装成本、运行维护成本、系统运行成本以及残值回收,以概率形式的配电网选址定容综合成本作为目标函数,构建必要约束模型,包括设备配置容量约束、系统供能可靠性约束、功率平衡约束、设备运行约束。在此基础上,采用改进人工鱼群算法对选址定容算法进行求解。仿真实验结果表明:接入分布式电源相比不接入分布式电源的主动配电网选址定容所需成本更小,改进后的人工鱼群算法计算得出的网损和无功补偿总成本更低,所提方法相对于其他方法的选址定容网损成本和无功补偿成本更低,说明所提方法可以减少主动配电网选址定容的成本,实用性效果较优。

基于AFSA-SVM动态光谱的血液识别研究

血液是一种受管制的特殊遗传生物资源。针对传统血液光谱检测中易氧化变质的问题,采用基于仿生血管的动态共聚焦拉曼荧光光谱,开展了猪、马、鸽、鸡、鸭、鹅等六种家禽家畜的血液物种鉴别研究。原始光谱的预处理过程包括去基线、平滑和归一化等。采用线性判别分析对光谱数据进行降维处理,继而用支持向量机建立识别模型,选用高斯核函数,通过人工鱼群算法优化支持向量机的参数C和γ,使其分类准确率最高,最优的C和γ分别为0.2和0.134。人工鱼群-支持向量机模型识别准确率达到97.2%,基于仿生血管的动态共聚焦拉曼荧光光谱可以满足血液安全高效的检测要求,用人工鱼群算法优化支持向量机参数的算法模型表现出较好的分类效果。

基于神经网络和人工鱼群算法的惯性延时微通道优化

为了保证中、小口径弹引信的炮口安全性控制要求,设计了具有肋板阻尼结构的惯性延时微通道,同时为了保证其具有稳定的延时性能,研究了该微通道在高离心转速下的延时响应性能。采用了神经网络模型和人工鱼群算法对蛇形微通道内肋板的结构位置进行优化设计。用两相流水平集模型以微通道的延迟时间为研究对象进行了模拟仿真,得到180组样本数据,分析发现肋板结构在微通道内的不同位置与延迟时间呈现出高度的非线性关系。根据样本数据建立神经网络模型用以拟合设计变量与优化目标之间的映射函数,并采用人工鱼群算法对神经网络模型拟合的映射函数的参数进行优化。结果表明,经过结构优化之后,在1 000 g离心环境下微通道中流体的延迟时间从最短的11.446 ms提升到了25.054 ms,延时效果得到了显著提升。最后研究了优化后的结构在中、小口径弹引信使用环境下的延时特性,验证了其满足大部分中、小口径弹引信的延时控制要求。

基于改进人工鱼群算法的蠕虫机器人路径规划

针对人工鱼群算法在机器人路径规划中存在路径长、精度不高、易陷入局部最优等问题,提出了一种改进的人工鱼群算法,旨在提高算法效率及精度。首先,在算法觅食行为中加入寻优循环,减少算法在路径规划中选取位置点的随机性,使机器人能够更快地走向目标点;其次,融合禁忌搜索算法,通过引入禁忌表来记录算法陷入局部最优的路径,使算法在选取新位置点时能够避开局部最优区域,避免算法在局部过度循环,同时对规划出的路径进行优化处理,删去重复栅格点之间的路径,保证路径中没有重复的栅格点;最后,将改进后的人工鱼群算法应用在一种新型的三维栅格地图中。实验结果表明:相较于其他对比算法,在地图1、2、3中改进人工鱼群算法所取得的平均路径长度分别减少了10%、15%、30%,在复杂地图中路径规划的成功率提高了75%。