摘要
为解决移动机器人全局最优路径规划存在的问题,提出了一种基于元胞自动机的路径规划算法。建立了移动机器人活动空间的环境模型,将移动机器人的起点、终点、障碍物及自由通路定义为一组离散的元胞,设计了元胞状态的演化规则,并且根据演化后的元胞状态确定了最优路径的搜索方法,并通过仿真实验验证了该算法在简单环境和复杂环境下都能够有效的进行路径规划,并且具有算法简单、速度快、效率高等特点。
In order to solve the existence question of the global optimal path planning for mobile robots,one kind of the path planning algorithm was proposed based on the cellular automaton.Firstly,the mobile robot space environment was established,mobile robot start,end,obstacles and free path was defined as a set of discrete cellular.Secondly,a cellular state evolution a rule was designed,the optimal path search method was determined according to the evolution of cellular state.Finally,the simulation experiments showed that the algorithm could be effective for path planning in the simple and complex environment.The algorithm was simple,fast,high and efficiency.
出处
《南昌大学学报（工科版）》
CAS
2012年第3期287-290,共4页
Journal of Nanchang University(Engineering & Technology)
基金
国家863计划资助项目(2008AA01Z133)
