自适应蚁群算法的无人机航迹规划方法

为了提高无人机完成任务效率,在执行攻击任务前必需规划设计出高效的无人机飞行航路.提出了一种Q-学习的自适应蚁群算法的无人机航路规划方法,建立了基于真实地形数据和火力威胁区的威胁模型;针对传统蚁群算法在搜索过程中出现停滞现象,提出的Q-学习的自适应蚁群算法有效地解决了这一缺陷.并使用该算法对无人机的攻击任务航路进行了仿真计算,仿真结果表明该方法是一种有效的航路规划方法.     

基于改进A*算法的无人机动态航迹规划

在无人机航路规划问题的研究中,针对传统 A*算法在航路规划中的不足,提出了一种增加约束条件的广义搜索 A*算法,并将该算法应用到动态航路规划中。该算法在节点搜索中解决了 A*算法大空间搜索的复杂程度,而且用重新估价代价值来满足无人机的实时性,最后用平滑处理算法使规划的航路满足无人机的机动性能约束。仿真结果表明,该算法性能优于传统 A*算法,具有很好的实时性,适用于无人机航路规划的工程应用。     

无人机航路规划研究

通过对无人机航路规划的研究,对无人机航路规划问题进行了概括和总结,介绍了无人机航路规划流程,分析了无人机航路规划的约束条件,阐述了目前国内外应用和研究的几种航路规划算法,并对无人机航路规划算法的发展趋势进行了展望。     

基于作战效能的无人机航路规划研究

综合考虑目标分配与航路规划全过程,提出一种基于作战效能的无人机航路规划方法.在航路规划层利用变长染色体遗传算法规划无人机的初始航路,在协同规划层则以作战效能为指标,运用遗传粒子群优化算法进行任务优化分配,最终得到一个备选航路集.然后,利用协同算法可在备选航路集中找到满足要求的任务航路.该方法不仅能够规划出单机或多机协同全局航路,而且还可根据威胁环境或目标变化适时修正航路,并始终保证较高攻击效能.     

通信约束下的多无人机协同航路规划

针对存在通信约束的多无人机协同航路规划问题,在考虑多无人机同时到达目标点和避免相互碰撞的条件下,使用改进的A*算法规划出多无人机飞行的原始航路;通过不断计算和比较无人机间的距离来限制无人机的飞行,使无人机之间的距离始终保持在允许通信距离范围内;通过减小最大允许通信距离和增大最小安全距离来消除通信时间延迟对协同航路规划的影响,从而建立了存在通信距离限制和通信时间延迟条件下的多无人机协同航路规划算法。仿真结果验证了该算法的有效性。     

基于Voronoi图和离散粒子群优化的无人机航迹规划

航迹规划是根据任务目标规划出满足约束条件的飞行轨迹,是实现无人机突防攻击的关键技术.由于无人机航迹规划的复杂性,提出了一种无人机分层航迹规划的方法,该方法首先由Voronoi图生成初始航路,然后考虑各约束条件,赋予各航路相应的权值,最终应用离散型粒子群算法搜索出满意的规划解.仿真结果表明,该方法规划效率高,占用内存少,...     

无人机航路规划算法研究

针对无人机航路规划问题,研究了一种基于元胞蚂蚁算法的无人机航路规划方法.元胞蚂蚁算法对基本蚁群算法进行了系列改进,并将元胞邻居演化和改进后的蚂蚁寻优相结合,有效地克服了基本蚁群算法的收敛速度慢、易于过早陷入局部最优的缺点,提高了算法的运算精度,从而为解决复杂战场环境下无人机航路规划这一多约束多目标优化问题提供了一条可行...     

基于流水避石原理的无人机三维航路规划

<正>对一种新颖的基于流水避石原理的无人机三维航路规划技术进行了阐述。复杂地形条件下具有全局最优性的无人机三维航路规划问题,不但要考虑地形对飞行安全的影响,还要考虑无人机自身的性能约束,最终规划出三维空间内可供无人机实际飞行的平滑航路。传统航路规划算法在计算复杂度、航路平滑性等方面难以令人满意。流水避石航路规划算法受自然界流水避开岩石并最终到达目标点的现象启发,通过提取复杂     

遗传算法在无人机航路规划中的应用

随着无人机在现代战争中的作用日趋重要,对无人机航路规划的研究也越来越多。分析了无人机航路规划涉及的因素和处理过程,介绍了遗传算法的相关内容。根据无人机航路规划涉及因素多、计算量大的特点,采用遗传算法进行航路规划。给出了遗传算法编码方法以及算法参数、终止条件的设置方法,提供了一个应用示例,并给出了一些改进的建议。     

基于卡尔曼滤波和D*算法的动态目标航路规划

