| 基于元胞自动机的启发式算法的改进 |
| |
| 引用本文： | 闻凯,王从庆.基于元胞自动机的启发式算法的改进[J].科技信息,2010(7). |
| |
| 作者姓名： | 闻凯 王从庆 |
| |
| 作者单位： | 南京航空航天大学金城学院;南京航空航天大学; |
| |
| 基金项目： | 江苏省应用基础研究课题(BJ98057) |
| |
| 摘 要： | 将元胞自动机应用于机器人路径规划,对移动机器人及其周围环境建立元胞自动机模型。机器人环境空间完全已知时,利用启发式算法与元胞自动机模型结合的方法,通过反复遍历具有最低耗费值的一系列元胞生成最优路径。并利用多层次的交互式元胞自动机,在方向有约束和地形耗费不同的环境中实现机器人的路径规划。
|
| 关 键 词： | 元胞自动机 启发式算法 路径规划 |
The Ameliorative Heuristic Algorithm Based on Cellular Automata |
| |
| WEN Kai WANG Cong-qing.The Ameliorative Heuristic Algorithm Based on Cellular Automata[J].Science,2010(7). |
| |
| Authors: | WEN Kai WANG Cong-qing |
| |
| Institution: | 1.College of Jincheng/a>;Nanjing Jiangsu/a>;211156/a>;2.Nanjing University of Aeronautics and Astronautics/a>;211100 |
| |
| Abstract: | In this paper,the cellular automata model is set to a mobile robot and its environment. When the environment is completely known,the path is generated by repeatedly going through a series of cells and choosing the square with the lowest cost by heuristic algorithm. It also uses the interactive and multi-layered cellular automata to get a shortest path which has orientation restrict and different costs. |
| |
| Keywords: | Cellular Automata Heuristic Algorithm Path-planning |
| 本文献已被 CNKI 等数据库收录！ |
