Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.12129 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910335976341504 |
|---|---|
| author | T, Sugirtha S, Pranav Dasiah, Nitin Benjamin M, Sridevi |
| author_facet | T, Sugirtha S, Pranav Dasiah, Nitin Benjamin M, Sridevi |
| contents | Essential tasks in autonomous driving includes environment perception, detection and tracking, path planning and action control. This paper focus on path planning, which is one of the challenging task as it needs to find optimal path in highly complex and dynamic environments. Usually, a driving scenario has large number of obstacles in their route. In this paper, we propose a two-stage path planning algorithm named Angle-based Directed Rapidly exploring Random Trees (AD-RRT*) to address the problem of optimal path in complex environment. The proposed algorithm uses A* algorithm for global path planning and modifies RRT* to bound the samples using angle. The efficiency of the proposed algorithm is evaluated through experiments in different scenarios based on the location and number of obstacles. The proposed algorithm showed higher rate of convergence with reduced time and less number of nodes than the base RRT* algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_12129 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Modified RRT* for Path Planning in Autonomous Driving T, Sugirtha S, Pranav Dasiah, Nitin Benjamin M, Sridevi Robotics Essential tasks in autonomous driving includes environment perception, detection and tracking, path planning and action control. This paper focus on path planning, which is one of the challenging task as it needs to find optimal path in highly complex and dynamic environments. Usually, a driving scenario has large number of obstacles in their route. In this paper, we propose a two-stage path planning algorithm named Angle-based Directed Rapidly exploring Random Trees (AD-RRT*) to address the problem of optimal path in complex environment. The proposed algorithm uses A* algorithm for global path planning and modifies RRT* to bound the samples using angle. The efficiency of the proposed algorithm is evaluated through experiments in different scenarios based on the location and number of obstacles. The proposed algorithm showed higher rate of convergence with reduced time and less number of nodes than the base RRT* algorithm. |
| title | Modified RRT* for Path Planning in Autonomous Driving |
| topic | Robotics |
| url | https://arxiv.org/abs/2402.12129 |