针对目前运动目标航路规划存在的滞后性和计算量过大等问题, 提出一种适合于动态环境下动态目标的航路规划方法。首先, 采用卡尔曼滤波算法对目标下一步的位置进行预测, 然后, 调用D*算法以无人机当前位置为起点, 目标预测位置为终点进行航路规划。同时, 为了减少预测误差和保证高效的航路规划效率, 该方法引用了动态的目标观测周期。由于卡尔曼滤波算法是按照递推公式来预测无人机下一步状态的, 不需要很多的历史数据, 所以该预测算法不仅减少了计算量, 而且由于采用超前规划, 使算法具有了很强的实时性。从仿真结果来看, 该算法有效地缩短了航程, 减少了到达目标位置的时间。     

一种基于Kalman滤波和粒子群优化的测试数据生成方法

为减少进化代数,提高路径覆盖成功率,提出了多邻域Kalman滤波PSO测试数据生成方法.在该方法中将粒子固定划分到不同邻域中,各邻域内指定一个粒子向全局最优粒子学习,其余各粒子向所在邻域中最优粒子学习,而全局最优粒子利用无速度项的简化PSO进化.在此过程中,除全局最优粒子外的各粒子利用Kalman滤波方程更新粒子的位置.实验表明,相较于基本PSO和其他PSO方法,即使是覆盖困难的路径,本文方法也具有进化代数少、路径覆盖成功率高及性能稳定的特点.     

Monkey King Evolution: an enhanced ebb-tide-fish algorithm for global optimization and its application in vehicle navigation under wireless sensor network environment

Optimization algorithms are proposed to maximize the desirable properties while simultaneously minimizing the undesirable characteristics. Particle Swarm Optimization (PSO) is a famous optimization algorithm, and it has undergone many variants since its inception in 1995. Though different topologies and relations among particles are used in some state-of-the-art PSO variants, the overall performance on high dimensional multimodal optimization problem is still not very good. In this paper, we present a new memetic optimization algorithm, named Monkey King Evolutionary (MKE) algorithm, and give a comparative view of the PSO variants, including the canonical PSO, Inertia Weighted PSO, Constriction Coefficients PSO, Fully-Informed Particle Sawrm, Cooperative PSO, Comprehensive Learning PSO and some variants proposed in recent years, such as Dynamic Neighborhood Learning PSO, Social Learning Particle Swarm Optimization etc. The proposed MKE algorithm is a further work of ebb-tide-fish algorithm and what’s more it performs very well not only on unimodal benchmark functions but also on multimodal ones on high dimensions. Comparison results under CEC2013 test suite for real parameter optimization show that the proposed MKE algorithm outperforms state-of-the-art PSO variants significantly. An application of the vehicle navigation optimization is also discussed in the paper, and the conducted experiment shows that the proposed approach to path navigation optimization saves travel time of real-time traffic navigation in a micro-scope traffic networks.     

Automata Based Hybrid PSO–GWO Algorithm for Secured Energy Efficient Optimal Routing in Wireless Sensor Network

The main objective in wireless sensor networks is to exploit efficiently the sensor nodes and to prolong the lifetime of the network. The discussion of energy is a significant concern to extend the lifetime of the network. Moreover, a nature inspired hybrid optimization approach called hybrid Particle Swarm Optimization–Grey Wolf Optimizer (PSO–GWO) is used in this work to efficiently utilize the energy and to transmit the data securely in an augmented path. A Learning Dynamic Deterministic Finite Automata (LD²FA) has been innovated and initiated to learn the dynamic role of the environment. LD²FA is mainly used to provide the learned and accepted string to hybrid PSO–GGWO so that the routes are optimized. Hybrid PSO–GWO is used to choose the optimal next node for each path to obtain the optimal route. The simulation results are obtained in MATLAB for 100–700 sensor nodes in a region of 500 × 500 m² which demonstrate that the proposed LD²FA based Hybrid PSO–GWO algorithm obtains better results when compared with existing algorithms. It is observed that LD²FA based Hybrid PSO–GWO has an increase of 18% and 48% betterment in lifetime of the network than PSO and GLBCA, nearly 57% and 75% increase in network lifetime when compared with GA and LDC respectively. It also shows an improvement of 24% increase compared to cluster-based IDS, nearly a rise of 90% throughput when compared with lightweight IDS. The consumption of energy is reduced by 13% and 15% than PSO and GA and an increase of 15% utilization of energy than LDC. Therefore, LD²FA based Hybrid PSO–GWO is been considered to efficiently utilize energy in an optimal route.

     

Performance analysis of multi‐stage interference cancellation for ultra‐wide band multiple‐access communication systems

In this contribution, a novel particle swarm optimization (PSO)‐based multi‐user detector (MUD) aided time‐hopping ultra‐wide band (TH‐UWB) system has been investigated in the multi‐path channel model. In this approach, the PSO‐based MUD employs the output of the Rake receiver as its initial value to search for the best solution which results in a formulated optimization mechanism. By taking advantage of the heuristic values and the collective intelligence of PSO technique, the proposed detector offers almost the same bit error rate (BER) performance as the full‐search‐based optimum MUD does, while greatly reducing the potentially computational complexity. Simulation results have been provided to examine the evolutionary behavior and the detection performance of the proposed PSO‐based MUD in both the additive white Gaussian noise and the multi‐path fading channel. Copyright © 2011 John Wiley & Sons, Ltd.     

基于PSO的OBS路由优化选择算法研究

光突发交换(OBS)被认为是下一代光交换技术.利用粒子群优化算法(PSO)对OBS网络路由优化选择问题进行了研究和分析,仿真结果表明,基于PSO的OBS路由算法在计算代价方面要优于传统的最短路径算法,结论对改进OBS的路由选择协议有一定的理论指导意义.     

物联网感知层多路径传输策略研究

多路径数据传输是无线传感器网络亟需解决的一个关键问题.本文针对节点故障、链路失效和外界干扰影响网络稳定性和可靠性,提出一种基于混合蛙跳算法的无线传感器网络多路径传输策略.首先我们详细介绍了蛙跳算法及其原理,之后我们将其应用到无线传感器网络多路径传输策略之中,接着运用混合蛙跳算法对传感网络节点其进行更新、划分、重组以便选择出最优节点建立传输最优路径,提高网络的稳定性和可靠性.通过算法仿真与结果对比提出的算法与AODV、粒子群PSO算法相比,在网络能耗、传输时延、丢包率、连通率和可靠度等方面都具有较好的性能.其中网络能耗比AODV、PSO算法降低了62.5％和35.8％.     

基于粒子群算法的室外配用电场景射线追踪优化方法

为高效地利用射线追踪(ray tracing, RT)方法对室外配用电环境毫米波段进行传播特性研究,提出一种将RT方法与粒子群优化(particle swarm optimization, PSO)算法相结合的RT优化方法.首先进行低分辨率RT,利用距离参数筛选出可能到达接收端的射线发射角度,并将其划分成多个搜索区域;然后在每个搜索区域中利用PSO算法寻找最优路径.该方法的路径损耗仿真结果与传统RT仿真结果以及实测数据都表现出了良好的一致性,场强覆盖预测也和传统RT仿真结果相一致.结果表明,该方法在保证精确度的同时可以有效提高RT计算效率,并避免了传统RT中的接收球问题,具有一定的工程应用价值.     

M‐RPSS: A modified RPSS for path scheduling of mobile sink in wireless sensor network

In wireless sensor networks (WSNs), data gathering is the main concern, since it directly affects the network lifetime and data latency. Rendezvous Point Selection Scheme (RPSS) is a mobile sink node approach; it offers superior performance than its preceding mobile sink schemes like Rendezvous Design for Variable Track (RD‐VT), RD‐VT with Steiner Minimum Tree (RD‐VT‐SMT), and Weight Rendezvous Planning with Steiner Minimum Tree (WRP‐SMT). However, a more uniform distribution of the rendezvous node leads to less energy consumption in WSNs. The more optimum path offers less data latency. In the proposed approach, we use particle swarm optimization (PSO) to find the optimum rendezvous point and adaptive PSO (APSO) to find an optimum path by solving the travelling salesman problem. By rigorous simulation, we prove that modified RPSS (M‐RPSS) increases the network lifetime by more than 10% and decreases the data latency.     

一种基于SDN的CCN集中控制缓存决策方法

在软件定义网络(SDN)和内容中心网络(CCN)融合架构下,为了充分利用控制层对网络拓扑和缓存资源的全局感知,在全网中实现缓存资源的优化使用,提出了一种集中控制的缓存决策优化方案.在该方案中,应用粒子群优化算法(PSO)并且根据节点边缘度、节点重要度以及内容流行度对缓存资源和内容进行集中缓存决策,使得内容在不同的节点进行合理的缓存.仿真结果表明,通过评估缓存大小对缓存性能的影响,PSO缓存决策方法取得了比LCE、PROB缓存决策策略更优的缓存命中率和路径延展率,明显降低了缓存节点的缓存替换数,使得缓存达到了整体缓存优化.     

用改进变异粒子算法实现突发威胁下的无人机航迹规划

针对无人飞行器航迹规划问题,提出一种改进变异粒子群算法及航迹节点拓展法,有效解决了突发威胁下的航迹规划问题,并进行仿真验证。通过引入维量化活性度解决了粒子群算法搜索后期速度下降问题,通过相对坐标转换避免了采用一元多项式函数作为水平航迹丢失部分解的情况。仿真表明,利用改进的变异粒子群算法能够有效地提高搜索速度和精度,适用于突发威胁下的航迹规划问题。