arrow
Return

A piecewise trajectory optimization model for connected automated vehicles: Exact optimization algorithm and queue propagation analysis

delete2018-12-01
delete93
delete
OA
AI
李小鹏 cover
李小鹏 (Xiaopeng Li) *
A
Amir Ghiasi
徐志刚 (Zhigang Xu)
X
Xiaobo Qu *
DOI:10.1016/j.trb.2018.11.002delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper formulates a simplified traffic smoothing model for guiding movements of connected automated vehicles on a general one-lane highway segment. Adapted from the shooting heuristic proposed by Zhou et al. (2017) and Ma et al. (2017), this model confines each vehicle's trajectory as a piecewise quadratic function with no more than five pieces and lets all trajectories in the same platoon share identical acceleration and deceleration rates. Similar to the shooting heuristic, the proposed simplified model is able to control the overall smoothness of a platoon of connected automated vehicles and approximately optimize traffic performance in terms of fuel efficiency and driving comfort. While the shooting heuristic relies on numerical meta-heuristic algorithms that cannot ensure solution optimality, we discover a set of elegant theoretical properties for the general objective function and the associated constraints in the proposed simplified model, and consequentially propose an efficient analytical algorithm for solving this problem to the exact optimum. Interestingly, this exact algorithm has intuitive physical interpretations, i.e., stretching the transitional parts of the trajectories (i.e., parts with acceleration and deceleration adjustments) as far as they reach the upstream end of the investigated segment, and then balancing the acceleration and deceleration magnitudes as close as possible. This analytical exact model can be considered as a core module to a range of general trajectory optimization problems at various infrastructure settings. Numerical examples reveal that this exact algorithm has much more efficient computational performance and the same or better solution quality compared with the previously proposed shooting heuristic. These examples also illustrate how to apply this model to CAV control problems on signalized segments and at non-stop intersections. Further, we study a homogeneous special case of this model and analytically formulate the relationship between queue propagation and trajectory smoothing. One counter-intuitive finding is that trajectory smoothing may not always cause longer queue propagation but instead may mitigate queue propagation with appropriate settings. This theoretical finding has valuable implications to joint optimization of queuing management and traffic smoothing in complex transportation networks. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Connected automated vehicles
Trajectory optimization
Traffic smoothing
Exact algorithm
Shooting heuristic
Fuel consumption
Driving comfort
Signalized intersection
Non-stop intersection
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Transportation Research Part B-Methodological cover
Transportation Research Part B-Methodological
IF:
6.3
Papers:
3.5K
Citations:
1.9W

Organization

State University System of Florida cover
State University System of Florida
Scholars:
12.7W
Papers: 10.9W
Citations: 130
U
university of south florida
Scholars:
1.5W
Papers: 1.2W
Citations: 9