节点文献
一种室内环境下移动机器人的路径规划新算法
A New Path Planning Algorithm for Indoor Mobile Robot
【摘要】 文章首先建立移动机器人对室内环境的全局模型,通过任务规划将全局目标分解为易于实现的多个子目标。然后针对每一个子目标,根据机器人边界圆直径构建一种改进的可视图,利用可视图和Dijkstra算法得到对子目标的全局路径,从而实现全局目标的路径规划。该算法简单,适于室内环境下移动机器人的实时导航系统。
【Abstract】 A new path planning algorithm for indoor mobile robot is proposed in this article.Firstly,the gross goal is decomposed into multiple sub-goals with the global model of indoor environment.For each sub-goal,a modified visibility graph is constructed due to the diameter of robot bound circle.After the global path of each sub-goal be computed using Dijkstra’s algorithm and its visibility graph,the path planning of gross goal is realized.This algorithm is simple and can be used on the realtime navigation system of indoor mobile robot.
【关键词】 路径规划;
移动机器人;
可视图;
Dijkstra算法;
导航;
【Key words】 path plan; mobile robot; visibility graph; Dijkstra’s algorithm; navigation;
【Key words】 path plan; mobile robot; visibility graph; Dijkstra’s algorithm; navigation;
【基金】 国家自然科学基金资助项目(编号:60374032)
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2006年20期
- 【分类号】TP242
- 【被引频次】9
- 【下载频次】302