IMPROVED EVOLUTIONARY PPOGRAMMING AND IT’S APPLICATION ON PATH PLANNING OF ROBOTS
LI Mei-yi1, CAI Zi-xing2
1. Research Institute of Applied Mathematics and Computing Application, Xiangtan Teachers College, Hunan, 411100; 2. College of Information Eng., Central South Univ. of Tech. Hunan, 410083
Abstract:This paper introduces, by improved mutation probability in evolutionary programming, raising speed of evolutionary computation. It has been applied in the path planning of robots, and achieves both near-optimality of paths and high planning efficiency.
[1] Fogel L J. Owens A J, Walsh M J, et al. Artificial Intelligence Through Simulated Evolution. New Youk:John Wiley,1966 [2] 张育.移动机器人路径规划算法研究.上海交通大学硕士论文,1995 [3] Khatib O. Real-time Obstacle Avoidance for Manipulators and Mobile Robots. IEEE Int Conf Robotics Automat. 1985 [4] Mobamed B. Trabia. Planning Near-length Collision-free Paths for Robots. IEEE Trans Syst Man Cybern. 1993.23(5):1481-1488 [5] Metea M B. Route Planning for Intelligent Autonomous Land Vehicles Using Hierarchical Terrain Representation. IEEEint Conf Rob And autom, 1987.3 [6] Xiao J, Michalewisz Z, Lin H S. Evolutionary Planner/navigator:Operator Performance and Self-tuning. Proc IEEE IntConf Evolutionary Computation.Nagoya,Japan.May 1996:366-371