Application of Deep Q Learning with Simulation Results for Elevator Optimization
Not on the map. Why?
Abstract (arXiv)
This paper presents a methodology for combining programming and mathematics to optimize elevator wait times. Based on simulated user data generated according to the canonical three-peak model of elevator traffic, we first develop a naive model from an intuitive understanding of the logic behind elevators. We take into consideration a general array of features including capacity, acceleration, and maximum wait time thresholds to adequately model realistic circumstances. Using the same evaluation framework, we proceed to develop a Deep Q Learning model in an attempt to match the hard-coded naive approach for elevator control. Throughout the majority of the paper, we work under a Markov Decision Process (MDP) schema, but later explore how the assumption fails to characterize the highly stochastic overall Elevator Group Control System (EGCS).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 8 references that are in the map. First posted on arXiv 30 Sep 2022.
Builds on
4 of 8 references.
References · 4
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2021An Elementary Proof that Q-learning Converges Almost Surelycited by 2
- 2022Application of Convolutional Neural Networks with Quasi-Reversibility Method Results for Option Forecastingcited by 2
- 2022Elevator Optimization: Application of Spatial Process and Gibbs Random Field Approaches for Dumbwaiter Modeling and Multi-Dumbwaiter Systemscited by 1
Built on by
Not cited yet.