Abstract

Train station parking (TSP) accuracy is important to enhance the efficiency of train operation and the safety of passengers for urban rail transit. However, TSP is always subject to a series of uncertain factors such as extreme weather and uncertain conditions of rail track resistances. To increase the parking accuracy, robustness, and self-learning ability, we propose new train station parking frameworks by using the reinforcement learning (RL) theory combined with the information of balises. Three algorithms were developed, involving a stochastic optimal selection algorithm (SOSA), a Q-learning algorithm (QLA), and a fuzzy function based Q-learning algorithm (FQLA) in order to reduce the parking error in urban rail transit. Meanwhile, five braking rates are adopted as the action vector of the three algorithms and some statistical indices are developed to evaluate parking errors. Simulation results based on real-world data show that the parking errors of the three algorithms are all within the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mo>±</mml:mo></mml:mrow></mml:math>30cm, which meet the requirement of urban rail transit.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

http://downloads.hindawi.com/journals/jat/2019/3072495.xml,
http://dx.doi.org/10.1155/2019/3072495 under the license http://creativecommons.org/licenses/by/4.0
https://doaj.org/toc/0197-6729,
https://doaj.org/toc/2042-3195 under the license http://creativecommons.org/licenses/by/4.0/
http://downloads.hindawi.com/journals/jat/2019/3072495.pdf,
https://academic.microsoft.com/#/detail/2964947015
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1155/2019/3072495
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?