GNN Representation Learning and Multi-Objective Variable Neighborhood Search Algorithm for Wind Farm Layout Optimization

With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.

AUTOMATIC SEARCHING OF CONTROL POINT IN NOAA AVHRR IMAGE

This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established.

An Adaptive Steganographic Algorithm for Point Geometry Based on Nearest Neighbors Search

In this study, we extend our previous adaptive steganographic algorithm to support point geometry. For the purpose of the vertex decimation process presented in the previous work, the neighboring information between points is necessary. Therefore, a nearest neighbors search scheme, considering the local complexity of the processing point, is used to determinate the neighbors for each point in a point geometry. With the constructed virtual connectivity, the secret message can be embedded successfully after the vertex decimation and data embedding processes. The experimental results show that the proposed algorithm can preserve the advantages of previous work, including higher estimation accuracy, high embedding capacity, acceptable model distortion, and robustness against similarity transformation attacks. Most importantly, this work is the first 3D steganographic algorithm for point geometry with adaptation.

Automated registration of wide-baseline point clouds in forests using discrete overlap search

Forest is one of the most challenging environments to be recorded in a three-dimensional(3D)digitized geometrical representation,because of the size and the complexity of the environment and the data-acquisition constraints brought by on-site conditions.Previous studies have indicated that the data-acquisition pattern can have more influence on the registration results than other factors.In practice,the ideal short-baseline observations,i.e.,the dense collection mode,is rarely feasible,considering the low accessibility in forest environments and the commonly limited labor and time resources.The wide-baseline observations that cover a forest site using a few folds less observations than short-baseline observations,are therefore more preferable and commonly applied.Nevertheless,the wide-baseline approach is more challenging for data registration since it typically lacks the required sufficient overlaps between datasets.Until now,a robust automated registration solution that is independent of special hardware requirements has still been missing.That is,the registration accuracy is still far from the required level,and the information extractable from the merged point cloud using automated registration could not match that from the merged point cloud using manual registration.This paper proposes a discrete overlap search(DOS)method to find correspondences in the point clouds to solve the low-overlap problem in the wide-baseline point clouds.The proposed automatic method uses potential correspondences from both original data and selected feature points to reconstruct rough observation geometries without external knowledge and to retrieve precise registration parameters at data-level.An extensive experiment was carried out with 24 forest datasets of different conditions categorized in three difficulty levels.The performance of the proposed method was evaluated using various accuracy criteria,as well as based on data acquired from different hardware,platforms,viewing perspectives,and at different points of time.The proposed method achieved a 3D registration accuracy at a 0.50-cm level in all difficulty categories using static terrestrial acquisitions.In the terrestrial-aerial registration,data sets were collected from different sensors and at different points of time with scene changes,and a registration accuracy at the raw data geometric accuracy level was achieved.These results represent the highest automated registration accuracy and the strictest evaluation so far.The proposed method is applicable in multiple scenarios,such as 1)the global positioning of individual under-canopy observations,which is one of the main challenges in applying terrestrial observations lacking a global context,2)the fusion of point clouds acquired from terrestrial and aerial perspectives,which is required in order to achieve a complete forest observation,3)mobile mapping using a new stop-and-go approach,which solves the problems of lacking mobility and slow data collection in static terrestrial measurements as well as the data-quality issue in the continuous mobile approach.Furthermore,this work proposes a new error estimate that units all parameter-level errors into a single quantity and compensates for the downsides of the widely used parameter-and object-level error estimates;it also proposes a new deterministic point sets registration method as an alternative to the popular sampling methods.

Research on the MPPT of Photovoltaic Power Generation Based on the CSA-INC Algorithm

The existing Maximum Power Point Tracking(MPPT)method has low tracking efficiency and poor stability.It is easy to fall into the Local Maximum Power Point(LMPP)in Partial Shading Condition(PSC),resulting in the degradation of output power quality and efficiency.It was found that various bio-inspired MPPT based optimization algorithms employ different mechanisms,and their performance in tracking the Global Maximum Power Point(GMPP)varies.Thus,a Cuckoo search algorithm(CSA)combined with the Incremental conductance Algorithm(INC)is proposed(CSA-INC)is put forward for the MPPT method of photovoltaic power generation.The method can improve the tracking speed by more than 52%compared with the traditional Cuckoo Search Algorithm(CSA),and the results of the study using this algorithm are compared with the popular Particle Swarm Optimization(PSO)and the Gravitational Search Algorithm(GSA).CSA-INC has an average tracking efficiency of 99.99%and an average tracking time of 0.19 s when tracking the GMPP,which improves PV power generation’s efficiency and power quality.

