This paper proposes a novel method for multi-lane convoy formation control that uses large language models (LLMs) to tackle coordination challenges in dynamic highway environments. Each connected and autonomous vehicle in the convoy uses a knowledge-driven approach to make real-time adaptive decisions based on various scenarios. Our method enables vehicles to dynamically perform tasks, including obstacle avoidance, convoy joining/leaving, and escort formation switching, all while maintaining the overall convoy structure. We design a Interlaced formation control strategy based on locally dynamic distributed graphs, ensuring the convoy remains stable and flexible. We conduct extensive experiments in the SUMO simulation platform across multiple traffic scenarios, and the results demonstrate that the proposed method is effective, robust, and adaptable to dynamic environments.
The overall framework of the multi-lane convoy formation control method. It contains a total of five modules: environment, reasoning, shared memory, trajectory planning, and control. The reasoning module obtains the perception results from the environment and generates the target lanes and target speeds of the vehicles, the trajectory planning module obtains the target values and generates the trajectories of each vehicle in the convoy, and finally the control module outputs the acceleration and steering angle commands, which are then applied to the environment.
A case of the Reasoning module process. This simple obstacle avoidance scenario illustrates how the reasoning module collects information from the ego vehicle, environment vehicles, and neighbors, then generates a scene description for decision-making by the large model. In the figure, veh7 changes lanes to the right due to a slow vehicle ahead, while veh3 outputs an IDLE decision to follow the neighboring vehicle in the same lane.
Interlaced Formation: Compared to a parallel formation, the interlaced formation offers better flexibility, providing more lane-change space for vehicles in adjacent lanes, significantly reducing the risk of merging conflicts.
Neighboring Nodes: The nearest vehicles in the forward and backward directions within the ego vehicle’s communication range on any lane are defined as neighboring nodes.
\[ \begin{bmatrix} \dot{x} \\ \dot{y} \end{bmatrix} = \left[ \begin{array}{ccc} \sum\limits_{n\in\mathcal{N}} w_n \cdot ((x_n - x_{ego}) - d_{desired}) \\ w_y \cdot (y_{target\_lane} - y_{ego}) \end{array} \right] + \left[ \begin{array}{ccc} v_{target\_x} \\ 0 \end{array} \right] \]