Optimal speed trajectory and energy management control for connected and automated vehicles

Connected and automated vehicles (CAVs) emerge as a promising solution to improve urban mobility, safety, energy efficiency, and passenger comfort with the development of communication technologies, such as vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I). This thesis proposes several control approaches for CAVs with electric powertrains, including hybrid electric vehicles (HEVs) and battery electric vehicles (BEVs), with the main objective to improve energy efficiency by optimising vehicle speed trajectory and energy management system. By types of vehicle control, these methods can be categorised into three main scenarios, optimal energy management for a single CAV (single-vehicle), energy-optimal strategy for the vehicle following scenario (two-vehicle), and optimal autonomous intersection management for CAVs (multiple-vehicle). The first part of this thesis is devoted to the optimal energy management for a single automated series HEV with consideration of engine start-stop system (SSS) under battery charge sustaining operation. A heuristic hysteresis power threshold strategy (HPTS) is proposed to optimise the fuel economy of an HEV with SSS and extra penalty fuel for engine restarts. By a systematic tuning process, the overall control performance of HPTS can be fully optimised for different vehicle parameters and driving cycles. In the second part, two energy-optimal control strategies via a model predictive control (MPC) framework are proposed for the vehicle following problem. To forecast the behaviour of the preceding vehicle, a neural network predictor is utilised and incorporated into a nonlinear MPC method, of which the fuel and computational efficiencies are verified to be effective through comparisons of numerical examples between a practical adaptive cruise control strategy and an impractical optimal control method. A robust MPC (RMPC) via linear matrix inequality (LMI) is also utilised to deal with the uncertainties existing in V2V communication and modelling errors. By conservative relaxation and approximation, the RMPC problem is formulated as a convex semi-definite program, and the simulation results prove the robustness of the RMPC and the rapid computational efficiency resorting to the convex optimisation. The final part focuses on the centralised and decentralised control frameworks at signal-free intersections, where the energy consumption and the crossing time of a group of CAVs are minimised. Their crossing order and velocity trajectories are optimised by convex second-order cone programs in a hierarchical scheme subject to safety constraints. It is shown that the centralised strategy with consideration of turning manoeuvres is effective and outperforms a benchmark solution invoking the widely used first-in-first-out policy. On the other hand, the decentralised method is proposed to further improve computational efficiency and enhance the system robustness via a tube-based RMPC. The numerical examples of both frameworks highlight the importance of examining the trade-off between energy consumption and travel time, as small compromises in travel time could produce significant energy savings.Open Acces

Coordination and Analysis of Connected and Autonomous Vehicles in Freeway On-Ramp Merging Areas

Freeway on-ramps are typical bottlenecks in the freeway network, where the merging maneuvers of ramp vehicles impose frequent disturbances on the traffic flow and cause negative impacts on traffic safety and efficiency. The emerging Connected and Autonomous Vehicles (CAVs) hold the potential for regulating the behaviors of each individual vehicle and are expected to substantially improve the traffic operation at freeway on-ramps. The aim of this research is to explore the possibilities of optimally facilitating freeway on-ramp merging operation through the coordination of CAVs, and to discuss the impacts of CAVs on the traffic performance at on-ramp merging.In view of the existing research efforts and gaps in the field of CAV on-ramp merging operation, a novel CAV merging coordination strategy is proposed by creating large gaps on the main road and directing the ramp vehicles into the created gaps in the form of platoon. The combination of gap creation and platoon merging jointly facilitates the mainline and ramp traffic and targets at the optimal performance at the traffic flow level. The coordination consists of three components: (1) mainline vehicles proactively decelerate to create large merging gaps; (2) ramp vehicles form platoons before entering the main road; (3) the gaps created on the main road and the platoons formed on the ramp are coordinated with each other in terms of size, speed, and arrival time. The coordination is analytically formulated as an optimization problem, incorporating the macroscopic and microscopic traffic flow models. The model uses traffic state parameters as inputs and determines the optimal coordination plan adaptive to real-time traffic conditions.The impacts of CAV coordination strategies on traffic efficiency are investigated through illustrative case studies conducted on microscopic traffic simulation platforms. The results show substantial improvements in merging efficiency, throughput, and traffic flow stability. In addition, the safety benefits of CAVs in the absence of specially designed cooperation strategies are investigated to reveal the CAV’s ability to eliminate critical human factors in the ramp merging process

VEHICLE DYNAMICS MODELING AND MOTION PLANNING WITH PREDICTABLE TIMING AND VELOCITY

