Mobile robot traveling salesman optimization method based on improved ant colony algorithm

• Main Authors: LU YI, GAO QIAN, YU YE, SHEN LIN, HE NAIBAO
• Format: Patent
• Language: Chinese; English
• Published: 29.06.2016
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; CONTROLLING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; PHYSICS; REGULATING; SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR

The invention discloses a mobile robot traveling salesman optimization method based on an improved ant colony algorithm and mainly solves the problems that an existing ant colony algorithm is prone to local optimum, running speed is low, and the convergence speed at the early information processing stage is low.The method comprises the planned steps of conducting modeling on the working environment of a mobile robot; calculating the distance among all cities, initializing the pheromone concentration according to distance information, and providing guiding for ants; making the mobile robot visit the cities one by one through the optimized ant colony algorithm; outputting the motion path of the mobile robot according to the optimization result.According to the mobile robot traveling salesman optimization method, a locally optimal solution is effectively avoided by improving the pheromone updating mode, and the problem that the traditional ant colony algorithm is low in convergence speed is solved. 本发明公开了一种基于改进蚁