An Approximate Dynamic Programming Approach to Vehicle Platooning Coordination in Networks

Understand

Platooning connected and autonomous vehicles (CAVs) provide significant benefits in terms of traffic efficiency and fuel economy.

• However, most existing platooning systems assume the availability of pre-determined plans, which is not feasible in real-time scenarios.
• In this paper, we address this issue in time-dependent networks by formulating a Markov decision process at each junction, aiming to minimize travel time and fuel consumption.
• Initially, we analyze coordinated platooning without routing to explore the cooperation among controllers on an identical path.