能耗最优下轮式移动机器人作业路径规划的最优节点A^(*)算法  

An Optimal Node A^(*)Algorithm for Path Planning of Wheeled Mobile Robot Under Optimal Energy Consumption

作　　者：江磊[1] 贾文友[1] 刘莉[1] 梁利东[1] 魏文涛 JIANG Lei;JIA Wenyou;LIU Li;LIANG Lidong;WEI Wentao(School of Mechanical Engineering,Anhui Polytechnic University,Wuhu 241000,Anhui,China)

机构地区：[1]安徽工程大学机械工程学院,安徽芜湖241000

出　　处：《机械科学与技术》2023年第6期949-955,共7页Mechanical Science and Technology for Aerospace Engineering

基　　金：安徽高校省级科学研究项目(KJ2016A057,KJ2018A0102)。

摘　　要：轮式移动机器人以蓄电池作为能源,能够提供的能量有限,以更省能量作为前提进行路径规划是一个热门研究方向。根据轮式移动机器人在运行时的能耗组成,综合电机效率、地面摩擦、地形、速度变化、转弯等多因素,建立了能耗模型;基于A^(*)算法,利用最优节点的搜索方式,提出能耗最优下轮式移动机器人作业路径规划最优节点A^(*)算法;通过仿真实验,与最短距离约束条件、能耗最优约束条件下A^(*)算法路径规划结果进行对比,所提算法既实现在单位距离能耗降低,又缩短规划寻路时间,验证了所提算法的有效性。Batteries are used as the energy source of a wheeled mobile robot,which is,however,limited.Based on the composition of energy consumption of the wheeled mobile robot in operation,its energy consumption model is established by integrating the motor efficiency,ground friction,terrain,speed change,turning and other factors.The optimal node A^(*)algorithm for the path planning of the wheeled mobile robot under optimal energy consumption is proposed with the optimal node search method.The simulation results,compared with the path planning results of the A^(*)algorithm under the shortest distance constraint and optimal energy consumption constraint,show that the optimal node A^(*)algorithm can not only reduce the energy consumption per unit distance but also shorten the path-finding time,thus verifying its effectiveness.

关 键 词：轮式移动机器人 能耗最优 最优节点A^(*)算法 

分 类 号：TP23[自动化与计算机技术—检测技术与自动化装置]