随机树
运动规划
弹道
计算机科学
背景(考古学)
集合(抽象数据类型)
移动机器人
树(集合论)
机器人
路径(计算)
车辆动力学
状态空间
人工智能
工程类
数学
天文
程序设计语言
汽车工程
古生物学
数学分析
物理
统计
生物
作者
Liang Ma,Jianru Xue,Kuniaki Kawabata,Jihua Zhu,Chao Ma,Nanning Zheng
出处
期刊:IEEE Transactions on Intelligent Transportation Systems
[Institute of Electrical and Electronics Engineers]
日期:2015-02-13
卷期号:16 (4): 1961-1976
被引量:169
标识
DOI:10.1109/tits.2015.2389215
摘要
This paper introduces an efficient motion planning method for on-road driving of the autonomous vehicles, which is based on the rapidly exploring random tree (RRT) algorithm. RRT is an incremental sampling-based algorithm and is widely used to solve the planning problem of mobile robots. However, due to the meandering path, the inaccurate terminal state, and the slow exploration, it is often inefficient in many applications such as autonomous vehicles. To address these issues and considering the realistic context of on-road autonomous driving, we propose a fast RRT algorithm that introduces a rule-template set based on the traffic scenes and an aggressive extension strategy of search tree. Both improvements lead to a faster and more accurate RRT toward the goal state compared with the basic RRT algorithm. Meanwhile, a model-based prediction postprocess approach is adopted, by which the generated trajectory can be further smoothed and a feasible control sequence for the vehicle would be obtained. Furthermore, in the environments with dynamic obstacles, an integrated approach of the fast RRT algorithm and the configuration-time space can be used to improve the quality of the planned trajectory and the replanning. A large number of experimental results illustrate that our method is fast and efficient in solving planning queries of on-road autonomous driving and demonstrate its superior performances over previous approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI