Abstract
This paper addresses the problem of long term joint lateral and longitudinal decision-making for multi-vehicle cooperative driving among connected and automated vehicles (CAVs). We propose a Monte Carlo tree search (MCTS) method featuring parallel update mechanism and experiential action preference, with the problem modeled as a finite-horizon, time-discounted multi-agent Markov game. By enabling a single simulation rollout to prune entire families of hazardous actions simultaneously, parallel update mechanism dramatically accelerates the convergence of the search within the vast joint action space. The search is further focused by an experiential action preference heuristic that biases exploration towards efficient maneuvers. Evaluated in randomly generated mixed-traffic scenarios, our method significantly outperforms standard MCTS and reinforcement learning baselines in both safety and traffic efficiency. Crucially, in-depth analysis reveals the discovery of emergent, non-myopic cooperative strategies that are inaccessible to myopic planners. This work provides a computationally tractable solution for complex, multi-agent MCTS, achieving a higher level of strategic cooperative decision-making.

This publication has 45 references indexed in Scilit: