Optimal strategies for the control of a train
type: Item
instance of: scholarly article
title: Optimal strategies for the control of a train
zbMATH Open document ID: 0848.93041
DOI: 10.1016/0005-1098(95)00184-0
published in: Automatica
publication date: 1996-10-28T00:00:00Z
review text: A train modelled by a point mass is subject to a friction force, the effect of gravitation which depends on the track inclination which is constant on each subinterval \(I_k\) of a subdivision of the total interval corresponding to the travel, and controls which take discrete values (traction, coast and breaking). The dynamics are written such that speed and time are the states which depend on the distance along the track. It is assumed that the speed increases (resp. decreases) in a traction (resp. coast or breaking) mode, that traction and coast modes alternate followed by a final coast-breaking phase and that two successive switching points do not occur in \(I_k\). The train has to travel a certain distance in a certain time (the constraints) while minimizing fuel consumption which is proportional to the traction force; the cost is expressed as a function of the switching points. Quantities and relations which arise as necessary conditions for optimality under constraints are introduced. This allows to construct iteratively a switching point from the next one on the track. There are no proofs but the derivation of the necessary conditions should be available in a technical report of the author (1993) referenced in the article. This approach and related works of the author have resulted in up to twenty percent savings in fuel consumption of metropolitan trains in Australia. Let us remark that the Appendix A5 states that a measurable optimal control can be approximated by a switching type control provided there are enough switchings but this contradicts the hypothesis (which by the way is not clearly stated) that at most one switching occurs in \(I_k\). Thus, the switching strategies of the article are suboptimal with respect to an optimization problem involving a larger set of admissible controls.
Mathematics Subject Classification ID: 93C95
Mathematics Subject Classification ID: 49N70
Mathematics Subject Classification ID: 49N75
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 885861
zbMATH Keywords: Lagrange multiplier
zbMATH Keywords: train
zbMATH Keywords: switching points
zbMATH Keywords: optimality
zbMATH Keywords: optimal control
author: Phil Howlett
reviewed by: A. Akutowicz
MaRDI profile type: Publication
full work available at URL: 0005-1098(95)00184-0
OpenAlex ID: W2057211133
cites work: Q3717705
cites work: An optimal strategy for the control of a train
cites work: Q4867045
Recommended article: An optimal strategy for the control of a train
Recommended article: The optimal control of a train
Recommended article: On an optimal control problem of train operation
Recommended article: Q4867045
Recommended article: Optimal train control via switched system dynamic optimization
Recommended article: Optimal driving strategies for a train on a track with continuously varying gradient
Recommended article: Q4237966
Recommended article: Q4495748
Recommended article: Adaptive numerical approach for optimal control of a single train
Recommended article: Optimal driving strategies for a train journey with speed limits
description: scientific article; zbMATH DE number 885861