Quantum search for unknown number of target items by hybridizing fixed-point method with trail-and-error method

For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.

基于SSA-ELM神经网络控制器的光伏MPPT方法

光伏电池板所处环境的非线性变化使得光伏电池的功率保持在最大功率点(maximum power point,MPP)非常困难。传统的最大功率点跟踪(maximum power point tracking,MPPT)方法普遍存在技术缺陷,无法满足当前需求。针对光伏发电MPPT问题,该文提出了一种基于麻雀搜索算法优化的极限学习机(sparrow search algorithm-extreme learning machine,SSA-ELM)神经网络控制器的MPPT方法。与传统技术相比,该MPPT方法在稳定性、速度、超调和MPP的振荡等方面的效果均较好。使用MATLAB/Simulink平台进行仿真实验,验证了所提控制策略及理论分析的正确性。

基于改进蚁群算法的移动机器人路径规划

针对传统蚁群算法在移动机器人路径规划中存在搜索盲目性、收敛速度慢及路径转折点多等问题,提出了一种基于改进蚁群算法的移动机器人路径规划算法。首先,利用跳点搜索(Jump Point Search,JPS)算法不均匀分配初始信息素,降低蚁群前期盲目搜索的概率;然后,引入切比雪夫距离加权因子和转弯代价改进启发函数,提高算法的收敛速度、全局路径寻优能力和搜索路径的平滑程度;最后,提出一种新的信息素更新策略,引入自适应奖惩因子,自适应调整迭代前、后期的信息素奖惩因子,保证了算法全局最优收敛。实验仿真结果表明,在不同地图环境下,与现有文献结果对比,该算法可以有效地缩短路径搜索的迭代次数和最优路径长度,并提高路径的平滑程度。

复杂城市低空无人机安全风险评估与三维路径规划

针对复杂城市环境内低空无人机飞行安全与效率亟待提升的问题,提出了复杂城市低空无人机安全风险评估与三维路径规划方法。首先,设计了无人机越界冲突率、缓冲空域占比指标,建立了无人机地理围栏安全缓冲间距优化模型,对最佳缓冲间距和栅格粒度进行了标定;然后,构建了由人口密度层、遮蔽层和障碍层构成的无人机风险地图,建立了弹道下降和失控滑行两种模式下的无人机对地风险评估模型,生成了精细化、组合化的城市低空概率风险地图;最后,综合利用地理围栏、概率风险地图和跳点搜索算法,对无人机三维路径进行了初始规划和优化重构。结果表明:弹道下降模式的伤亡风险是失控滑行下降模式的5~75倍;与A*算法相比,跳点搜索算法有效减少了飞行路径的转弯数量,缩短了求解时长,更适合规划无人机飞行路径;与不采用风险地图的方法相比,基于风险地图的无人机路径规划减少了50%的较高风险节点,相应的路径长度仅增加了7.2%和11.4%,整体路径节点的伤亡风险明显降低。研究成果可为复杂城市低空无人机飞行计划制定及安全运行监管提供理论依据和方法支撑。

基于改进布谷鸟搜索算法的光伏MPPT控制

复杂阴影情况下,光伏阵列的P-V特性曲线会出现多个峰值,传统的MPPT算法因不能准确识别局部峰值和全局峰值,而无法进行复杂阴影情况下的最大功率点跟踪。针对传统布谷鸟搜索(Cuckoo Search,CS)算法因鸟窝之间缺乏交流能力导致可能陷入局部最优的问题,提出了一种多策略改进布谷鸟搜索(EGICS)算法。将传统CS算法中发现概率值的选择自适应变化,提高算法的搜索能力;将步长因子自适应化,提高算法的收敛速度;引入高斯扰动和精英反向学习策略,增加种群多样性,避免算法陷入局部最优。对EGICS算法在单峰和多峰函数中进行性能测试,并将其应用于光伏系统MPPT控制中进行仿真验证。仿真结果表明,EGICS算法在收敛速度、跟踪精度以及动态稳定三个方面有更好的效果。

基于位姿参数估计的多视角点云配准方法

传统的点云配准算法通过两点云数据之间的特征实现对应点配对,这种方法要求点云具有明确的特征,且存在计算量大、匹配时间长、配准精度低等问题,而ICP算法虽然应用广泛,但对初始值敏感。对此,提出了一种基于位姿参数估计的多视角点云配准方法(PPE-ICP)。首先通过分析误差的分布特性可证明误差极小值存在,使用A^(∗)搜索算法寻找误差极小值,降低误差传播的影响,为后续的参数估计提供较好的初值;其次将总体最小二乘估计引入点云配准,在不依赖点云数据的同时,使用少量参考点就能获得点云从目标坐标系到东北天坐标系的转换矩阵,完成点云位姿矫正,结合迭代最近点算法(ICP),实现点云精确配准。通过与FGR-ICP、FPFH-ICP、NDT-ICP、RANSAC-TrICP和KSS-ICP这5种方法在公开数据集和自制实验装置收集到的点云上进行对比实验,点云数据量为20000点时实现配准只需6.55 s,极大地降低了大数据量下点云配准的时间成本,在实地点云配准中平移误差最大不超过0.03 m,旋转误差控制在0.07°。实验结果表明,PPE-ICP对相似变换、残缺点云和低重复率具有较强的鲁棒性,在多视角点云配准中具有较高的配准效率和配准精度。

基于黄金分割搜索的电压暂降域快速识别方法

针对大型复杂电网中敏感负荷的电压暂降域难以准确识别的问题,提出一种基于黄金分割搜索的电压暂降域快速识别方法。首先,求得网络中发生各类短路故障时敏感负荷节点的电压暂降幅值解析式,并引入节点判定向量和线路关联向量,以及相应的判定准则,实现对所有线路临界点的快速分类计算;接着详细阐述了传统插值法存在的问题,并提出一种由黄金分割搜索改进的插值法,以期为正割迭代提供更优的初值点,提高临界点计算的准确度;因考虑到拟合的二次曲线难免存在偏差,故使用故障点法作为补充算法,用以计算有求解困难的线路;最后,以IEEE30节点标准测试系统为例,验证了该方法能在保证计算精度的前提下,简化电压暂降域的求解过程,提高算法的收敛速度,并广泛适用于大型复杂电网。

高拱坝时序多属性施工方案随机智能优化方法

为了解决当前施工方案优化方法大多忽略各关键节点施工进度指标的随机性对施工方案优化的影响,同时属性权重确定方法难以实现对高维度多层次的多属性决策问题进行整体优化的问题,提出了基于前景随机理论和麻雀搜索算法的高拱坝时序多属性施工方案随机智能优化方法。针对高拱坝工程建设特点,基于前景随机理论建立时序多属性随机智能优化模型,提出了基于阶段发展特征的动态参考点设置方法;基于麻雀搜索算法建立最优属性权重及时间权重搜索模型,并以差异最大化思想构造适应度函数,实现模型的求解。工程实例验证结果表明该优化方法具有合理性,优化结果与前景随机占优-CRITIC方法、随机占优方法优化结果一致,且具有更好的方案区分度。

基于改进跳点搜索和蚁群算法的机器人多目标点巡检规划

针对移动机器人的多目标点巡检规划问题,本文提出了一种融合改进跳点搜索算法(JPS)与蚁群算法(ACO)的路径规划算法.首先,在JPS算法的评估函数中引入角度引导因子,使路径具有更强的导向性;然后,综合考虑路径距离、平滑度、安全性对评估函数的影响,以获得综合性能更优的路径;其次,提出了双向的逆向跳点剔除规则,筛除了多余节点,从而进一步降低路径长度并提高路径平滑度;最后,将多目标优化得到的路径综合性能替代传统旅行商问题(TSP)中的距离因子,并使用自适应蚁群算法来实现多巡检点的路径规划问题.仿真结果表明,改进JPS算法与传统JPS算法相比,具有更好的综合性能;同时应用于多巡检点规划时,具有更强的有效性和实用性.

改进双向动态JPS算法的移动机器人全局路径规划

针对跳点搜索(jump point search,JPS)算法在寻路过程中所存在的路径拐点多、中间搜索跳点数多、寻找跳点的过程中扩展节点数多和寻路时间较长等问题,提出改进双向动态JPS算法。改进算法动态定义正、反扩展方向上的目标点,动态定义启发函数,并利用动态约束椭圆对算法的扩展区域加以限制,以区分椭圆内、外区域的扩展优先级。在算法从起点和目标点两个方向上分别向对方进行扩展的过程中,以寻找到的新的代价最小点为新椭圆的焦点,椭圆的方位和约束区域也随之动态调整。仿真结果表明,经过优化改进的双向动态JPS算法在一般地图中有一定的表现,在障碍物较少且目标点距离起点较近的室内环境地图中表现尤为良好。

基于改进布谷鸟搜索算法的光伏最大功率点跟踪策略

