A Model Predictive Control Approach With Limited-Time Termination for Virtually Coupled Train Set

To improve the flexibility and efficiency of railway services, virtual coupling has been investigated widely. It forms multiple train units as a virtually coupled train set (VCTS), deploying advanced communication and control technologies instead of physical couplers. To operate VCTS as desired, all units should drive synchronously, while satisfying a safety constraint to regulate the following distance. Thus, model pre-dictive control approaches are a promising solution to achieve VCTS operation. However, the computation efficiency of MPC is a critical problem to be addressed, considering the limited capabilities of realistic on-board train computers. To solve this problem, this paper proposes a fast-safe MPC approach that can terminate in a limited time while generating a quasi-optimal and feasible controller. By adding barrier functions that are specifically transferred from constraints in VCTS operation, we formulate an augmented cost function for MPC. Then, a fast-safe solver is designed to analytically solve the optimal control problem in MPC, using the gradient of augmented cost function and adaptive updating steps. Experimental results demonstrate that our approach can yield controllers for VCTS in a limited time, while operating VCTS stably and guaranteeing constraint satisfaction.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10864732
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Model Predictive Control Approach With Limited-Time Termination for Virtually Coupled Train Set

Liqun Fan, Xiaolin Luo, Qiusheng Liu, Qilong Jia et al.
Railway Systems and Energy Efficiency
article

A Model Predictive Control Approach With Limited-Time Termination for Virtually Coupled Train Set

Liqun Fan, Xiaolin Luo, Qiusheng Liu, Qilong Jia, Kun Zhang, Kaixuan Li, Xinping Pu, Hongjie Liu
article en

Abstract

To improve the flexibility and efficiency of railway services, virtual coupling has been investigated widely. It forms multiple train units as a virtually coupled train set (VCTS), deploying advanced communication and control technologies instead of physical couplers. To operate VCTS as desired, all units should drive synchronously, while satisfying a safety constraint to regulate the following distance. Thus, model pre-dictive control approaches are a promising solution to achieve VCTS operation. However, the computation efficiency of MPC is a critical problem to be addressed, considering the limited capabilities of realistic on-board train computers. To solve this problem, this paper proposes a fast-safe MPC approach that can terminate in a limited time while generating a quasi-optimal and feasible controller. By adding barrier functions that are specifically transferred from constraints in VCTS operation, we formulate an augmented cost function for MPC. Then, a fast-safe solver is designed to analytically solve the optimal control problem in MPC, using the gradient of augmented cost function and adaptive updating steps. Experimental results demonstrate that our approach can yield controllers for VCTS in a limited time, while operating VCTS stably and guaranteeing constraint satisfaction.

Beijing Jiaotong University (CN), Shenzhen Metro (China) (CN), Shenzhen Municipal People's Government (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 60%
Railway Systems and Energy Efficiency
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.