| 基于蚁群算法的三维空间机器人路径规划 |
| |
| 引用本文： | 胡小兵,黄席樾.基于蚁群算法的三维空间机器人路径规划[J].重庆大学学报(自然科学版),2004,27(8):132-135. |
| |
| 作者姓名： | 胡小兵 黄席樾 |
| |
| 作者单位： | 重庆大学,数理学院,重庆,400030;重庆大学,自动化学院,重庆,400030;重庆大学,自动化学院,重庆,400030 |
| |
| 摘 要： | 将蚁群算法应用于三维空间机器人路径规划问题.首先将机器人所在位置(原点)与目的点之间的空间划分成立体网格,同时定义原点与目的点之间的有效路径.蚁群从原点出发,独立地选择有效路径,最终到达目的点,从而求出从原点到目的点之间的最优路径.实验结果表明,该算法不仅有效,而且具有较快的速度.
|
| 关 键 词： | 蚁群算法 机器人路径规划 启发式算法 |
| 文章编号： | 1000-582X(2004)08-0132-04 |
| 修稿时间： | 2004年3月5日 |
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].Journal of Chongqing University(Natural Science Edition),2004,27(8):132-135. |
| |
| Authors: | HU Xiao-bing~ |
| |
| Institution: | 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 |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
|
