Sliding state stepping algorithm for solving impact problems of multi-rigid-body system with joint friction

Impact dynamics of multi-rigid-body systems with joint friction is considered. Based on the traditional approximate assumption dealing with impact problem, a general numerical method called the sliding state stepping algorithm is introduced. This method can avoid difficulties in solving differential equations with variable scale and its result can avoid energy inconsistency before and after impact from considering complexily of tangential sliding mode. An example is given to describe details using this algorithm.

Auxiliary principle and three-step iterative algorithms for generalized set-valued strongly nonlinear mixed variational-like inequalities

An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.

Random Timestepping Algorithm with Exponential Distribution for Pricing Various Structures of One-Sided Barrier Options

The exponentially-distributed random timestepping algorithm with boundary test is implemented to evaluate the prices of some variety of single one-sided barrier option contracts within the framework of Black-Scholes model, giving efficient estimation of their hitting times. It is numerically shown that this algorithm, as for the Brownian bridge technique, can improve the rate of weak convergence from order one-half for the standard Monte Carlo to order 1. The exponential timestepping algorithm, however, displays better results, for a given amount of CPU time, than the Brownian bridge technique as the step size becomes larger or the volatility grows up. This is due to the features of the exponential distribution which is more strongly peaked near the origin and has a higher kurtosis compared to the normal distribution, giving more stability of the exponential timestepping algorithm at large time steps and high levels of volatility.

Application of simulated annealing algorithm to optimizing sequencing of operation steps

Discusses the optimization of machining operation sequencing by simulated annealing, and building a simulated annealing optimization model. From which, a new way to optimize operation sequencing can be developed.

Convergence Properties and Step Size Estimation for MLMS Algorithm

According to the exact expression of the maladjustment, an equation for calculating the boundary of step-size in MLMS algorithm is derived and the relationship between the convergence rate and step-size is discussed in detail. It is shown that the threshold of the step-size is constrained by maladjustment. Three different properties are presented between the LMS and MLMS algorithms based on comparison. It is indicated that MLMS does not differ significantly from LMS when the given maladjustment is small.

Study of Variable Step Size LMS Adaptive Algorithm Based on Variable Region

This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size μ(k) in the algorithm varies with the variation of the region of deviation e(k) to ensure the optimization of the three performance objectives including initial convergent speed, trace ability of the time-varying system and steady disregulation. The paper demonstrates the convergence of the algorithm accompanied by random noise.

A two-step rectification algorithm for airborne linear images with POS data

Rectification for airborne linear images is an indispensable preprocessing step. This paper presents in detail a two-step rectification algorithm. The first step is to establish the model of direct georeference position using the data provided by the Po- sitioning and Orientation System (POS) and obtain the mathematical relationships between the image points and ground reference points. The second step is to apply polynomial distortion model and Bilinear Interpolation to get the final precise rectified images. In this step, a reference image is required and some ground control points (GCPs) are selected. Experiments showed that the final rectified images are satisfactory, and that our two-step rectification algorithm is very effective.

一种混合多策略改进的麻雀搜索算法

针对麻雀搜索算法SSA求解目标函数最优解时具有过早收敛、在多峰条件下易陷入局部最优和在高维情况下求解精度不足等问题,提出了一种混合多策略改进的麻雀搜索算法MISSA。考虑到算法初始解的质量很大程度上会影响整个算法的收敛速度与精度,引入精英反向学习策略,扩大算法的搜索区域,提升初始种群的质量和多样性;对步长进行分阶段控制,以提高算法的求解精度;通过在跟随者的位置中加入Circle映射参数与余弦因子,提高算法的遍历性与搜索能力;采用自适应选择机制在麻雀个体位置更新中加入Lévy飞行,增强算法寻优和跳出局部最优的能力。将改进后的算法与麻雀搜索算法及其他算法在13个测试函数上进行对比,并进行Friedman检验。实验结果表明,改进后的麻雀搜索算法能够有效提高寻优精度与收敛速度,并在高维问题中也具备较高的稳定性。

An Adaptive Fruit Fly Optimization Algorithm for Optimization Problems

In this paper, we present a new fruit fly optimization algorithm with the adaptive step for solving unconstrained optimization problems, which is able to avoid the slow convergence and the tendency to fall into local optimum of the standard fruit fly optimization algorithm. By using the information of the iteration number and the maximum iteration number, the proposed algorithm uses the floor function to ensure that the fruit fly swarms adopt the large step search during the olfactory search stage which improves the search speed;in the visual search stage, the small step is used to effectively avoid local optimum. Finally, using commonly used benchmark testing functions, the proposed algorithm is compared with the standard fruit fly optimization algorithm with some fixed steps. The simulation experiment results show that the proposed algorithm can quickly approach the optimal solution in the olfactory search stage and accurately search in the visual search stage, demonstrating more effective performance.

