Improved ant colony optimization algorithm and its application on path planning of mobile robot
文献类型：期刊论文
| 作者 | Zhao JP(赵娟平); Fu XH(符秀辉) |
| 刊名 | Journal of Computers
 |
| 出版日期 | 2012 |
| 卷号 | 7期号:8页码:2055-2062 |
| ISSN号 | 1796-203X |
| 关键词 | Artificial intelligence Mobile robots Motion planning Optimization |
| 产权排序 | 2 |
| 中文摘要 | This paper uses the grid method with coding tactic based on effective vertexes of barriers (EVB-CT-GM) as the method of environment modeling and ant colony optimization algorithm with two-way parallel searching strategy (TWPSS-ACOA) is adopted to accelerate searching speed. In view of that the TWPSS-ACOA has the defects of losing some feasible paths and even optimal paths because of its ants meeting judgment strategy (AMJS), so a new AMJS is proposed. Then a new method to rationally distribute initial pheromone is given to accelerate convergence speed of initial stages of ACO algorithm. Later, in order to avoid running into local optima and to speed up optimization process, a new path selecting method and a new global pheromone updating technique are put forward. Finally simulation researches of path planning of mobile robot based on improved TWPSS-ACOA are made under different two-dimension environments and simulation results show the improved algorithm can find safe paths at higher convergence speed even in complex environment. |
| 收录类别 | EI |
| 语种 | 英语 |
| 公开日期 | 2013-04-21 |
| 源URL | [http://ir.sia.cn/handle/173321/10631]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Zhao JP,Fu XH. Improved ant colony optimization algorithm and its application on path planning of mobile robot[J]. Journal of Computers,2012,7(8):2055-2062. |
| APA | Zhao JP,&Fu XH.(2012).Improved ant colony optimization algorithm and its application on path planning of mobile robot.Journal of Computers,7(8),2055-2062. |
| MLA | Zhao JP,et al."Improved ant colony optimization algorithm and its application on path planning of mobile robot".Journal of Computers 7.8(2012):2055-2062. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。