检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京信息科技大学自动化学院,北京100192
出 处:《北京信息科技大学学报(自然科学版)》2014年第5期8-13,22,共7页Journal of Beijing Information Science and Technology University
基 金:国家自然科学基金资助项目(11172047);北京市属高等学校人才强教深化计划资助项目(PHR201106131)
摘 要:提出了一种基于细胞自动机(Cellular Automata,CA)和人工势场的全向移动机器人路径规划算法,并通过一个4层的细胞自动机模型实现了该算法。通过构造扩张的障碍占位网格地图可在规划算法中将机器人简化为一个点,然后通过建立数值化的障碍人工势场图来考虑障碍物的局部影响,并使用CA模型得到距离传播图,最后通过搜索势场超曲面的最小值获得从起始点到目标点的最优无碰撞路径。仿真结果表明,提出的算法可以获得最优无碰撞路径,最优路径足够光滑且与障碍有较大的安全距离,便于全向移动机器人跟踪。A path-planning algorithm for an omnidirectional mobile robot is presented based on Cellular Automata(CA) and artificial potential field, and the algorithm has been implemented by a 4-layer cellular automata model. First, an expanded occupancy grid map is constructed so that the mobile robot can be simplified as a point in the planning algorithm. Second, a digital obstacles artificial potential field map is obtained to include the local influence of the obstacles. Then, a distance propagation map is generated by a CA model. Finally, the optimal collision-free path from starting point to goal is extracted by following the minimum valley of the potential hypersurface. The simulation results show that the optimal collision-free paths can be found by the proposed algorithm. The optimal paths are smooth enough and have larger safety distance from the obstacles. So the optimal paths are convenient to track by an omnidirectional mobile robot.
分 类 号:TP24[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.27