基于神经网络和遗传算法的机器人动态避障路径规划

文中提出了基于神经网络和遗传算法的动态环境下机器人动态避障路径规划方法,机器人工作空间动态环境信息的神经网络模型,并利用该模型建立机器人动态避障与神经网络输出的关系,然后将需规划路径的二维编码简化成一维编码,并把动态避障要求和最短路径要求融合成一个适应度函数.通过对算法进行实验仿真,结果表明提出的动态路径规划方法是正确和有效的.     

神经网络在移动机器人路径规划中的应用研究

移动机器人路径规划可分为两种类型(1)全局路径规划;(2)局部路径规划.本文分析了Kohonen神经网络算法及其识别机理,提出了Kohonen神经网络和BP神经网络结合起来进行路径规划的方法,最后给出了具体的算法,探讨了在神经网络技术中引入学习机制的特点.     

改进遗传算法在移动机器人路径规划中的应用

研究机器人路径规划问题,传统的遗传算法存在早熟收敛和收敛速度慢,影响路径规划的效率,针对移动机器人路径规划的难题,为了提高路径规划的效率,提出一种基于遗传模拟退火算法的移动机器人最优路径规划方法.应用简化编码长度的技术简化了工作路径编码方式,对于基于遗传算法产生初始路径种群后的各路径的适应值进行评价.经过多次交叉、变异,并借助模拟退火中Metropolis算法的随机移动准则制定了高效的温度更新函数,获得了从起始点到目标点的一条全局最优路径,并在MAlLAB环境中进行了仿真.仿真果证明算法的收敛速度、搜索质量和最优路径规划效率都有了明显的提高.     

神经网络在移动机器人路径规划中的应用研究

移动机器人路径规划可分为两种类型:(1)全局路径规划;(2)局部路径规划。本文分析了Kohonen神经网络算法及其识别机理,提出了Kohonen神经网络和BP神经网络结合起来进行路径规划的方法,最后给出了具体的算法,探讨了在神经网络技术中引入学习机制的特点。     

基于遗传算法的移动机器人动态避障路径规划方法

本文提出了一种基于遗传算法的简单、有效的移动机器人实时动态避障路径规划方法.为利用遗传算法实时、稳定地进行动态路径规划,本文将复杂的二维路径编码问题简化为一维编码问题,并把路边约束、动态避障要求和最短路径要求融合成一个简单的适度函数.仿真实验表明,本文提出的动态路径规划方法可实时、稳定地产生移动机器人运动的最佳局部规划路径,且具有良好的动态避障性能.该方法也可用于智能车辆的自动导航.     

基于改进遗传算法的机器人路径规划

文中提出一种基于改进遗传算法的移动机器人路径规划方法,将复杂的二维编码问题简化为一维编码问题,优化改进标准遗传算法的选择算子和交叉算子,引入路径规划特定的遗传算子(修正算子),最后以移动机器人行走路径最短作为适应度函数进行遗传优化.此算法克服了标准遗传算法的早熟收敛、运算结果稳定性差等问题,提高遗传算法的进化效率.仿真实验结果验证了该算法在移动机器人路径规划中的可行性和有效性,以及规划结果的稳健性.     

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

标准遗传算法在解决各类优化问题中获得成功,但它在具体的应用中由于缺乏对特定知识的利用,其性能有待提高。将改进遗传算法用于移动机器人的全局路径规划,复杂的二维编码问题简化为一维编码问题,建立边界约束,路径点必须在障碍物之外,路径点连线不能与障碍物相交等3个约束条件,以机器人行走路径最短作为适应度函数进行遗传优化。计算机仿真实验结果证明该算法在收敛速度、最优解输出概率方面相对于基本遗传算法有了显著提高。     

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

标准遗传算法在解决各类优化问题中获得成功,但它在具体的应用中由于缺乏对特定知识的利用,其性能有待提高。将改进遗传算法用于移动机器人的全局路径规划,复杂的二维编码问题简化为一维编码问题,建立边界约束,路径点必须在障碍物之外,路径点连线不能与障碍物相交等3个约束条件,以机器人行走路径最短作为适应度函数进行遗传优化。计算机仿真实验结果证明该算法在收敛速度、最优解输出概率方面相对于基本遗传算法有了显著提高。     

