TY - JOUR
T1 - Intelligent Safe Driving Methods Based on Hybrid Automata and Ensemble CART Algorithms for Multihigh-Speed Trains
AU - CHENG, Ruijun
AU - YU, Wei
AU - SONG, Yongduan
AU - CHEN, Dewang
AU - MA, Xiaoping
AU - CHENG, Yu
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - Considering both the tracking safety of multi-HSTs and the operational efficiency of a single HST, intelligent safe driving methods (ISDMs) are proposed to obtain better speed-distance curves by integrating hybrid automata (HA) with data mining algorithms in this paper. To begin with, an intelligent safe distance controller is established by using HA to ensure the tracking safety of multi-HSTs' operation in real time. Then, data-driven intelligent driving methods based on ensemble algorithms (Bagging or Adaboost.R) and classification and regression tree (CART) are proposed to discover the potential driving rules from the field driving data. Furthermore, because of the continuous rise of HST's operation mileage, the driving data collected from HST has increased tremendously compared with the subways. So, an iterative pruning error minimization algorithm is designed to reduce the redundancy of the driving data and improve the computational speed of the learning process. Finally, compared with the automatic train operation (ATO) method, the energy consumption of B-CART, A-CART, and S-A-CART algorithms can be decreased by 3.32%, 3.80%, and 4.30%, respectively.
AB - Considering both the tracking safety of multi-HSTs and the operational efficiency of a single HST, intelligent safe driving methods (ISDMs) are proposed to obtain better speed-distance curves by integrating hybrid automata (HA) with data mining algorithms in this paper. To begin with, an intelligent safe distance controller is established by using HA to ensure the tracking safety of multi-HSTs' operation in real time. Then, data-driven intelligent driving methods based on ensemble algorithms (Bagging or Adaboost.R) and classification and regression tree (CART) are proposed to discover the potential driving rules from the field driving data. Furthermore, because of the continuous rise of HST's operation mileage, the driving data collected from HST has increased tremendously compared with the subways. So, an iterative pruning error minimization algorithm is designed to reduce the redundancy of the driving data and improve the computational speed of the learning process. Finally, compared with the automatic train operation (ATO) method, the energy consumption of B-CART, A-CART, and S-A-CART algorithms can be decreased by 3.32%, 3.80%, and 4.30%, respectively.
KW - Automatic train operation (ATO)
KW - high-speed train
KW - intelligent train control
KW - machine learning algorithm
KW - sparse algorithm
KW - system safety
UR - https://www.scopus.com/pages/publications/85068218212
U2 - 10.1109/TCYB.2019.2915191
DO - 10.1109/TCYB.2019.2915191
M3 - Journal Article (refereed)
AN - SCOPUS:85068218212
SN - 2168-2267
VL - 49
SP - 3816
EP - 3826
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 10
M1 - 8721696
ER -