| Path planning in 3-D space for robot based on ant colony algorithm |
| |
| 引用本文： | HU Xiao-bing~. Path planning in 3-D space for robot based on ant colony algorithm[J]. 保鲜与加工, 2004, 0(8): 132-135 |
| |
| 作者姓名： | HU Xiao-bing~ |
| |
| 摘 要： | In this paper the ant colony algorithm is applied to path planning problem in 3-D space for robot. First of all, the space between the origin where the robot is located and destination was divided into a three dimensional grid, at the same time the valid path from origin to destination is defined, then all the ants will leave from the origin, selecting next vertex independently in three dimensional grid, to the destination on a valid path. The simulated experiment shows that the algorithm is efficient and has a great convergence rate.
|
| 关 键 词： | ant colony algorithm path planning for robot heuristic algorithm |
| 修稿时间： | 2004-03-05 |
Path planning in 3-D space for robot based on ant colony algorithm |
| |
| HU Xiao-bing. Path planning in 3-D space for robot based on ant colony algorithm[J]. Storage & Process, 2004, 0(8): 132-135 |
| |
| Authors: | HU Xiao-bing |
| |
| Affiliation: | HU Xiao-bing~ |
| |
| Abstract: | In this paper the ant colony algorithm is applied to path planning problem in 3-D space for robot. First of all, the space between the origin where the robot is located and destination was divided into a three dimensional grid, at the same time the valid path from origin to destination is defined, then all the ants will leave from the origin, selecting next vertex independently in three dimensional grid, to the destination on a valid path. The simulated experiment shows that the algorithm is efficient and has a great convergence rate. |
| |
| Keywords: | ant colony algorithm path planning for robot heuristic algorithm |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
|
点击此处可从《保鲜与加工》下载全文 |
