一种用于最优路径规划的改进遗传算法

An Improved Genetic Algorithm for Optimal Path Planning

  • 摘要: 设计了一种专门适用于路径规划的改进遗传算法.该算法根据最短路径问题的具体要求,将传统遗传算法中的编码、交叉、变异等操作均重新进行了定义,并且在进化过程中还能够自适应调节交叉和变异概率.仿真研究表明:改进的遗传算法具有较快的搜索速度和较高的搜索成功率,为实际车载导航系统中最优路径规划问题的解决提供了一种新方法.

     

    Abstract: An improved genetic algorithm for path planning is designed.Many operations such as coding,crossover and mutation in traditional algorithm are redefined according to the specific requirements of shortest path problem.Moreover,the rate of crossover and mutation can be adjusted adaptively during the evolution process.Simulation results show that the improved genetic algorithm has advantages such as rapid search speed and high search quality.It provides a new approach for solving the optimum path planning problems in practical vehicle guidance systems.

     

/

返回文章
返回