检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黎竹娟[1]
出 处:《计算机仿真》2012年第12期247-250,共4页Computer Simulation
摘 要:研究机器人路径规划优化问题,机器人工作环境复杂,运动路径上存在许多障碍物。针对提高机器人安全导航性能问题,传统群智能算法存在早熟、搜索效率低等难题,难以获得全局最优路径。为了获得最优机器人运动路径,避免碰撞的发生,提出了一种人工蜂群算法的机器人路径规划方法。首先采用栅格法对机器人工作环境进行建模,然后机器人路径规划目标点作为蜜源,最后蜂群之间信息交换、协作搜索最优机器人运动路径。结果表明,人工蜂群算法解决了传统群智能算法存在的难题,加快了机器人路径规划求解速度,以较短时间找到最短机器人运动路径。Study about optimization problem of path planning of mobile robot. There are many obstacles in the robot work environment, the traditional swarm intelligence algorithm has the defects of premature convergence, low searching efficiency, and it is difficult to obtain the global optimal path. In order to obtain the optimal robot path to avoid the collision, this paper put forward a path planning of mobile robot based on artificial bee colony algorithm. Firstly, the grid method was used to model the robot working environment, and then the robot path planning target point was taken as a nectar source, lastly, the optimal robot path was obtained by the information change and colony cooperative. The results show that the proposed algorithm speeds up the robot path planning and finds the shortest robot path planning quickly.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249