Online Centralized MPC for Lane Merging in Vehicle Platoons

In the context of autonomous vehicles, proper lane merging is critical as it can reduce the traffic bottleneck and lead to safer road transportation. To obtain a collision-free and efficient lane merging, advanced control algorithms need to be designed to smoothly coordinate multiple vehicles to form a platoon. Model predictive control (MPC) is such a controller capable of forecasting future states of multiple vehicles by optimizing their control inputs while satisfying the constraints. Prior MPC-based studies mostly utilized offline planning with a precomputed lookup table of feasible maneuvers to model lane merging. Although these model designs reduce the online computational load, they lack flexibility, as they rely on predefined scenarios and cannot easily adapt to dynamic or unpredictable situations. In this study, we present a centralized MPC framework capable of online trajectory tracking under dynamic constraints and disturbances, for collision-free operation in tightly spaced multi-vehicle platoons. To evaluate the flexibility of our online algorithm, we examine the role of prediction horizon-the time window over which future states are forecasted-and platoon size in determining both the feasibility and efficiency of merging maneuvers. Our results reveal that there exists an optimal prediction horizon at which braking and acceleration can be minimized, thereby reducing energy consumption by 35-40%. Additionally, we observe that increasing the prediction horizon beyond the minimum required for feasibility can alter the vehicle sequence in the platoon. Capturing the changes in vehicle sequence (e.g., who leads or yields) when prediction horizon varies, is a consequence of online trajectory optimization. This vehicle sequence change cannot be captured by offline planning that relies on precomputed look-up table maneuvers. We also found that as the number of vehicles increases, the minimum feasible prediction horizon increases significantly.