Synchronous and asynchronous parallel computation for large-scale optimal control of connected vehicles

•A parallel computation algorithm for large-scale optimal control of CAVs is proposed.•The coupling constraints is decomposed with consensus optimization and ADMM.•The algorithm’s time complexity is independent to vehicle numbers.•An asynchronous version ADMM is proposed based on our parallel algori...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part C, Emerging technologies Vol. 121; p. 102842
Main Authors: Li, Shengbo Eben, Wang, Zhitao, Zheng, Yang, Sun, Qi, Gao, Jiaxin, Ma, Fei, Li, Keqiang
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2020
Subjects:
ADMM
Connected vehicles
Intelligent transportation system
Optimal control
99-00
Connected vehicles
Intelligent transportation system
00-01
ADMM
Optimal control
ISSN:0968-090X, 1879-2359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•A parallel computation algorithm for large-scale optimal control of CAVs is proposed.•The coupling constraints is decomposed with consensus optimization and ADMM.•The algorithm’s time complexity is independent to vehicle numbers.•An asynchronous version ADMM is proposed based on our parallel algorithm.•The convergence of the asynchronous ADMM is proved in theory. Connected vehicles is an important intelligent transportation system to improve the traffic performance. This paper proposes two parallel computation algorithms to solve a large-scale optimal control problem in the coordination of multiple connected vehicles. The coordination is formulated as a centralized optimization problem in the receding horizon fashion. A decentralized computation network is designed to facilitate the development of parallel algorithms. We use Taylor series to linearize non-convex constraints, and introduce a set of consensus constraints to transform the centralized problem to a standard consensus optimization problem. A synchronous parallel algorithm is firstly proposed to solve the consensus optimization problem by applying the alternating direction method of multipliers (ADMM). The ADMM framework allows us to decompose the coupling constraints and decision variables, leading to parallel iterations for each vehicle in a synchronous fashion. We then propose an asynchronous version of the parallel algorithm that allows the vehicles to update their variables asynchronously in the computation network. The effectiveness and efficiency of the proposed algorithms are validated by extensive numerical simulations.
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2020.102842