基于改进RRT^(*)算法的可重构机器人路径规划  

Path planning of reconfigurable robot based on improved RRT^(*)algorithm

作　　者：郭茜 袁德成 GUO Qian;YUAN Decheng(School of Information Engineering,Shenyang University of Chemical Technology,Liaoning Shenyang 110142,China)

机构地区：[1]沈阳化工大学信息工程学院,辽宁沈阳110142

出　　处：《工业仪表与自动化装置》2023年第3期70-74,共5页Industrial Instrumentation & Automation

摘　　要：针对可重构机器人在复杂环境中的路径规划问题,设计了一种基于改进RRT^(*)算法的可重构机器人路径规划方法。首先,针对RRT^(*)算法规划时间过长问题,提出缩小节点采样空间法,并在迭代过程中优化采样区域,避免了资源的浪费。此外,设计了路径点冗余裁剪法,使得可重构机器人路径点数减少,拐点消减,总体规划路径缩短。在此基础上,建立多足可重构机器人的基本运动状态库,能够根据不同的环境改变自身构型来完成路径规划。采用MATLAB软件在障碍物数目和环境不同的状况下进行路径规划仿真实验,实验结果表明改进后的RRT^(*)算法减少了规划时间,缩短了规划路径,验证了算法的有效性。A reconfigurable robot path planning method based on the improved RRT^(*)algorithm is designed for the path planning problem of reconfigurable robots in complex environments.First,to solve the problem of long planning time of the RRT^(*)algorithm,a reduced node sampling space method is proposed,and the sampling area is optimised during the iteration process to avoid the waste of resources.In addition,the path point redundancy trimming method is designed to reduce the number of reconfigurable robot path points,abate the inflection points and shorten the overall planning path.Based on this,base on the basic motion state library of the multi-legged reconfigurable robot,it can change its own configuration according to different environments to complete the path planning.By using MATLAB software,the path planning simulation experiments are conducted under different conditions of obstacle number and environment.The results of the experiments show that the improved RRT^(*)algorithm reduces the planning time and shortens the planning path,which verifies the effectiveness of the algorithm.

关 键 词：可重构机器人 改进RRT^(*) 采样空间优化 节点冗余裁剪 路径规划 

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