Predictive Path Planning For Vehicles at Non-signalized Intersections
| dc.contributor.author | Wu, Xihui | en |
| dc.contributor.committeechair | Eskandarian, Azim | en |
| dc.contributor.committeemember | Wicks, Alfred L. | en |
| dc.contributor.committeemember | Zuo, Lei | en |
| dc.contributor.department | Mechanical Engineering | en |
| dc.date.accessioned | 2022-03-18T06:00:07Z | en |
| dc.date.available | 2022-03-18T06:00:07Z | en |
| dc.date.issued | 2020-09-23 | en |
| dc.description.abstract | In the context of path planning, the non-signalized intersections are always a challenging scenario due to the mixture of traffic flow. Most path planning algorithms use the information at the current time instance to generate an optimal path. Because of the dynamics of the non-signalized intersections, iteratively generating a path in a high frequency is necessary, resulting in an enormous waste of computational resources. Rapidly-exploring Random Tree (RRT) as an effective local path planning methodology can determine a feasible path in the static environment. Few improvements are proposed to adopt the RRT to the non-signalized intersections. Gaussian Processes Regression (GPR) is used to predict the other vehicles' future location. The location information in the current and future time instance is used to generate a probability position map. The map not only avoids useless sampling procedures but also increases the speed of generating a path. The optimal steering strategy is deployed to guarantee the trajectory is collision-free in both current and future time frames. Overall, the proposed probabilistic RRT algorithm can select a collision-free path in the non-signalized intersections by combining the GPR, probability position map, and optimal-steering. | en |
| dc.description.abstractgeneral | Path planning problem is a challenge in the non-signalized intersections. Many path planning algorithms can generate an optimal path in the space domain but not in the time domain. Thus, the algorithms need to run iteratively at a high frequency to ensure the path's optimality in the time domain. By combining prediction and the standard RRT path planning algorithm, the resulting path ensures to be optimal in the space and time domain. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:27049 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/109355 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | path planning | en |
| dc.subject | autonomous vehicle | en |
| dc.subject | motion planning | en |
| dc.title | Predictive Path Planning For Vehicles at 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 |
Files
Original bundle
1 - 1 of 1