平面移动机器人最短路径规划算法在许多领域有着十分广泛的应用。
Shortest path planning of the planar mobile robot is widely used in many fields.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
应用推荐