ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Displaying 1 - 2 of 2
Filtering by
- All Subjects: Dynamic Programming
Description
The environmental impact of the fossil fuels has increased tremendously in the last decade. This impact is one of the most contributing factors of global warming. This research aims to reduce the amount of fuel consumed by vehicles through optimizing the control scheme for the future route information. Taking advantage of more degrees of freedom available within PHEV, HEV, and FCHEV “energy management” allows more margin to maximize efficiency in the propulsion systems. The application focuses on reducing the energy consumption in vehicles by acquiring information about the road grade. Road elevations are obtained by use of Geographic Information System (GIS) maps to optimize the controller. The optimization is then reflected on the powertrain of the vehicle.The approach uses a Model Predictive Control (MPC) algorithm that allows the energy management strategy to leverage road grade to prepare the vehicle for minimizing energy consumption during an uphill and potential energy harvesting during a downhill. The control algorithm will predict future energy/power requirements of the vehicle and optimize the performance by instructing the power split between the internal combustion engine (ICE) and the electric-drive system. Allowing for more efficient operation and higher performance of the PHEV, and HEV. Implementation of different strategies, such as MPC and Dynamic Programming (DP), is considered for optimizing energy management systems. These strategies are utilized to have a low processing time. This approach allows the optimization to be integrated with ADAS applications, using current technology for implementable real time applications.
The Thesis presents multiple control strategies designed, implemented, and tested using real-world road elevation data from three different routes. Initial simulation based results show significant energy savings. The savings range between 11.84% and 25.5% for both Rule Based (RB) and DP strategies on the real world tested routes. Future work will take advantage of vehicle connectivity and ADAS systems to utilize Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), traffic information, and sensor fusion to further optimize the PHEV and HEV toward more energy efficient operation.
The Thesis presents multiple control strategies designed, implemented, and tested using real-world road elevation data from three different routes. Initial simulation based results show significant energy savings. The savings range between 11.84% and 25.5% for both Rule Based (RB) and DP strategies on the real world tested routes. Future work will take advantage of vehicle connectivity and ADAS systems to utilize Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), traffic information, and sensor fusion to further optimize the PHEV and HEV toward more energy efficient operation.
ContributorsAlzorgan, Mohammad (Author) / Mayyas, Abdel Ra’ouf (Thesis advisor) / Berman, Spring (Committee member) / Ren, Yi (Committee member) / Arizona State University (Publisher)
Created2016
Description
Modern life is full of challenging optimization problems that we unknowingly attempt to solve. For instance, a common dilemma often encountered is the decision of picking a parking spot while trying to minimize both the distance to the goal destination and time spent searching for parking; one strategy is to drive as close as possible to the goal destination but risk a penalty cost if no parking spaces can be found. Optimization problems of this class all have underlying time-varying processes that can be altered by a decision/input to minimize some cost. Such optimization problems are commonly solved by a class of methods called Dynamic Programming (DP) that breaks down a complex optimization problem into a simpler family of sub-problems. In the 1950s Richard Bellman introduced a class of DP methods that broke down Multi-Stage Optimization Problems (MSOP) into a nested sequence of ``tail problems”. Bellman showed that for any MSOP with a cost function that satisfies a condition called additive separability, the solution to the tail problem of the MSOP initialized at time-stage k>0 can be used to solve the tail problem initialized at time-stage k-1. Therefore, by recursively solving each tail problem of the MSOP, a solution to the original MSOP can be found. This dissertation extends Bellman`s theory to a broader class of MSOPs involving non-additively separable costs by introducing a new state augmentation solution method and generalizing the Bellman Equation. This dissertation also considers the analogous continuous-time counterpart to discrete-time MSOPs, called Optimal Control Problems (OCPs). OCPs can be solved by solving a nonlinear Partial Differential Equation (PDE) called the Hamilton-Jacobi-Bellman (HJB) PDE. Unfortunately, it is rarely possible to obtain an analytical solution to the HJB PDE. This dissertation proposes a method for approximately solving the HJB PDE based on Sum-Of-Squares (SOS) programming. This SOS algorithm can be used to synthesize controllers, hence solving the OCP, and also compute outer bounds of reachable sets of dynamical systems. This methodology is then extended to infinite time horizons, by proposing SOS algorithms that yield Lyapunov functions that can approximate regions of attraction and attractor sets of nonlinear dynamical systems arbitrarily well.
ContributorsJones, Morgan (Author) / Peet, Matthew M (Thesis advisor) / Nedich, Angelia (Committee member) / Kawski, Matthias (Committee member) / Mignolet, Marc (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2021