实际工程中,光伏阵列在随机变化的环境中会出现局部遮光的情况,从而导致光伏阵列的功率-电压特性曲线会呈现多峰值状态,传统的最大功率点跟踪(maximum power point tracking, MPPT)算法易陷入局部最优解,追踪速度和精准度无法得到满足。针对这一问题,提出一种基于布谷鸟搜索算法(cuckoo search algorithm, CS)和电导增量法(conductivity increment method, CI)结合的光伏MPPT算法,在算法前期利用布谷鸟搜索算法将大步长和小步长交替使用使得全局搜索能力增强,找到全局最大功率点所处区域附近;在后期,采用步长小、控制精度高的CI进行局部寻优,快速准确地锁定到最大功率点。在MATLAB/Simulink中搭建仿真模型,并与原始布谷鸟搜索算法和粒子群优化(particle swam optimization, PSO)算法进行比较。仿真结果表明,将CS与CI结合的算法使得收敛速度更快,精度更高,稳定状态时功率曲线的波动更小。

基于逆深度滤波的单目稠密建图

稠密地图估计是同步定位与地图构建(Simultaneous Localization and Mapping,SLAM)的重要目标。针对经典的深度滤波算法重建精度不高的问题,提出一种基于逆深度滤波的改进单目稠密点云重建方法,在极线搜索阶段通过设置阈值提高效率,通过逆深度高斯滤波器更新后验逆深度概率分布,通过帧内检测剔除外点。实验结果验证改进后的稠密重建算法具有更稠密、更精确的重建效果,且无须GPU加速。

时变指向约束下姿态参数空间离散化路径规划方法

为满足深空探测器在复杂动态环境约束下的姿态机动任务需求,解决时变指向约束下姿态路径规划求解困难、路径优化性能差的问题,提出了一种基于修正罗德里格斯参数(MRP)和动态路径搜索的姿态参数空间离散化路径规划方法。通过MRP空间的笛卡尔网格划分和非奇异空间构建,实现航天器姿态的参数空间离散化和指向约束表征。考虑指向约束的时变动态特性,在三维动态空间中搜索初始到目标姿态的机动路径,并引入路径节点的时间特性,在约束冲突时对路径进行实时修正,设计非奇异空间时变约束路径搜索算法,生成执行路径节点序列。进一步,对生成的路径节点进行插值拟合,基于逆动力学方法计算角速度和控制力矩,完成姿态机动轨迹规划。仿真结果验证了该方法的有效性,可为深空探测器在时变指向约束下规划出姿态机动执行路径。

基于ESMD-FE-AJSO-LSTM算法的水闸深基坑变形预测

水闸深基坑开挖变形具有明显的非线性和非稳定性特征,基于此,引入极点对称模态分解算法(extremepoint symmetric mode decomposition method,ESMD)对水闸深基坑开挖变形原型监测序列进行多模态分解,并基于模糊熵(fuzzy entropy, FE)理论对各分解分量进行模糊多模态相空间重构,从而有效甄别水闸基坑变形不同时间尺度有效物理特征。构建基于人工水母搜索算法(artificial jellyfish search optimizer,AJSO)优化的长短期记忆(long short-term memory,LSTM)人工神经网络模型,以重构后的各重构子序列为基础进行优化训练,并把训练后的各预测模态分量合并,实现对水闸基坑开挖变形动态预测和分析。以张家港市十一圩江边枢纽改建工程基坑开挖变形监测为例,采用上述方法对该枢纽工程基坑开挖过程变形进行预测和分析。结果表明:基于ESMD-FE-AJSOLSTM算法的水闸深基坑变形预测方法能够有效预测基坑开挖变形非线性特征,相比传统LSTM、循环神经网络(recurrent neural network, RNN)和支持向量机(support vector machine,SVM)等算法具有更高的预测精度和稳定性,为实现对基坑开挖安全性态实时科学诊断和分析提供技术参考。

基于CAA的船舶工艺仿真环境搭建与LNS-SATSP排产优化

为解决在DELMIA原生环境下手动操作较多、工作效率低问题,提出一种基于CAA的船舶工艺仿真环境搭建与LNS-SATSP排产相结合的方法。通过CAA实现自动构建流程库与PPR树有效降低仿真环境搭建时间,并结合基于大规模邻域搜索的三次模拟退火算法(LNS-SATSP)进行排产分析,规划产品加工路线并自动优化仿真环境。以船舶肋骨段加工为例,引入自动建模,通过改进排产算法使平均加工时间缩短7.04%,并对优化后仿真环境搭建流程进行验证。