Distributed chance-constrained model predictive control for condition-based maintenance planning for railway infrastructures

Book Chapter (2019)
Author(s)

Zhou Su (TU Delft - Team Bart De Schutter)

Ali Jamshidi (TU Delft - Railway Engineering)

Alfredo Nunez (TU Delft - Railway Engineering)

S Baldi (TU Delft - Team Bart De Schutter)

B De Schutter (TU Delft - Delft Center for Systems and Control, TU Delft - Team Bart De Schutter)

Research Group
Team Bart De Schutter
Copyright
© 2019 Z. Su, A. Jamshidi, Alfredo Nunez, S. Baldi, B.H.K. De Schutter
DOI related publication
https://doi.org/10.1007/978-3-030-05645-2_18
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 Z. Su, A. Jamshidi, Alfredo Nunez, S. Baldi, B.H.K. De Schutter
Research Group
Team Bart De Schutter
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Pages (from-to)
533-554
ISBN (print)
978-3-030-05644-5
ISBN (electronic)
978-3-030-05645-2
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We develop a Model Predictive Control (MPC) approach for condition-based maintenance planning under uncertainty for railway infrastructure systems composed of multiple components. Piecewise-affine models with uncertain parameters are used to capture both the nonlinearity and uncertainties in the deterioration process. To keep a balance between robustness and optimality, we formulate the MPC optimization problem as a chance-constrained problem, which ensures that the constraints, e.g., bounds on the degradation level, are satisfied with a given probabilistic guarantee. Two distributed algorithms, one based on Dantzig-Wolfe decomposition and the other derived from a constraint-tightening technique, are proposed to improve the scalability of the MPC approach. Computational experiments show that the distributed method based on Dantzig-Wolfe decomposition performs the best in terms of computational time and convergence to global optimality. By comparing the chance-constrained MPC approaches with deterministic approach, and traditional time-based maintenance approach, we show that despite their high computational requirements, chance-constrained MPC approaches are cost-efficient and robust in the presence of uncertainties.

Files

Su2019_Chapter_DistributedChan... (pdf)
(pdf | 0.738 Mb)
- Embargo expired in 01-09-2019
License info not available