TY - GEN
T1 - To Cooperate or Not
T2 - 20th IEEE International Conference on Automation Science and Engineering, CASE 2024
AU - Wang, Dan
AU - Xu, Gangyan
AU - Wu, Zhizhou
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - On-ramp merging for Autonomous Vehicles (AVs) is a challenging task that involves complex interactions of multiple vehicles and should consider both the safety and efficiency. Extensive works have been conducted on merging decisions using various control and learning-based methods. Although these methods are proved effective in different scenarios, debate still exist whether AVs should cooperate or not during the processes, or whether such cooperation should be considered in the method design. To answer these questions, this paper formulates the problem of on-ramp merging for AVs as a Partially Observable Markov Decision Process (POMDP), and develops several cooperative and non-cooperative Multi-Agent Reinforcement Learning (MARL) algorithms based on state-of-the-art models, i.e., Independent DQN, Bi-level Actor-Critic, and MADDPG. Experimental case studies are conducted to compare the performance of these algorithms, in terms of training efficiency, merge rate, average speed, and safety metrics (such as collision rates and acceleration). Surprisingly, results reveal that it is not always good to cooperate in merging process and the non-cooperation method performs better in many cases. The findings also emphasize the importance of strategy selection based on specific traffic scenarios and objectives. Besides, by understanding the interplay between cooperation and independent optimization, our work provides insights for safer and more efficient traffic management.
AB - On-ramp merging for Autonomous Vehicles (AVs) is a challenging task that involves complex interactions of multiple vehicles and should consider both the safety and efficiency. Extensive works have been conducted on merging decisions using various control and learning-based methods. Although these methods are proved effective in different scenarios, debate still exist whether AVs should cooperate or not during the processes, or whether such cooperation should be considered in the method design. To answer these questions, this paper formulates the problem of on-ramp merging for AVs as a Partially Observable Markov Decision Process (POMDP), and develops several cooperative and non-cooperative Multi-Agent Reinforcement Learning (MARL) algorithms based on state-of-the-art models, i.e., Independent DQN, Bi-level Actor-Critic, and MADDPG. Experimental case studies are conducted to compare the performance of these algorithms, in terms of training efficiency, merge rate, average speed, and safety metrics (such as collision rates and acceleration). Surprisingly, results reveal that it is not always good to cooperate in merging process and the non-cooperation method performs better in many cases. The findings also emphasize the importance of strategy selection based on specific traffic scenarios and objectives. Besides, by understanding the interplay between cooperation and independent optimization, our work provides insights for safer and more efficient traffic management.
UR - https://www.scopus.com/pages/publications/85208216507
U2 - 10.1109/CASE59546.2024.10711529
DO - 10.1109/CASE59546.2024.10711529
M3 - Conference article published in proceeding or book
AN - SCOPUS:85208216507
T3 - IEEE International Conference on Automation Science and Engineering
SP - 2415
EP - 2420
BT - 2024 IEEE 20th International Conference on Automation Science and Engineering, CASE 2024
PB - IEEE Computer Society
Y2 - 28 August 2024 through 1 September 2024
ER -