摘要: Cooperative driving via vehicle communication attracts increasing interests recently, since the motions of vehicles can be conducted in safe and smooth manner. In this paper, cooperative at lane closures is studied. First, solution space all allowable schedules described by a spanning tree terms passing order. The corresponding trajectory planning method then proposed to generate acceptable changing profiles. algorithm fast reliable, but sometimes yields conservative solutions than previous algorithms.