Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
High-Density Parking For Autonomous Vehicles., Parag J. Siddique
High-Density Parking For Autonomous Vehicles., Parag J. Siddique
Electronic Theses and Dissertations
In a common parking lot, much of the space is devoted to lanes. Lanes must not be blocked for one simple reason: a blocked car might need to leave before the car that blocks it. However, the advent of autonomous vehicles gives us an opportunity to overcome this constraint, and to achieve a higher storage capacity of cars. Taking advantage of self-parking and intelligent communication systems of autonomous vehicles, we propose puzzle-based parking, a high-density design for a parking lot. We introduce a novel method of vehicle parking, which leads to maximum parking density. We then propose a heuristic method …
Safe And Efficient Intelligent Intersection Control Of Autonomous Vehicles, Qiang Lu
Safe And Efficient Intelligent Intersection Control Of Autonomous Vehicles, Qiang Lu
Electronic Theses and Dissertations
In this dissertation, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, we propose several algorithms to handle different traffic environments. First, an algorithm that is called the Discrete-time occupancies trajectory (DTOT) based Intersection traffic Coordination Algorithm (DICA) is proposed. All vehicles in the system are Connected and Autonomous Vehicles (CAVs) and capable of wireless Vehicle-to-Intersection communication. The main advantage of DICA is that it enables us to utilize the intersection space more efficiently resulting in less delay for vehicles to cross the intersection. In the proposed framework, …
Optimized Trajectory Generation For Car-Like Robots On A Closed Loop Track, Tyler Friedl
Optimized Trajectory Generation For Car-Like Robots On A Closed Loop Track, Tyler Friedl
Electronic Theses and Dissertations
This thesis presents a method for generating an optimized path through a given track. The path is generated by choosing waypoints throughout the track then iteratively optimizing the position of these waypoints. The waypoints are then connected by optimized paths represented by curvature polynomials. The end result is a path through the track represented as a spline of curvature polynomials. This method is applied to multiple simulated tracks and the results are presented. By generating and representing the paths in the continuous domain, the method has improved computational efficiency from many of the discrete methods used to generate an optimal …