取各障碍物顶点连线的中点为路径点，相互连接各路径点，将机器人移动的起点和终点限制在各路径点上，利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动，利用Pi= Pi1+ti×(Pi2-Pi1)（ti∈[0,1] i=1,2,…n）即可确定相应的Pi，即为新的路径点，连接此路径点为最优路径。-Ta

In a 2-dimensional grid/plane (n*m) there are either walls or spaces. We represent the walls as ‘# ’ in the diagram (with spaces coloured into different partitions) In such a grid we can place robots who can move horizontally and verti

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

在matlab中建立双工业机器人的三维仿真图，并得到控制界面。(The 3D simulation diagram of dual industrial robot is established in MATLAB, and the control interface is obtained.)

基于扩展卡尔曼滤波（EKF）的机器人即时定位与建图仿真示例(An extended EKF based robot real-time localization and construction diagram simulation example)