[1]刘钰 陆建峰 蔡海舟.基于改进A＊算法的机器人路径规划方法研究[J].计算机技术与发展,2012,(12):108-111.
　LIU Yu,LU Jian-feng,CAI Hai-zhou.Research on Path Planning Method of Robot Based on Improved A ＊ Algorithm[J].,2012,(12):108-111.
点击复制

基于改进A＊算法的机器人路径规划方法研究()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2012年12期
页码:
108-111
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
Research on Path Planning Method of Robot Based on Improved A ＊ Algorithm
文章编号:
1673-629X（2012）12-0108-04
作者:
刘钰1 陆建峰2 蔡海舟1
[1]金陵科技学院信息技术学院[2]南京理工大学计算机科学与技术学院
Author(s):
LIU Yu;  LU Jian-feng ; CAI Hai-zhou
[1]School of Information Technology, Jinling Institute of Technology[2]School of Computer Science ＆ Technology, Nanjing University of Science ＆ Technology
关键词:
A＊算法; 机器人; 路径规划; 栅格
Keywords:
A ＊ algorithm;  robot;  path planning ;  grid
分类号:
TP301.6
文献标志码:
A
摘要:
在机器人智能控制的研究中，路径规划是移动机器人研究的重要内容。为提高常规路径规划方法中执行效率和稳定性，采用头尾双向搜索法对普通A＊算法进行优化，即分别从起始节点和目标节点开始扩展，直到在中途有相同的临界子节点。同时改进节点h值的计算方式，以减少扩展节点的规模，并在仿真平台上进行机器人路径规划仿真，改进算法效果得以优化验证。仿真实验结果表明，该方法的寻优能力及稳定性均优于普通A＊算法，可使智能机器人更高效地进行自主导航
Abstract:
Path planning is important subjects in research of mobile robots control. In order to increase the efficiency and stability of usual ways used in path planning, the searching method of double direction has been used to optimize common A ＊ algorithm. Such method may expand the starting node and the goal node at the same time, and if a same adjacency child node was found in the way, the algorithm would be terminated. In the meanwhile, the calculating way of the h value of a node was also improved to reduce the size of the extended nodes. By the simulation of path planning on the virtual platform, the results of simulating experiments prove that the ability of finding the best solution and the stability of this method are greatly improved compared with common A ＊ method,consequently the planning path of intelligent robots can be much efficient

相似文献/References:

[1]单承刚.嵌入式Linux下超声波避障系统设计[J].计算机技术与发展,2009,(06):29.
　SHAN Cheng-gang.Design of Ultrasonic Obstacle Avoidance System in Embedded Linux System[J].,2009,(12):29.
[2]张荣松 包家汉.基于改进遗传算法的机器人路径规划[J].计算机技术与发展,2009,(07):20.
　ZHANG Rong-song,BAO Jia-han.Robot Path Planning Based on Modified Genetic Algorithm[J].,2009,(12):20.
[3]郑延斌 李新源 段德全.一种保持Agent团队队形的路径规划方法[J].计算机技术与发展,2009,(07):159.
　ZHENG Yan-bin,LI Xin-yuan,DUAN De-quan.A Path Planning Algorithm with Agent Team Formation Maintained[J].,2009,(12):159.
[4]冯晓辉 马光思.数码谜题求解的算法设计及其扩展研究[J].计算机技术与发展,2009,(08):110.
　FENG Xiao-hui,MA Guang-si.Algorithm Design and Extension Research of N - Puzzle Problem[J].,2009,(12):110.
[5]李培 何中市.基于ArcGIS和GPS的水电气管理系统设计与实现[J].计算机技术与发展,2009,(01):172.
　LI Pei,HE Zhong-shi.Design and Implementation Water, Electricity and Gas Management System Based on ArcGIS and GPS[J].,2009,(12):172.
[6]陈虹 梁文彬 李宗宝 董航飞.基于机器人的神经网络预测控制算法[J].计算机技术与发展,2008,(08):65.
　CFIEN Hong,LIANG Wen-bin,LI Zong-bao,et al.A Neural Network Predictive Control Algorithm Based on Robot[J].,2008,(12):65.
[7]陈得宝 李庆 李群 李峥.基于内分泌思想的改进粒子群算法[J].计算机技术与发展,2008,(10):61.
　CHEN De-bao,LI Qing,LI Qun,et al.An Improved Particle Swarm Algorithm Based on Endocrine Idea[J].,2008,(12):61.
[8]朱永红 张燕平.用VC＋＋实现基于A＊算法的八数码问题[J].计算机技术与发展,2006,(09):32.
　ZHU Yong-hong,ZHANG Yan-ping.Programming for Eight - Figure Puzzle Problem Based on Algorithm A ＊ with Visual C ＋ ＋[J].,2006,(12):32.
[9]陈益富 卢潇 丁豪杰.对Dijkstra算法的优化策略研究[J].计算机技术与发展,2006,(09):73.
　CHEN Yi-fu,LU Xiao,DING Hao-jie.Optimized Strategy Research over Algorithm of Dijkstra[J].,2006,(12):73.
[10]方伟华.基于A＊算法和图遍历的烟草物流VRP的研究[J].计算机技术与发展,2011,(12):63.
　FANG Wei-hua.Research on Tobacco Logistics VRP Based on A ＊ Algorithm and Graph Traversal[J].,2011,(12):63.

备注/Memo

备注/Memo:
国家自然科学基金（61005008,60803049）刘钰（1980-），女，江苏南京人，讲师，硕士，研究方向为人工智能与模式识别；陆建峰，教授，博士，博士生导师，研究方向为人工智能与模式识别
更新日期/Last Update: 1900-01-01