用遗传算法实现对机器人的路径规划，取各障碍物顶点连线的中点为路径点，相互连接各路径点，将机器人移动的起点和终点限制在各路径点上，利用最短路径算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径。-Robot path planning using genetic algorithms, taking the midpoint of each obstacle vertex path points interconnected path the robot to move the start and end restrictions on each path point, using the shortest path algorithm to seek the shortest path to the network diagram, find the shortest path from the starting point P1 to the end of Pn.