Search

Nowadays, the autonomous driving transportation systems are at the heart of both academic and industry research for the distinguished advantages including increased network capacity, enhanced punctuality, greater flexibility and improved overall safety level. With the responsibility of transporting passengers in a safe, comfortable and efficient way, the decision making method plays a critical position in the autonomous driving of high-speed trains. Focusing on solving the autonomous decision making problem, this paper proposes a novel learning based framework by combining the deep learning technology with the distributed tracking control approach. To cope with the data insufficiency problem in training the deep learning network, a generative adversarial network (GAN) based data argumentation scheme is proposed to generate data samples that have the same distribution with actual data samples, and a hybrid learning network is constructed to predict the speed trajectory from the multi-attribute data with both temporal sequences and static features. Then, based on the model predictive control (MPC) scheme, a distributed tracking control model is formulated to minimize the tracking deviations and balance the performance of punctuality, energy-efficiency and riding comfort. Further, the dual decomposition technique is adopted to deal with the coupling constraints for the safe distance headway such that the separation for the autonomous driving of high-speed trains is achieved. Finally, simulation experiments based on actual scenarios of the Beijing-Shanghai high-speed railway are conducted to illustrate the effectiveness of our methods. [ABSTRACT FROM AUTHOR]

Virtual Coupling (VC) is regarded as a breakthrough to the traditional train operation and control for improving the capability and flexibility in railways. It brings benefits as trains under VC are allowed to operate much closer to one another, forming a virtually coupled train set (VCTS). However, the safe and stable spacing between trains in the VCTS is a problem since there are no rigid couplers to connect them into a fixed formation, especially in high-speed scenarios. Due to the close spacing, the interference between trains becomes non-negligible as various maneuvers of the preceding train can significantly affect driving behaviors of the following train; this results in fluctuating spacing and therefore an unstable VCTS. Aiming at minimizing the interference and maintaining constantly safe spacing between trains in the VCTS, this paper presents a distributed model predictive control (DMPC) approach for solving the high-speed VCTS control problem. Particularly, the proposed control method focuses on the feasibility and stability of this problem, with considerations of the coupled constraint of safety braking distance and the individual constraints of speed limit variations and restricted traction/braking performance. To guarantee feasibility and stability, the terminal controller and invariant set of the DMPC are designed. For rigor, sufficient conditions of feasibility and stability are mathematically proved and derived. Based on the data of the Beijing-Shanghai high-speed railway line, numerical experiments are conducted to verify the correctness of derived sufficient conditions and the effectiveness of the proposed control method under interference and disturbances. [ABSTRACT FROM AUTHOR]

Operation optimization for modern subway trains usually requires the speed curve optimization and speed curve tracking simultaneously. For the speed curve optimization, a multi-objective seeking issue should be addressed by considering the requirements of energy saving, punctuality, accurate parking, and comfortableness at the same time. But most traditional searching methods lack in efficiency or tend to fall into the local optimum. For the speed curve tracking, the widely applied proportional integral differential (PID) and fuzzy controllers rely on complicated parameter tuning, whereas robust adaptive methods can hardly ensure the finite-time convergence strictly, and thus are not suitable for applications in fixed time intervals of trains. To address the above-mentioned two problems, this paper presents a novel approach for speed curve seeking and tracking control. First, we present the random reinforcement genetic algorithm (GA) algorithm to avoid the local optimum efficiently. Then, a sliding mode controller is developed for speed curve tracking with bounded disturbance. The Lyapunov theory is adopted to prove that the system can be stabilized in the finite time. Finally, using the real datasets of Yizhuang Line in Beijing Subway, the proposed approach is validated, demonstrating its effectiveness and superiorities for the operation optimization. [ABSTRACT FROM AUTHOR]

Short-term traffic prediction (STTP) is one of the most critical capabilities in Intelligent Transportation Systems (ITS), which can be used to support driving decisions, alleviate traffic congestion and improve transportation efficiency. However, STTP of large-scale road networks remains challenging due to the difficulties of effectively modeling the diverse traffic patterns by high-dimensional time series. Therefore, this paper proposes a framework that involves a deep clustering method for STTP in large-scale road networks. The deep clustering method is employed to supervise the representation learning in a visualized way from the large unlabeled dataset. More specifically, to fully exploit the traffic periodicity, the raw series is first divided into a number of sub-series for triplet generation. The convolutional neural networks (CNNs) with triplet loss are utilized to extract the features of shape by transforming the series into visual images. The shape-based representations are then used to cluster road segments into groups. Thereafter, a model sharing strategy is further proposed to build recurrent NNs-based predictions through group-based models (GBMs). GBM is built for a type of traffic patterns, instead of one road segment exclusively or all road segments uniformly. Our framework can not only significantly reduce the number of prediction models, but also improve their generalization by virtue of being trained on more diverse examples. Furthermore, the proposed framework over a selected road network in Beijing is evaluated. Experiment results show that the deep clustering method can effectively cluster the road segments and GBM can achieve comparable prediction accuracy against the IBM with less number of prediction models. [ABSTRACT FROM AUTHOR]

Reducing traffic delay is of crucial importance for the development of sustainable transportation systems, which is a challenging task in the studies of stochastic shortest path (SSP) problem. Existing methods based on the probability tail model to solve the SSP problem, seek for the path that minimizes the probability of delay occurrence, which is equal to maximizing the probability of reaching the destination before a deadline (i.e., arriving on time). However, they suffer from low accuracy or high computational cost. Therefore, we design a novel and practical Q-learning approach where the converged Q-values have the practical meaning as the actual probabilities of arriving on time so as to improve the accuracy of finding the real optimal path. By further adopting dynamic neural networks to learn the value function, our approach can scale well to large road networks with arbitrary deadlines. Moreover, our approach is flexible to implement in a time dependent manner, which further improves the performance of returned path. Experimental results on some road networks with real mobility data, such as Beijing, Munich and Singapore, demonstrate the significant advantages of the proposed approach over other methods. [ABSTRACT FROM AUTHOR]