Eco-Driving of Metro Trains Considering Variable Efficiency of Propulsion System

The main goal of energy-efficient train control (EETC) is to devise strategies and methods in order to consume the least amount of energy while respecting the system and the operational constraints. Typically, such problems are tackled by breaking the trajectory into various singular and regular phases. The main focus of this article is to provide a numerically efficient algorithm to solve this problem in a unified way instead of dealing with phases. In this research work, a convex nonlinear model for propulsion power is proposed. Using this model, the EETC problem is formulated as an optimal control problem (OCP) using Pontryagin’s maximum principle (PMP). Maximum effort limitation of the propulsion system, and acceleration and deceleration limits are considered as control constraints. Track speed limits are considered as state constraints. The optimality conditions allow formulating a boundary value problem (BVP). An initialization procedure is proposed, which enables to design continuation procedures (CPs) to solve the BVP. The results are compared with the dynamic programming (DP) solution. A tradeoff analysis between journey time and energy consumption is presented.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Control Systems Technology
Published
2025-03-24
DOI
https://doi.org/10.1109/tcst.2025.3549274
Citations
1
Primary Topic
Vehicle emissions and performance
Type
article
Field-Weighted Citation Impact
0.68
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Eco-Driving of Metro Trains Considering Variable Efficiency of Propulsion System

Arun Kumar Kantheti, Denis Berdjag, S. Delprat, Aamir Kamran
1 citations
IEEE Transactions on Control Systems Technology
Vehicle emissions and performance
0.68
article

Eco-Driving of Metro Trains Considering Variable Efficiency of Propulsion System

Arun Kumar Kantheti, Denis Berdjag, S. Delprat, Aamir Kamran
article en
1 citations

Abstract

The main goal of energy-efficient train control (EETC) is to devise strategies and methods in order to consume the least amount of energy while respecting the system and the operational constraints. Typically, such problems are tackled by breaking the trajectory into various singular and regular phases. The main focus of this article is to provide a numerically efficient algorithm to solve this problem in a unified way instead of dealing with phases. In this research work, a convex nonlinear model for propulsion power is proposed. Using this model, the EETC problem is formulated as an optimal control problem (OCP) using Pontryagin’s maximum principle (PMP). Maximum effort limitation of the propulsion system, and acceleration and deceleration limits are considered as control constraints. Track speed limits are considered as state constraints. The optimality conditions allow formulating a boundary value problem (BVP). An initialization procedure is proposed, which enables to design continuation procedures (CPs) to solve the BVP. The results are compared with the dynamic programming (DP) solution. A tradeoff analysis between journey time and energy consumption is presented.

IEEE Transactions on Control Systems TechnologyVol. 33(5)
Centre National de la Recherche Scientifique (FR), Alstom (France) (FR), Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et Humaines (FR), Université Polytechnique Hauts-de-France (FR)
Affordable and clean energy
Openalex Percentile: Top 33%
Vehicle emissions and performance
0.68
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.