Motion Planning For Autonomous Vehicles In Non-Signalized Intersections
| dc.contributor.author | Patel, Darshit Satishkumar | en |
| dc.contributor.committeechair | Eskandarian, Azim | en |
| dc.contributor.committeemember | Taheri, Saied | en |
| dc.contributor.committeemember | Akbari Hamed, Kaveh | en |
| dc.contributor.department | Mechanical Engineering | en |
| dc.date.accessioned | 2023-07-26T08:00:23Z | en |
| dc.date.available | 2023-07-26T08:00:23Z | en |
| dc.date.issued | 2023-07-25 | en |
| dc.description.abstract | Real-time path generation, including collision checks, is vital in critical driving scenarios such as navigating non-signalized intersections. These intersections lack organized traffic flow, which raises the risk of accidents. Rapidly Exploring Random Trees (RRT) is a widely adopted algorithm in robotics for motion planning due to its simplicity and probabilistic completeness. Over the years, researchers have made modifications to the basic RRT algorithm to improve its performance in dynamic environments, making it a favored planning algorithm for autonomous driving. Among these variants, probabilistic RRT (pRRT) demonstrates promising capabilities for efficient online replanning. The first part of the thesis thoroughly studies the pRRT algorithm and compares its performance to the standard RRT and RRT* algorithms through Python simulations. The pRRT algorithm outperformed the RRT and RRT* algorithms in terms of success rate and time to find a safe trajectory. The algorithm was implemented experimentally on scaled cars for the validation of its feasibility. The experimental results show good sim-to-real transfer for this algorithm. The second part of the thesis proposes a novel algorithm for path planning. The algorithm outperforms the standard RRT and pRRT techniques in terms of optimality and conformance to human instincts. The generated paths are much smoother and easier for the controller to track. The AV implementation combines the probabilistic RRT with the RRT-Connect algorithm to mitigate the problem of parameter tuning of the standard pRRT algorithm. The idea is to generate intermediate critical points around the obstacles to grow multiple trees between these points, which are then eventually connected if a safe trajectory is found. The algorithm was tested in simulation and showed comparatively better performance in handling obstacles. | en |
| dc.description.abstractgeneral | Due to uncontrolled traffic flow, non-signalized intersections are critical for autonomous driving. Motion planning is responsible for the vehicle's decision-making and generating actions based on its surroundings. Rapidly Exploring Random Trees (RRT) is one of the most widely used algorithms for motion planning in robotics due to its simplicity and a guarantee of finding a collision-free path if it exists. Due to the randomness of the algorithm, the time to find a collision-free path increases rapidly as the surrounding environment complicates. In this thesis, we thoroughly study a modified version of RRT called the probabilistic RRT (pRRT) for motion planning of autonomous vehicles. The pRRT algorithm reduces the randomness of the standard RRT algorithm and takes into account the destination location and the positions of the obstacles to find a path around the obstacles and toward the destination point. The algorithm was experimentally validated and confirmed the simplistic transfer from simulations to reality. In the second part of the thesis, we propose a novel algorithm that combines the properties of pRRT and another well-known algorithm called RRT-Connect. This algorithm plans collision-free paths from the start, and the goal points towards free space around the obstacles simultaneously and then combines these fragmented paths. This reduces the overall planning time and was found to be better at providing smooth paths. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:38203 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/115853 | en |
| dc.language.iso | en | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Motion Planning | en |
| dc.subject | Autonomous Vehicles | en |
| dc.subject | Sampling-Based Algorithms | en |
| dc.subject | Vehicle Control | en |
| dc.title | Motion Planning For Autonomous Vehicles In Non-Signalized Intersections | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Mechanical Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |