预规划最优快速探索随机树  

Preplanned Rapidly-exploring Random Tree Star

作　　者：刘学宏 马浩东 付可 陈玲玲[1] LIU Xue-hong;MA Hao-dong;FU Ke;CHEN Ling-ling(Jilin Institute of Chemical Technology,Jilin 132022,Jilin)

机构地区：[1]吉林化工学院信息与控制工程学院,吉林吉林132022

出　　处：《电脑与电信》2023年第12期56-58,82,共4页Computer & Telecommunication

摘　　要：移动机器人的路径规划在应急救援、自主开采、仓库管理等各个领域起到了重要的作用。提出一种基于预规划抽样的路径规划方法,对于多障碍物环境下进行路径规划有良好的表现。该算法由预先路径生成过程和路径重规划过程组成。使用最优快速探索随机树(RRT^(*))算法获得初始路径作为先验知识,然后在此基础上通过蚁群算法重新优化规划得出最优路径。相比直接使用RRT^(*)算法路径长度更短,路径平滑度更好。The path planning of mobile robots plays an important role in emergency rescue,autonomous mining,warehouse management and other fields.This paper proposes a path planning method based on pre-planned sampling,which performs well in path planning for environments with multiple obstacles.The algorithm consists of a pre-path generation process and a path re-planning process.It utilizes the Optimal Rapidly-exploring Random Tree(RRT^(*))algorithm to generate an initial path as prior knowledge.Then,it further optimizes the planning by applying the Ant Colony Algorithm on this basis,resulting in the optimal path.Compared to directly using the RRT^(*) algorithm,this approach yields shorter path length and smoother trajectory.

关 键 词：最优快速探索随机树 蚁群算法 路径规划 

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