Markov Decision Process-based Run Curve Optimization for Energy Saving and Ride Comfort

Kimura, Sae; Yoshimoto, Kyosuke; Uéda, Kenji; Takahashi, Satoru; Nikovski, Daniel

doi:10.1541/ieejeiss.134.1577

Cited by 2 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that, the algorithm finds the simplex in the Delaunay triangulation that contains the point y (lines [11][12][13][14][15][16][17][18][19][20][21][22]. To this end, it traverses all M simplices in the Delaunay triangulation and repeats the following steps for every simplex m, m ∈ [1, .…”

Section: Barycentric Value Function Approximationmentioning

confidence: 99%

“…Experimental results suggest that discretization steps of 20 m in distance and 2 km/h in velocity are sufficient for computation of accurate optimal run curves. Computational times shorter than 4 s for railroad track segments of length 2 km were achieved, allowing re-computation of optimal run curves to happen at each train station, while the train stops there and takes on new passengers [21].…”

Section: Run-curve Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Barycentric quantization for planning in continuous domains

Nikovski

2015

AIC

View full text Add to dashboard Cite

We consider the class of planning and sequential decision making problems where the state space has continuous components, but the available actions come from a discrete set, and argue that a suitable approach for solving them could involve an appropriate quantization scheme for the continuous state variables, followed by approximate dynamic programming. We propose one such scheme based on barycentric approximations that effectively converts the continuous dynamics into a Markov decision process, and demonstrate that it can be viewed both as an approximation to the continuous dynamics, as well as a value function approximator over the continuous domain. We describe the application of this method to several hard industrial problems, and point out additional candidate problems that could be amenable to it. AI Communications This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved.

show abstract