基于多线程加速的STEP标准并行解析算法

当前CAD软件加载大型STEP中性文件时速度慢,其效率瓶颈关键在于其解析算法.针对基于单线程的中性标准解析算法已经远远不能满足当前CAD应用需求的问题,提出了一种基于多线程的分层并行数据解析算法,利用当前主流CPU都采用的多核并行架构,大幅提升了STEP文件解析效率.根据模型体中数据的分层特性,算法利用线程池对各层数据解析进行并行加速.文中算法已经在开源几何引擎OpenGE中实现.与OpenCASCADE的对比实验验证了文中算法的有效性.实验结果表明,算法的并行解析程序运行速度相比串行解析程序运行速度提升至原算法的2倍,比OpenCASCADE解析算法快50%.

基于改进RRT-Connect算法的全局路径规划

针对RRT-Connect算法在复杂环境内的路径规划中存在探索性弱、收敛速度慢、冗余节点多、搜索路径较长等问题,提出一种改进的RRT-Connect算法。通过引入高质量随机点和动态步长的方法,提高了生成随机树的质量并减少了冗余节点数量;采用正向寻优和逆向贪婪的方式,改善了搜索路径较长的问题。实验结果表明,改进RRT-Connect算法平均路径规划时间缩短26.41%,平均路径规划长度缩短19.05%,平均路径规划节点个数减少41.91%,证明了改进RRT-Connect算法相比于原算法规划效率更高,规划时间更少,规划路径质量更优。

柔性机械爪力控的变步长自适应滤波算法

机械爪工作中,由于电源和机械震动会导致电流有波动,将测得的电流数据通过滤波,减少电流的波动,从而让力控的准确度更高。传统的自适应算法无法满足在快速收敛的同时,实现较高鲁棒性和较小稳态误差的要求。针对上述问题,文中提出一种新的自适应滤波算法。首先,建立基于双曲正切函数的变步长模型,实现更新步长因子的动态变值,其次,将滤波器权向量差及可变因子引入更新权值迭代算法中,以达到快速收敛和减少稳态误差的目的。通过实验证明,文中算法实现了快速收敛,并具有较小的稳态误差,提高了系统的鲁棒性。

3D打印机多轴联动插补算法的研究与优化

针对3D打印过程中,打印机多轴联动插补算法计算效率低的问题和Bresenham算法在3D打印运动控制中的不足,在现有算法基础之上提出阶跃式Bresenham算法、速度自适应算法,分别完成喷嘴的成型扫描运动和浆料的挤出运动.采用两种算法相结合的方式控制3D打印机多轴联动,从而提高3D打印机的插补速度.同时分析了该控制方式在微控制器中的实现流程,并将其移植于微控制器中.本研究设计了直线插补仿真试验和不同算法的3D打印试验,证明了该控制方式在打印精度不变的前提下能够提高打印效率.

基于POD-αATS的油浸变压器瞬态温升降阶自适应变步长计算方法

针对油浸式电力变压器瞬态温升计算效率过低的问题,该文提出本征正交分解-αATS(proper orthogonal decomposition-adaptive time stepping based onαfactor,POD-αATS)降阶自适应变步长瞬态计算方法。首先,推导变压器绕组瞬态温升计算的有限元离散方程;其次,采用POD降阶算法改善传统瞬态计算中存在的条件数过大及方程阶数过高的问题;同时对于瞬态计算中的时间步长选择问题,提出适用于非线性问题的αATS变步长策略;然后,为验证方法的有效性,基于110 kV油浸式电力变压器绕组的基本结构建立二维八分区数值计算模型,同时将计算结果与基于110 kV绕组的温升实验结果进行对比。数值计算及实验结果表明,所提算法与全阶定步长算法在流场和温度场中的精度几乎相同,且流场计算效率提升约45倍,温度场计算效率提升约38倍,计算速度得到显著提高。这一点在温升实验中同样得到验证,说明该文所提算法的准确性、高效性及一定的工程实用性。

具有串并行异类工序约束的多柔性车间联合调度

