共查询到20条相似文献,搜索用时 573 毫秒
1.
2.
针对传统并联机构工作空间搜索法所得边界精度低、效率低等问题,提出一种通用的基于元胞自动机理论的快速搜索方法。该方法以元胞自动机中邻域思想和黄金分割法原理为基础,研究了并联机构工作空间求解的数值法,并总结出这些方法的不足。通过引入元胞自动机的邻域提取粗糙化边界和搜索方向,并将黄金分割二分法引入维度搜索中,以实现任意精度的边界点搜索,其后仿真算例检验了此方法的有效性与快速性,并与极坐标搜索法、蒙特卡洛法、精确化处理进行对比。分析表明:该算法在求解精度、效率具有明显优势,并且适用于二维、三维的并联机构工作空间的求解。 相似文献
3.
《仪表技术与传感器》2020,(8)
文中基于元胞自动机,提出了一种无线传感器网络安全补丁分发算法。该算法采用正方形网格描述无线传感器网络模型,改进了二维元胞自动机,传感器节点将收到的安全补丁分发给其元胞邻域内的其他节点。在不同的初始条件下,该算法选择区域中任何节点作为初始节点分发安全补丁,均能快速将补丁分发完毕。 相似文献
4.
基于进化元胞自动机的结构拓扑优化 总被引:6,自引:1,他引:5
实现元胞自动机算法自组织演化机制的关键是建立适合问题的局部规则。传统的方法是根据人们的经验或 其他算法得到的结果来建立局部规则,被称为局部间接规则。为了解决局部间接规则存在的局限性,计算量大等 缺点,提出用进化建立元胞自动机局部直接规则的方法。通过建立结构优化的多目标优化模型,用遗传算法寻求 最优的演化规则,得到适应相应问题的解。由仿真结果可见用遗传算法建立的元胞自动机局部直接规则对复杂系 统的自组织问题是很有效的。 相似文献
5.
6.
结合有限元和无网格算法的优势,提出了一种元胞自动机算法用以求解二维弹性力学问题。该算法将二维模型离散成一系列节点,这些节点被分成有限元群和无网格群。有限元区域被定义在问题的边界附近,其中的任一节点和其周围相邻点的力学关系通过有限元单元建立;无网格区域定义在远离原理问题边界处,其中的节点之间的关系借用有限元中的位移插值概念建立。无论处于有限元区域还是无网格区域,任何一个节点都被置于元胞自动机的框架下进行处理,即节点的位移通过元胞自动机进行求解。与有限元方法相比,所提出的元胞自动机算法无需采用高斯消去法等传统系统求解器,而是通过元胞自动机的自动演化解决问题。依据该算法,有限元和无网格方法可以实现无缝连接。数值算例验证了该算法的新颖性和正确性。 相似文献
7.
利用Ansoft Maxwell软件二维/三维建模对电磁阀进行仿真分析被广泛应用于电磁阀设计。采用Maxwell建立电磁阀三维模型和二维轴对称模型,保持三维模型和二维模型求解参数一致,进行仿真分析。通过对比不同行程下三维模型和二维模型轴对称模型的仿真结果,验证了二维/三维模型电磁力大小的一致性,并且发现二维轴对称模型相比三维模型收敛次数少,仿真耗时短,计算精度高。采用二维模型代替三维模型对轴对称的电磁阀进行仿真计算,大大提高计算效率、缩短研发周期、降低研发成本。 相似文献
8.
针对传统多目标遗传算法存在收敛速度慢和难以得到Pareto最优解的缺点,提出了一种在三维环境下具有修正策略的改进带精英策略的非支配排序的遗传算法(NSGA-II).首先建立能使路径最短、能耗最小、起伏最少的多目标函数;其次加入修正算子来减少冗余的路径点,实现快速收敛;然后在选择算子中加入辅助决策算子来比较优先级,提高解的多样性.为了测试改进算法的效果,将传统算法与改进算法进行对比,改进算法得到的解更优且在不同环境下具有多个Pareto前沿分布解,其中修正算子使迭代次数减少了约63%,验证了改进算法的可行性和有效性. 相似文献
9.
针对物流仓库“货到人”拣选系统中的拣货员拣选次数过多和拣货效率低的问题,提出一种基于遗传算法的订单分批优化策略,使大量多元化和零散化的订单得到高效分批并减少物料箱出库频率和拣货次数。首先建立以所有订单拣货总次数最小为目标的订单分批优化模型。其次,以标准遗传算法为基础改进遗传算法的交叉策略,验证相比于不使用遗传算法的情况下,使用本文的遗传算法优化策略的高效性。最后,为了找出更优异的优化策略,对改进的三种交叉策略进行对比实验,发现随着物料种类增多时,文中改进的第一种交叉策略拣选次数比其他两种少。仿真实验结果表明,该订单分批优化策略提高了系统的拣选效率,证明了此遗传算法解决订单分批问题的有效性。 相似文献
10.
11.
鉴于传统方法在处理存在由部件选择性失效传播引起的共因失效的复杂可修系统可靠性与可用性评估问题时的缺陷,提出一种基于元胞自动机思想的蒙特卡洛模拟方法用以评估存在共因失效的复杂可修系统的可靠性。该方法首先将系统转化成二终端网络,然后基于问题的基本假设去模拟不同时刻下网络各边对应的状态值,利用元胞自动机并行搜索的优势判断每次模拟过程中不同时刻下网络的连通性,从而推导出计算系统可靠性、瞬时可用性、区间可用性、系统平均维修时间以及系统单位时间平均维修次数的具体算法。最后,通过算例对算法进行了说明。 相似文献
12.
13.
影响激光传感器在线检测锂电池极片厚度的因素主要包括激光传感器的测量精度、C型扫描机构固有频率和振动频率扫描时引起的动态误差以及外界环境噪声。多尺度小波去噪算法需明确噪声的先验频率,而常规稀疏分解算法在训练阶段采用与实际数据特征无关的相干比值确定迭代终止条件且构建过完备原子库的运算量巨大。改进稀疏分解去噪算法在训练阶段针对不同情况下的锂电池极片厚度,得到高度冗余的最佳原子参数,通过选取更反映数据波动性能的最小均方差值的迭代值作为测厚终止条件;在实测阶段,不需构建过完备原子库,而是提取训练阶段最佳原子参数构建次最佳原子函数,提取训练阶段最小均方差作为稀疏分解迭代终止值,实现了快速去噪。结果表明:相对于小波算法和常规稀疏分解算法,对于非连续性小幅面锂电池极片在缺乏先验知识的条件下,改进稀疏分解算法具有较好的去噪性能,满足高精度快速去噪的要求。 相似文献
14.
15.
K.L. Mak X.X. Wang 《The International Journal of Advanced Manufacturing Technology》2002,20(2):144-152
In this paper, an approach using the concept of genetic algorithms is proposed as a powerful but simple means of scheduling
the manufacturing operations of a virtual cellular manufacturing system (VCMS). A mathematical model is developed to describe
the characteristics of a VCMS, which includes the constraints related to the delivery due dates of the various products and
the maximum capacities of the manufacturing resources. The objectives are to set up virtual manufacturing cells and to formulate
feasible production schedules for all manufacturing operations, in order to minimise the total material and component travelling
distance incurred in manufacturing the products. A new genetic based scheduling algorithm is proposed as an optimisation tool
to determine the solution. The proposed algorithm differs from the conventional genetic algorithms in that the populations
of the candidate solutions consist of individuals from various age-groups, and each individual is incorporated with an age
attribute to enable its birth and survival rates to be governed by predefined ageing patterns. By generating the evolution
of the populations with the genetic operators of selection, crossover and mutation, the proposed approach provides excellent
results by maintaining a better balance between the exploitation and the exploration of the solution space, and thus improves
the computational speed and the solution quality. The condition ensuring stable search performance is also derived. The superiority
of the proposed algorithm is illustrated by solving the production-scheduling and cell-formation problems for a virtual cellular
manufacturing system, and the results are compared with those obtained by using a conventional optimisation technique. 相似文献
16.
对配点型无网格法在求解导热微分方程中的应用进行研究,提出配点型无网格法的迭代求解算法,并同有限元法进行对比。结果表明,配点型无网格及其迭代方法易于编程实现,且精度与有限元法相当。采用迭代求解法甚至可以不用形成系数矩阵,求解逐点进行,占用内存空间少。选择适当的松弛因子,松弛迭代相对于 Gauss-Seidel迭代可减少迭代次数。研究表明配点型无网格法及其迭代求解方法在求解大规模工程问题时具有优势。 相似文献
17.
The Subspace Pursuit (SP) algorithm is one of greedy pursuit methods which is used to reconstruct of K-sparse signal. Unlike existing condition produced by Dai and Milenkovic in 2004 that suggests the residual value of current iteration is reduced from the previous iteration, our approach eliminates useless information by reducing the number of iterations used to detect the correct support set. This operation is done by suggesting a new halting condition that can capture the best support set which can give the best representation of the reconstructed signal. The new halting conditions enhanced the SP algorithm to low computational complexity and reconstruction accuracy of the sparse signal.A mathematically proven for two halt condition: noiseless setting, and noisy setting for signal affected by Gaussian noise. An error bound relation also is driven.In this paper, we try also to relax the restricted isometry constant RIC value to narrows the gap between the known bounds and ultimate performance, which it produced by Dai.Simulation results show that the new halting condition can overpass best results produce by earlier iteration and rise time consume. Our new halting condition can catch this earlier iteration and enhanced SP algorithm results. 相似文献
18.
In dynamic test,sampling rate is high and noise is strong,so a signal sparse decomposition method based on Gabor dictionary is put forward.This method iteratively decomposes the signal with the matching pursuit (MP) algorithm and takes the coherence ratio of the threshold as a condition of iteration termination.Standard MP algorithm is time-consuming,thus an adaptive genetic algorithm is introduced to MP method,which makes computation speed accelerate effectively.Experimental results indicate that this method not only can effectively remove high-frequency noise but also can compress the signal greatly. 相似文献
19.
针对微机电系统多物理场耦合效应有限元解析所遇到的难题,应用元胞自动机的思想来解析其热-力耦合场.以典型微结构中的平板结构为研究对象,根据应变能守恒,将连续性单元转化为米字形桁架结构,并建立元胞空间;从简单的二力杆热力分析出发,推导热应力的局部规则,建立了该平板结构的元胞自动机模型,对热弹性力学中的平面应力问题进行了分析.从实例解析出发,对热应力产生的不同情况进行了模拟分析,验证了所建热-力耦合解析方法的可行性和算法的效率.该解析算法也适用于力载荷或位移载荷,为微结构多物理场耦合解析提供了有效的解析方向. 相似文献
20.
Guang-ru Hua Xiong-hui Zhou Xue-yu Ruan 《The International Journal of Advanced Manufacturing Technology》2007,33(5-6):594-603
To obtain global and near-global optimal process plans based on the combinations of different machining schemes selected from
each feature, a genetic algorithm-based synthesis approach for machining scheme selection and operation sequencing optimization
is proposed. The memberships derived from the fuzzy logic neural network (FL-NN), which contains the membership function of
each machining operation to batch size, are presented to determine the priorities of alternative machining operations for
each feature. After all alternative machining schemes for each feature are generated, their memberships are obtained by calculation.
The proposed approach contains the outer iteration and nested genetic algorithm (GA). In an outer iteration, one machining
scheme for each feature is selected by using the roulette wheel approach or highest membership approach in terms of its membership
first, and then the corresponding operation precedence constraints are generated automatically. These constraints, which can
be modified freely in different outer iterations, are then used in a constraints adjustment algorithm to ensure the feasibility
of process plan candidates generated in GA. After that, GA obtains an optimal process plan candidate. At last, the global
and near-global optimal process plans are obtained by comparing the optimal process plan candidates in the whole outer iteration.
The proposed approach is experimentally validated through a case study. 相似文献