Search Results

This paper investigates series plug-in hybrid electric vehicle (PHEV) behavior during one-day with synthesized representative one-day missions. The amounts of electric energy and fuel consumption are predicted to assess the PHEV impact on the grid with respect to the driving distance and different charging scenarios: (1) charging overnight, (2) charging whenever possible. The representative cycles are synthesized using the extracted information from the real-world driving data in Southeast Michigan gathered through the Field Operational Tests (FOT) conducted by the University of Michigan Transportation Research Institute (UMTRI). The real-world driving data include 4,409 trips covering 830 independent days and temporal distributions of departure and arrival times. The sample size is large enough to represent real-world driving.

The number of control actuators available on spark-ignition engines is rapidly increasing to meet demand for improved fuel economy and reduced exhaust emissions. The added complexity greatly complicates control strategy development because there can be a wide range of potential actuator settings at each engine operating condition, and map-based actuator calibration becomes challenging as the number of control degrees of freedom expand significantly. Many engine actuators, such as variable valve actuation and flow control valves, directly influence in-cylinder combustion through changes in gas exchange, mixture preparation, and charge motion. The addition of these types of actuators makes it difficult to predict the influences of individual actuator positioning on in-cylinder combustion without substantial experimental complexity.

A supervisory controller strategy for a hybrid vehicle coordinates the operation of the two power sources onboard of a vehicle to maximize objectives like fuel economy. In the past, various control strategies have been developed using heuristics as well as optimal control theory. The Stochastic Dynamic Programming (SDP) has been previously applied to determine implementable optimal control policies for discrete time dynamic systems whose states evolve according to given transition probabilities. However, the approach is constrained by the curse of dimensionality, i.e. an exponential increase in computational effort with increase in system state space, faced by dynamic programming based algorithms. This paper proposes a novel approach capable of overcoming the curse of dimensionality and solving policy optimization for a system with very large design state space.