航路点
强化学习
随机树
计算机科学
运动规划
路径(计算)
利用
人工智能
选择(遗传算法)
数学优化
算法
数学
实时计算
机器人
计算机安全
程序设计语言
作者
Huashan Liu,Yueqing Gu,Xiangjian Li,Xinjie Xiao
标识
DOI:10.1109/wrcsara60131.2023.10261849
摘要
Rapidly-exploring random tree (RRT) algorithm, featured with strong exploration capability, is widely used in path planning tasks. However, it is difficult for RRT to find the optimal path due to its inherent characteristics of random sampling. In this paper, we propose an improved RRT algorithm integrated with deep reinforcement learning (IRRT-DRL), which can effectively search for feasible paths and exploit previous experience for optimization. It includes a unique reward function and a dynamic waypoint selection mechanism that automatically adjusts the interval between adjacent waypoints to help the agent bypass obstacles. Experimental results have verified the feasibility and superiority of the proposed approach.
科研通智能强力驱动
Strongly Powered by AbleSci AI