jsjy20070288
代码说明：
说明： :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。(: Genetic algorithm for the lack of easy to fall into local optimum, in the standard genetic algorithm based on the insertion of three new operations- rehabilitation, reconstruction, and excellent operational record, so that the improved genetic algorithm converges to the global optimum, and in this by the roadside on the basis of constraints, dynamic obstacle avoidance and the shortest path as the fitness function is proposed dynamic obstacle avoidance path planning method. Simulation results through experiments the effectiveness of the algorithm, accuracy and real-time, and with previous genetic algorithm based path planning method to compare the results show that the method proposed in the resulting path length and algorithms have a running time better performance.)
文件列表：
jsjy20070288.pdf
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