为了减少具有串并行异类工序约束多车间联合调度的总延期时间,提出了基于知识牵引遗传算法的调度求解方法。首先,采用扩展工艺树描述串并行异类工序约束,并基于无向图描述机器在多车间的分布;针对染色体初始化和进化过程中的扩展工艺树约束,定义了紧前工序数和剩余紧前工序数的概念,基于剩余紧前工序数设计了染色体初始化和进化方法;为了提高遗传算法的进化能力,将种群进化能力和最优个体进化能力作为知识,用于牵引算法的进化方式和方向,从而提出了知识牵引遗传算法的求解方法。经实验验证,知识牵引遗传算法调度的总延期时间均值最小,为30.8 h,说明该算法在多车间调度中具有最好的优化性能;且总延期时间盒须图长度最小,说明知识牵引遗传算法的稳定性也较好。

面阵投影增材制造技术自适应分层算法

增材制造采用“逐层叠加”的原理来成型制件,层厚越小,制件的表面质量越高,成型效率越低。为了调节制件成型效率与表面质量之间矛盾的问题,提出了基于STL制件法矢量的自适应分层算法。该算法先计算出与切面层相交的三角面片的法矢量与制造方向的夹角集,然后对夹角集的均值与最小值进行加权求和,依据加权求和后的角度关系,实现对制件进行自适应调整分层厚度。对同一制件分别采用本文算法及已知的4种算法进行分层,实验结果表明,这里算法能够有效平衡制件表面质量与成型效率之间的关系,较其余4种自适应分层算法,阶梯体积误差小且制件成型时间短。

单调线性权互补问题的新全牛顿步可行内点算法

提出求解单调线性权互补问题(WLCP)的全牛顿步可行内点算法。基于线性优化的连续可微函数,给出中心方程的新等价形式,接着运用牛顿法求解定义中心路径的等价方程组,从而得到单调WLCP的新搜索方向。沿该搜索方向使用全牛顿步,无需进行线搜索。通过适当选取参数,分析了全牛顿步的严格可行性,证得算法是二次收敛的且具有多项式时间迭代复杂度。最后数值实验结果表明算法有效。

变压器油中乙炔门控循环单元网络多步预测超参数优化方法

油中溶解乙炔作为电力变压器中重要的放电程度表征参量之一,对其进行多步预测可以为变压器故障诊断及预警提供重要依据。现有的状态预测模型主要集中于单步预测,对于未来更长时期变化趋势的预测手段不足。此外,基于深度学习的多步预测模型的超参数选择大多基于经验和朴素的单一控制变量法,超参数之间的耦合关系没有得到充分的研究。文中提出基于多输出策略的门控循环单元(gated recurrent unit,GRU)神经网络多步预测模型,通过改变模型结构超参数和训练超参数研究超参数之间的耦合关系,使用多目标灰狼优化算法对不同预测结果倾向的GRU模型进行超参数优化。结果表明,GRU模型可以较为准确的对变压器油中乙炔含量进行30天预测,GRU模型的各超参数对输出预测结果的影响规律并不统一且相互影响,一组超参数无法同时达到多目标最优。多目标灰狼优化算法能够根据预测目标的不同,优化选择合适的超参数,为人工智能算法超参数的选取提供参考。

改进海洋捕食者算法的机器人路径规划研究

为解决海洋捕食者算法(MPA)收敛速度慢、收敛精度低、易陷入局部最优的问题,提出一种多策略改进海洋捕食者算法(IMPA)。引入Logistic混沌映射初始化种群,增加捕食者种群多样性;基于当前迭代次数t的自适应移动步长动态调整策略,增强算法逃离局部最优的能力;在IMPA迭代后期,加入中垂线算法(MA),基于中垂线策略的游离粒子位置更新方法,能够加快更新捕食者的位置,增强算法的寻优速度和寻优精度,避免算法陷入局部最优。最后通过改变IMPA阶段转换寻优过程,进一步平衡搜索过程,加强全局与局部适应性。选用6个基准测试函数对算法性能进行测试,测试结果显示:IMPA收敛速度更快,收敛精度更高;最后将改进算法应用于移动机器人路径规划,仿真结果表明:该算法规划的路径长度更短,搜索效率更高。

DPCA-POA-RF-Informer在多情景光伏多步预测中的应用

针对光伏发电波动性与不确定性对电力系统稳定产生的影响,对多情景光伏发电功率的多步预测进行研究。首先通过密度峰值算法根据太阳辐射量、温度、湿度等气象数据对天气状况进行精确分类。其次,为了使模型表现出更好的性能,建立了鹈鹕算法优化随机森林(POA-RF)的因素筛选特征变量,模型用鹈鹕算法对随机森林的决策树数目和深度两个参数进行寻优,加强了因素筛选的有效性。最后,基于Informer模型对不同天气状况的光伏功率进行多步预测。实例计算结果验证了所提模型预测精准度的有效性与精准性。