基于遗传算法的移动机器人路径规划

采用动态可变长编码的方法,以栅格表示环境。针对遗传算法大型障碍物难的问题,采用follow wall行为,较好地解决了基于遗传算法的快速路径规划和大型障碍物避障问题。该算法适应任何形状的障碍物,适用于静态和动态环境中。计算机仿真表明,该算法是一种正确和高效的路径规划方法。     

一种移动机器人在三维动态环境下的路径规划方法

提出一种基于遗传算法的三维动态环境下的路径规划方法,通过对机器人的运动行为进行编码,将各种约束条件融入到遗传算法当中,规划出可实际应用的避障路径,仿真研究表明该方法是简单有效的.     

A neural–genetic (NN–GA) approach for optimising mechanisms having joints with clearance

In this paper, a dimensional synthesis method for a four-bar (4R) path generator mechanism having revolute joints with clearance is presented. Joint clearances are considered as virtual massless links. The proposed method uses a neural network (NN) to define the characteristics of joints with clearance with respect to the position of the input link, and a genetic algorithm (GA) to implement the optimization of link parameters using an appropriate objective function based on path and transmission angle errors. Training and testing data sets for network weights are obtained from mechanism simulation, and Grashof’s rule is used during the optimization process as constraint. The results show that the proposed method is very efficient for the purpose of modeling the joint variables and also adjusting the link dimensions to optimize planar mechanisms with clearances.     

Neuro evolutionary model for weld residual stress prediction

Welding is an efficient reliable metal joining process in which the coalescence of metals is achieved by fusion. Localized heating during welding, followed by rapid cooling, induce residual stresses in the weld and in the base metal. Determination of magnitude and distribution of welding residual stresses is essential and important. Data sets from finite element method (FEM) model are used to train the developed neural network model trained with genetic algorithm and particle swarm optimization (NN–GA–PSO model). The performance of the developed NN–GA–PSO model is compared neural network model trained with genetic algorithm (NN–GA) and neural network model trained with particle swarm optimization (NN–PSO) model. Among the developed models, performance of NN–GA–PSO model is superior in terms of computational speed and accuracy. Confirmatory experiments are performed using X-ray diffraction method to confirm the accuracy of the developed models. These developed models can be used to set the initial weld process parameters in shop floor welding environment.     

基于ACS算法的移动机器人实时全局最优路径规划

以Ant Colony System（ACS）算法为基础提出了一种新的移动机器人实时全局最优路径规划方法.这种方法包括三个步骤:第一步是采用链接图理论建立移动机器人的自由空间模型，第二步是采用Dijkstra算法搜索出一条无碰撞次优路径，第三步是采用ACS算法对这条次优路径的位置进行优化，从而得到移动机器人的全局最优路径.计算机仿真实验的结果表明所提出的方法是有效的，可用于对移动机器人进行实时路径规划.仿真结果也证实了所提出的方法在收敛速度、解的波动性、动态收敛特征以及计算效率等方面都具有比采用精英保留遗传算法的移动机器人路径规划方法更好的性能.     

一种动态环境下移动机器人的路径规划方法

本文提出了在动态环境中，移动机器人的一种路径规划方法，适用于环境中存 在已知和未知、静止和运动障碍物的复杂情况．采用链接图法建立了机器人工作空间模型， 整个系统由全局路径规划器和局部路径规划器两部分组成．在全局路径规划器中，应用遗传 算法规划出初步全局优化路径．在局部路径规划器中，设计了三种基本行为：跟踪全局路径 的行为、避碰的行为和目标制导的行为，采用基于行为的方法进一步优化路径．其中，避碰 的行为是通过强化学习得到的．仿真和实验结果表明所提方法简便可行，能够满足移动 机器人导航的高实时性要求．     

Simultaneous estimations of temperature-dependent thermal conductivity and heat capacity using a time efficient novel strategy based on MEGA–NN

