The Robot Path Planning Based on Region Partition to Node Optimization

We put forward the concept that introducing the methods of region partition and node optimization into original optimization of AOC, in order to solve the problems that ACO'S low efficiency in original execution, huge computational complexity in the process of conclusion, moss route and easily trap into the local optimal solution. The number and location of urban node after dynamic optimization reduce the ant colony quantity and iterative time arithmetic. The optimization improves the execution efficiency of arithmetic, and at the same time the analog simulation successfully applies to the robot path planning design, which show that the method is efficient and applicable so as to create a new approach of improve ACO.