Department of Computer EngineeringIntelligent transportation systems and autonomous vehicles can improve how we drive, save energy and avoid traffic accidents. However, we still need to make more effort on the process of interdisciplinary research to turn these systems into reality. My work, aimed to contribute to this process, consists of two parts. In the first part, I address a longitudinal motion planning problem in which a vehicle aims to arrive at a given position on a road segmented based on various driving conditions at a given time and velocity. I show that it is possible to fully describe the set of all reachable arrival configurations using a table of closed-form equations, under a simplified model of vehicles with linear acceleration. Then I devise a sampling-based algorithm to solve this motion planning problem, using the table to check whether a feasible plan exist. The simulation results showed that the proposed sampling-based algorithmwith heuristics has a higher probability of success than the simple random sampling approach. After that, I will discuss how to use the feasible set on real vehicles. In this part, the task of planning on a segment is executed by using the bisection method, which utilizes the dynamics model of a vehicle. This model, however, is not always available and empirically expensive to obtain. Therefore, in the second part, I focus on the problem of learning a vehicle dynamics model. I introduce an instance-based learning method to learn a performance model automatically, and compare it with the artificial neural network and matrix factorization methods. Furthermore, an exploration strategy called plan-based exploration, based on planning using the reference model is given to speed up the learning process. Our experimental results demonstrated that the instance-based learning method coupled with the plan-based exploration strategy has the fastest learning rate.ope

A Computationally Efficient Bi-level Coordination Framework for CAVs at Unsignalized Intersections

In this paper, we investigate cooperative vehicle coordination for connected and automated vehicles (CAVs) at unsignalized intersections. To support high traffic throughput while reducing computational complexity, we present a novel collision region model and decompose the optimal coordination problem into two sub-problems: \textit{centralized} priority scheduling and \textit{distributed} trajectory planning. Then, we propose a bi-level coordination framework which includes: (i) a Monte Carlo Tree Search (MCTS)-based high-level priority scheduler aims to find high-quality passing orders to maximize traffic throughput, and (ii) a priority-based low-level trajectory planner that generates optimal collision-free control inputs. Simulation results demonstrate that our bi-level strategy achieves near-optimal coordination performance, comparable to state-of-the-art centralized strategies, and significantly outperform the traffic signal control systems in terms of traffic throughput. Moreover, our approach exhibits good scalability, with computational complexity scaling linearly with the number of vehicles. Video demonstrations can be found online at \url{https://youtu.be/WYAKFMNnQfs}

Implicit personalization in driving assistance: State-of-the-art and open issues

In recent decades, driving assistance systems have been evolving towards personalization for adapting to different drivers. With the consideration of driving preferences and driver characteristics, these systems become more acceptable and trustworthy. This article presents a survey on recent advances in implicit personalized driving assistance. We classify the collection of work into three main categories: 1) personalized Safe Driving Systems (SDS), 2) personalized Driver Monitoring Systems (DMS), and 3) personalized In-vehicle Information Systems (IVIS). For each category, we provide a comprehensive review of current applications and related techniques along with the discussion of industry status, benefits of personalization, application prospects, and future focal points. Both relevant driving datasets and open issues about personalized driving assistance are discussed to facilitate future research. By creating an organized categorization of the field, we hope that this survey could not only support future research and the development of new technologies for personalized driving assistance but also facilitate the application of these techniques within the driving automation community</h2

A comprehensive survey on cooperative intersection management for heterogeneous connected vehicles

Nowadays, with the advancement of technology, world is trending toward high mobility and dynamics. In this context, intersection management (IM) as one of the most crucial elements of the transportation sector demands high attention. Today, road entities including infrastructures, vulnerable road users (VRUs) such as motorcycles, moped, scooters, pedestrians, bicycles, and other types of vehicles such as trucks, buses, cars, emergency vehicles, and railway vehicles like trains or trams are able to communicate cooperatively using vehicle-to-everything (V2X) communications and provide traffic safety, efficiency, infotainment and ecological improvements. In this paper, we take into account different types of intersections in terms of signalized, semi-autonomous (hybrid) and autonomous intersections and conduct a comprehensive survey on various intersection management methods for heterogeneous connected vehicles (CVs). We consider heterogeneous classes of vehicles such as road and rail vehicles as well as VRUs including bicycles, scooters and motorcycles. All kinds of intersection goals, modeling, coordination architectures, scheduling policies are thoroughly discussed. Signalized and semi-autonomous intersections are assessed with respect to these parameters. We especially focus on autonomous intersection management (AIM) and categorize this section based on four major goals involving safety, efficiency, infotainment and environment. Each intersection goal provides an in-depth investigation on the corresponding literature from the aforementioned perspectives. Moreover, robustness and resiliency of IM are explored from diverse points of view encompassing sensors, information management and sharing, planning universal scheme, heterogeneous collaboration, vehicle classification, quality measurement, external factors, intersection types, localization faults, communication anomalies and channel optimization, synchronization, vehicle dynamics and model mismatch, model uncertainties, recovery, security and privacy