摘要
研究了机器人在已知环境下用遗传模拟退火算法进行最优路径搜索的方法,此算法兼备了遗传算法和模拟退火算法的优点,还对路径的转折节点处进行了光滑性的改进,并且通过仿真实验证明了此方法能够快速得到最优路径。
The genetic simulated annealing algorithm of searching the best path for the robot in the known environment is worked out in the paper. The method has both advantages of genetic algorithm and simulated annealing algorithm. It also smoothes the path at the corners. Besides,the simulation proves the method can search the optimization path.
出处
《机械工程与自动化》
2007年第4期104-106,共3页
Mechanical Engineering & Automation
关键词
路径规划
遗传模拟退火算法
路径平滑
path planning
genetic simulated annealing algorithm
path smoothening
