Pseudospectral optimal train control

Abstract

In the last decade, pseudospectral methods have become popular for solving optimal control problems. Pseudospectral methods do not need prior knowledge about the optimal control structure and are thus very flexible for problems with complex path constraints, which are common in optimal train control, or train trajectory optimization. Practical optimal train control problems are nonsmooth with discontinuities in the dynamic equations and path constraints corresponding to gradients and speed limits varying along the track. Moreover, optimal train control problems typically include singular solutions with a vanishing Hessian of the associated Hamiltonian. These characteristics make these problems hard to solve and also lead to convergence issues in pseudospectral methods. We propose a computational framework that connects pseudospectral methods with Pontryagin's Maximum Principle allowing flexible computations, verification and validation of the numerical approximations, and improvements of the continuous solution accuracy. We apply the framework to two basic problems in optimal train control: minimum-time train control and energy-efficient train control, and consider cases with short-distance regional trains and long-distance intercity trains for various scenarios including varying gradients, speed limits, and scheduled running time supplements. The framework confirms the flexibility of the pseudospectral method with regards to state, control and mixed algebraic inequality path constraints, and is able to identify conditions that lead to inconsistencies between the necessary optimality conditions and the numerical approximations of the states, costates, and controls. A new approach is proposed to correct the discrete approximations by incorporating implicit equations from the optimality conditions. In particular, the issue of oscillations in the singular solution for energy-efficient driving as computed by the pseudospectral method has been solved.