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...
Main Authors: | Wenbo Zhang, Xiaopeng Gong, Guangjie Han, Yuntao Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7970119/ |
Similar Items
-
An empirical study of the structure of the shortest path tree
by: Mindaugas Bloznelis, et al.
Published: (2008-12-01) -
K Shortest Path Implementation
by: Nagubadi, RadhaKrishna
Published: (2013) -
Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
by: Lehua Yang, et al.
Published: (2020-01-01) -
LEACH Protocol Optimization Based on Weighting Strategy and the Improved Ant Colony Algorithm
by: Cheng, X., et al.
Published: (2022) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01)