The Robot Path Planning Based on Region Partition to Node Optimization

Abstract:

Article Preview

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, mess 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.

Info:

Periodical:

Advanced Materials Research (Volumes 383-390)

Edited by:

Wu Fan

Pages:

605-609

DOI:

10.4028/www.scientific.net/AMR.383-390.605

Citation:

Y. S. Liu "The Robot Path Planning Based on Region Partition to Node Optimization", Advanced Materials Research, Vols. 383-390, pp. 605-609, 2012

Online since:

November 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.