The aim of the presented novel strategy is to find the best values of input parameters, while the objective functions are not explicitly known in terms of input parameters and their values only can be calculated by a time-consuming simulation. In this paper, a hybrid modified elitist genetic algorithm–neural network (MEGA–NN) strategy is proposed for such optimization problems. The good approximation performance of neural network (NN) and the effective and robust evolutionary searching ability of modified elitist genetic algorithm (MEGA) are applied in hybrid sense, where NNs are employed in predicting the objective value, and MEGA is adopted in searching optimal designs based on the predicted fitness values. The proposed strategy (MEGA–NN) is used to estimate the temperature-dependent thermal conductivity and heat capacity using inverse heat transfer method. In order to demonstrate the accuracy and time efficiency of the proposed strategy, the results are compared to those of pre-selected parameters and MEGA. Finally, the results show that proposed MEGA–NN could save a great deal of time depending on the case.     

Flexural buckling load prediction of aluminium alloy columns using soft computing techniques

This paper presents the application of soft computing techniques for strength prediction of heat-treated extruded aluminium alloy columns failing by flexural buckling. Neural networks (NN) and genetic programming (GP) are presented as soft computing techniques used in the study. Gene-expression programming (GEP) which is an extension to GP is used. The training and test sets for soft computing models are obtained from experimental results available in literature. An algorithm is also developed for the optimal NN model selection process. The proposed NN and GEP models are presented in explicit form to be used in practical applications. The accuracy of the proposed soft computing models are compared with existing codes and are found to be more accurate.     

Optimizing the auto-brazing process quality of aluminum pipe and flange via a Taguchi-Neural-Genetic approach

This work describes an application of an integrated approach using the Taguchi method (TM), neural network (NN) and genetic algorithm (GA) for optimizing the lap joint quality of aluminum pipe and flange in automotive industry. The proposed approach (Taguchi-Neural-Genetic approach) consists of two phases. In first phase, the TM was adopted to collect training data samples for the NN. In second phase, a NN with a Levenberg-Marquardt back-propagation (LMBP) algorithm was adopted to develop the relationship between factors and the response. Then, a GA based on a well-trained NN model was applied to determine the optimal factor settings. Experimental results illustrated the Taguchi-Neural-Genetic approach.     

A novel optimal PID controller autotuning design based on the SLP algorithm

A novel optimal proportional integral derivative (PID) autotuning controller design based on a new algorithm approach, the “swarm learning process” (SLP) algorithm, is proposed. It improves the convergence and performance of the autotuning PID parameter by applying the swarm and learning algorithm concepts. Its convergence is verified by two methods, global convergence and characteristic convergence. In the case of global convergence, the convergence rule of a random search algorithm is employed to judge, and Markov chain modelling is used to analyse. The superiority of the proposed method, in terms of characteristic convergence and performance, is verified through the simulation based on the automatic voltage regulator and direct current motor control system. Verification is performed by comparing the results of the proposed model with those of other algorithms, that is, the ant colony optimization with a new constrained Nelder–Mead algorithm, the genetic algorithm (GA), the particle swarm optimization (PSO) algorithm, and a neural network (NN). According to the global convergence analysis, the proposed method satisfies the convergence rule of the random search algorithm. With respect to the characteristic convergence and performance, the proposed method provides a better response than the GA, the PSO, and the NN for both control systems.     

基于遗传算法和RBF网络的番茄生长模型辨识

采用神经网络和遗传算法,对温室栽培番茄生长过程中主要器官——茎的生长过程进行了建模．温室番茄的生长过程具有控制变量多、生长过程复杂等特点．采用基于径向基函数(RBF)神经网络的辨识方法建立了温室栽培番茄生长的模型,以温室中番茄的实测数据为训练和预测样本,采用遗传算法进行训练．仿真结果表明．该方法较其他方法更适合于温室番茄生长过程的建模．     

仓储物流机器人批量拣选路径规划仿真

针对仓储物流机器人在拣选作业过程中难以进行高效实时的路径规划问题,提出一种有效的解决方法。首先,根据拣选作业的需要建立一个灵活的仓储空间模型并对拣选作业任务流程进行描述。其次,根据批量拣选作业任务的特点,建立以路径总长度最小为优化目标的旅行商问题的数学模型。再次,提出改进的自适应遗传算法解决旅行商问题。最后,在考虑路径转折角代价的前提条件下,提出改进的A*算法,并与改进的自适应遗传算法相结合实现批量拣选的路径规划。仿真结果表明,该方法具有较快的收敛速度、较小的平均路径长度以及较少的算法运行时间,能很好地适应机器人批量拣选路径规划的要求。 