Full Traversal Path Planning of Omnidirectional Mobile Robot Based on Improved Ant Colony Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Affected by the full traversal environment, the paths planned by existing methods are too long. For this reason, this study proposes a planning method for the full traversal path of omnidirectional mobile robots based on an improved ant colony algorithm, hoping to improve the path planning and obtain the optimal path. On the basis of the topological modeling diagram, a new environment model is established by angle conversion according to the position information of a mobile robot in the original coordinate system. Considering the problems in the ant colony algorithm, the decreasing coefficient is introduced into the heuristic function to update the local pheromone, and an iterative threshold is set to adjust the volatility coefficient of pheromone. Finally, the path planning process is designed to plan the full traversal path. The results show that the proposed method can shorten not only the full traversal path but also the planning time to obtain the optimal path, thereby improving the planning for the full traversal path of omnidirectional mobile robots.

    Reference
    Related
    Cited by
Get Citation

熊亿民.基于改进蚁群算法的全向移动机器人全遍历路径规划.计算机系统应用,2021,30(6):209-214

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 14,2020
  • Revised:September 10,2020
  • Adopted:
  • Online: June 05,2021
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063