pith. sign in

arxiv: 1809.00262 · v1 · pith:T5YCPP23new · submitted 2018-09-01 · 🧮 math.OC

A Decentralized Optimal Control Framework for Connected Automated Vehicles at Urban Intersections with Dynamic Resequencing

classification 🧮 math.OC
keywords resequencingthroughputdynamicmaximizationprocessautomatedconnectedcontrol
0
0 comments X
read the original abstract

Earlier work has established a decentralized framework to optimally control Connected Automated Vehicles (CAVs) crossing an urban intersection without using explicit traffic signaling while following a strict First-In-First-Out (FIFO) queueing structure. The proposed solution minimizes energy consumption subject to a FIFO-based throughput maximization requirement. In this paper, we extend the solution to account for asymmetric intersections by relaxing the FIFO constraint and including a dynamic resequencing process so as to maximize traffic throughput. To investigate the tradeoff between throughput maximization and energy minimization objectives, we exploit several alternative problem formulations. In addition, the computational complexity of the resequencing process is analyzed and proved to be bounded, which makes the online implementation computationally feasible. The effectiveness of the dynamic resequencing process in terms of throughput maximization is illustrated through simulation

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.