检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:万方 周风余[1] 尹磊[1] 王玉刚 陈科 沈冬冬 WAN Fang;ZHOU Fengyu;YIN Lei;WANG Yugang;CHEN Ke;SHEN Dongdong({School of Control Science and Engineering,Shandong University,Jinan 250061,China)
机构地区:[1]山东大学控制科学与工程学院
出 处:《机器人》2019年第6期742-750,共9页Robot
基 金:国家重点研发计划(2017YFB1302400);国家自然科学基金(617732400);山东省重点研发计划(2017CXGC0926,2017GGX30133)
摘 要:针对传统路径规划算法计算量大、电路映射地图建模复杂等问题,提出了一种基于电势场法的路径规划新方法.首先,为降低环境建模的复杂度,对Zhang细化算法进行了改进,获得能够细致描绘地图连通关系的骨干图;在此基础上,提出了一种基于电势场理论的模型建立方法,此后通过对模型电流通路的快速搜索获取初始路线,大大降低了路径规划算法的运算量;然后,基于内接圆角方法对路径进行平滑处理,解决了路径离散问题,得到适合服务机器人行走的最优路径.大量对比实验表明,该改进Zhang细化算法有效降低了建模及求解复杂度,提出的基于电势场法的全局路径规划算法很好地解决了传统算法搜索效率低的问题.A new path planning method based on the electric potential field method is proposed aiming at the problems of large computation and complex circuit mapping modeling in traditional path planning algorithms. Firstly, in order to reduce the complexity of environment modeling, the improved Zhang thinning algorithm is used to obtain the backbone diagram, which can depict the connectivity of the map in detail. Secondly, based on the backbone diagram, a model building method based on the electric potential field theory is proposed, and the initial route is obtained by searching the current path of the model quickly, which greatly reduces the computational complexity of the path planning algorithm. Then, the path is smoothed based on the inner fillet method to get the optimal path for the service robot, solving the problem of path discretization. A large number of comparative experiments show that the improved Zhang thinning algorithm proposed effectively reduces the complexity of modeling and solving. The proposed global path-planning algorithm based on the electric potential field solves the problem of low search efficiency of traditional algorithms.
关 键 词:电势场 Zhang细化算法 全局路径规划 路径优化 移动机器人
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145