首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Path Planning for Autonomous Articulated Vehicle Based on Improved Goal-Directed Rapid-Exploring Random Tree
【24h】

Path Planning for Autonomous Articulated Vehicle Based on Improved Goal-Directed Rapid-Exploring Random Tree

机译:基于改进目标导向快速探索随机树的自主铰接式车辆路径规划

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The special steering characteristics and task complexity of autonomous articulated vehicle (AAV) make it often require multiple forward and backward movements during autonomous driving. In this paper, we present a simple yet effective method, named head correction with fixed wheel position (HC-FWP), for the demand of multiple forward and backward movements. The goal-directed rapid-exploring random tree (GDRRT) algorithm is first used to search for a feasible path in the obstacle map, and then, the farthest node search (FNS) algorithm is applied to obtain a series of key nodes, on which HC-FWP is used to correct AAV heading angles. Simulation experiments with Dynapac CC6200 articulated road roller parameters show that the proposed improved goal-directed rapid-exploring random tree (IGDRRT), consisting of GDRRT, FNS, and HC-FWP, can search a feasible path on maps that require the AAV to move back and forth.
机译:自动铰接式汽车(AAV)的特殊转向特性和任务复杂性使其在自动驾驶过程中经常需要多次向前和向后运动。在本文中,我们提出了一种简单而有效的方法,称为固定轮位头部校正(HC-FWP),用于多次向前和向后运动的需求。首先采用目标导向快速探索随机树(GDRRT)算法在障碍物图中搜索可行路径,然后应用最远节点搜索(FNS)算法得到一系列关键节点,并在其上利用HC-FWP校正AAV航向角。使用戴纳派克CC6200铰接式压路机参数的仿真实验表明,由GDRRT、FNS和HC-FWP组成的改进目标导向快速探索随机树(IGDRRT)可以在需要AAV来回移动的地图上搜索到可行的路径。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号