An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots

Disadvantages inherent to existing guidance systems for scenic areas can be reduced to a partial point traversal problem in the connected graph. This paper presents an intelligent, ant-colony-based path planning algorithm that is applicable to scenic areas. The proposed algorithm modifies the ants' ending tour to achieve partial point traversal of the connected graph by eliminating the restriction of the ant colony algorithm taboo table. A temporary weight matrix is introduced so that the algorithm avoids the repeated selection of smaller-weight paths, improving its overall efficiency. The experimental results show that the improved ant colony algorithm proposed in this paper is more effective and efficient than other algorithms and more suitable to solve the path planning problem in one scenic area with many spots.