An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance

The obstacle avoidance in path planning, a hot topic in mobile robot control, has been extensively investigated. The existing ant colony algorithms, however, remain as drawbacks including failing to cope with narrow aisles in working areas, large amount of calculation, etc. To address above technica...

Full description

Bibliographic Details
Main Authors: Hong-Jun Wang, Yong Fu, Zhuo-Qun Zhao, You-Jun Yue
Format: Article
Language:English
Published: Hindawi Limited 2019-01-01
Series:Journal of Robotics
Online Access:http://dx.doi.org/10.1155/2019/6097591
id doaj-311c1134dd6c490898895055eb7b2fb8
record_format Article
spelling doaj-311c1134dd6c490898895055eb7b2fb82020-11-25T01:32:13ZengHindawi LimitedJournal of Robotics1687-96001687-96192019-01-01201910.1155/2019/60975916097591An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle AvoidanceHong-Jun Wang0Yong Fu1Zhuo-Qun Zhao2You-Jun Yue3Tianjin Key laboratory for Control Theory and Applications in Complicated System, Tianjin University of Technology, Tianjin 300384, ChinaTianjin Key laboratory for Control Theory and Applications in Complicated System, Tianjin University of Technology, Tianjin 300384, ChinaSchool of Mechanical Engineering, Tianjin Sino-German University of Applied Sciences, Tianjin 300350, ChinaTianjin Key laboratory for Control Theory and Applications in Complicated System, Tianjin University of Technology, Tianjin 300384, ChinaThe obstacle avoidance in path planning, a hot topic in mobile robot control, has been extensively investigated. The existing ant colony algorithms, however, remain as drawbacks including failing to cope with narrow aisles in working areas, large amount of calculation, etc. To address above technical issues, an improved ant colony algorithm is proposed for path planning. In this paper, a new weighted adjacency matrix is presented to determine the walking direction and the narrow aisles therefore are avoided by redesigning the walking rules. Also, the best ant and the worst ant are introduced for the adjustment of pheromone to facilitate the searching process. The proposed algorithm guarantees that robots are able to find a satisfying path in the presence of narrow aisles. The simulation results show the effectiveness of the proposed algorithm.http://dx.doi.org/10.1155/2019/6097591
collection DOAJ
language English
format Article
sources DOAJ
author Hong-Jun Wang
Yong Fu
Zhuo-Qun Zhao
You-Jun Yue
spellingShingle Hong-Jun Wang
Yong Fu
Zhuo-Qun Zhao
You-Jun Yue
An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
Journal of Robotics
author_facet Hong-Jun Wang
Yong Fu
Zhuo-Qun Zhao
You-Jun Yue
author_sort Hong-Jun Wang
title An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
title_short An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
title_full An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
title_fullStr An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
title_full_unstemmed An Improved Ant Colony Algorithm of Robot Path Planning for Obstacle Avoidance
title_sort improved ant colony algorithm of robot path planning for obstacle avoidance
publisher Hindawi Limited
series Journal of Robotics
issn 1687-9600
1687-9619
publishDate 2019-01-01
description The obstacle avoidance in path planning, a hot topic in mobile robot control, has been extensively investigated. The existing ant colony algorithms, however, remain as drawbacks including failing to cope with narrow aisles in working areas, large amount of calculation, etc. To address above technical issues, an improved ant colony algorithm is proposed for path planning. In this paper, a new weighted adjacency matrix is presented to determine the walking direction and the narrow aisles therefore are avoided by redesigning the walking rules. Also, the best ant and the worst ant are introduced for the adjustment of pheromone to facilitate the searching process. The proposed algorithm guarantees that robots are able to find a satisfying path in the presence of narrow aisles. The simulation results show the effectiveness of the proposed algorithm.
url http://dx.doi.org/10.1155/2019/6097591
work_keys_str_mv AT hongjunwang animprovedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT yongfu animprovedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT zhuoqunzhao animprovedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT youjunyue animprovedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT hongjunwang improvedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT yongfu improvedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT zhuoqunzhao improvedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
AT youjunyue improvedantcolonyalgorithmofrobotpathplanningforobstacleavoidance
_version_ 1725082483446251520