TY - JOUR
T1 - Monte Carlo Tree Search-Based Mixed Traffic Flow Control Algorithm for Arterial Intersections
AU - Cheng, Yanqiu
AU - Hu, Xianbiao
AU - Tang, Qing
AU - Qi, Hongsheng
AU - Yang, Hong
N1 - Publisher Copyright:
© National Academy of Sciences: Transportation Research Board 2020.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - A model-free approach is presented, based on the Monte Carlo tree search (MCTS) algorithm, for the control of mixed traffic flow of human-driven vehicles (HDV) and connected and autonomous vehicles (CAV), named MCTS-MTF, on a one-lane roadway with signalized intersection control. Previous research has often simplified the problem with certain assumptions to reduce computational burden, such as dividing a vehicle trajectory into several segments with constant speed or linear acceleration/deceleration, which was rather unrealistic. This study departs from the existing research in that minimum constraints on CAV trajectory control were required, as long as the basic rules such as safety considerations and vehicular performance limits were followed. Modeling efforts were made to improve the algorithm solution quality and the run time efficiency over the naïve MCTS algorithm. This was achieved by an exploration-exploitation balance calibration module, and a tree expansion determination module to expand the tree more effectively along the desired direction. Results of a case study found that the proposed algorithm was able to achieve a travel time saving of 3.5% and a fuel consumption saving of 6.5%. It was also demonstrated to run at eight times the speed of a naïve MCTS model, suggesting a promising potential for real-time or near real-time applications.
AB - A model-free approach is presented, based on the Monte Carlo tree search (MCTS) algorithm, for the control of mixed traffic flow of human-driven vehicles (HDV) and connected and autonomous vehicles (CAV), named MCTS-MTF, on a one-lane roadway with signalized intersection control. Previous research has often simplified the problem with certain assumptions to reduce computational burden, such as dividing a vehicle trajectory into several segments with constant speed or linear acceleration/deceleration, which was rather unrealistic. This study departs from the existing research in that minimum constraints on CAV trajectory control were required, as long as the basic rules such as safety considerations and vehicular performance limits were followed. Modeling efforts were made to improve the algorithm solution quality and the run time efficiency over the naïve MCTS algorithm. This was achieved by an exploration-exploitation balance calibration module, and a tree expansion determination module to expand the tree more effectively along the desired direction. Results of a case study found that the proposed algorithm was able to achieve a travel time saving of 3.5% and a fuel consumption saving of 6.5%. It was also demonstrated to run at eight times the speed of a naïve MCTS model, suggesting a promising potential for real-time or near real-time applications.
UR - http://www.scopus.com/inward/record.url?scp=85094894993&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85094894993&partnerID=8YFLogxK
U2 - 10.1177/0361198120919746
DO - 10.1177/0361198120919746
M3 - Article
AN - SCOPUS:85094894993
SN - 0361-1981
VL - 2674
SP - 167
EP - 178
JO - Transportation Research Record
JF - Transportation Research Record
IS - 8
ER -