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: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7970119/ |
id |
doaj-354a4ced4113424ab951e0b220c4dbfd |
---|---|
record_format |
Article |
spelling |
doaj-354a4ced4113424ab951e0b220c4dbfd2021-03-29T20:15:34ZengIEEEIEEE Access2169-35362017-01-015132601326910.1109/ACCESS.2017.27238927970119An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many SpotsWenbo Zhang0Xiaopeng Gong1Guangjie Han2https://orcid.org/0000-0002-6921-7369Yuntao Zhao3School of Information Science and Engineering, Shenyang Ligong University, Shenyang, ChinaHiconics Eco-Energy Technology Co., Ltd., Beijing, ChinaDepartment of Information and Communication Systems, Hohai University, Changzhou, ChinaSchool of Information Science and Engineering, Shenyang Ligong University, Shenyang, ChinaDisadvantages 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.https://ieeexplore.ieee.org/document/7970119/Path planningimproved ant colony algorithmtemporary weightshortest path matrixpath weight length |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wenbo Zhang Xiaopeng Gong Guangjie Han Yuntao Zhao |
spellingShingle |
Wenbo Zhang Xiaopeng Gong Guangjie Han Yuntao Zhao An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots IEEE Access Path planning improved ant colony algorithm temporary weight shortest path matrix path weight length |
author_facet |
Wenbo Zhang Xiaopeng Gong Guangjie Han Yuntao Zhao |
author_sort |
Wenbo Zhang |
title |
An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots |
title_short |
An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots |
title_full |
An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots |
title_fullStr |
An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots |
title_full_unstemmed |
An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots |
title_sort |
improved ant colony algorithm for path planning in one scenic area with many spots |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2017-01-01 |
description |
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. |
topic |
Path planning improved ant colony algorithm temporary weight shortest path matrix path weight length |
url |
https://ieeexplore.ieee.org/document/7970119/ |
work_keys_str_mv |
AT wenbozhang animprovedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT xiaopenggong animprovedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT guangjiehan animprovedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT yuntaozhao animprovedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT wenbozhang improvedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT xiaopenggong improvedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT guangjiehan improvedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots AT yuntaozhao improvedantcolonyalgorithmforpathplanninginonescenicareawithmanyspots |
_version_ |
1724194966631088128 |