Abstract
In the last century, AI has been the topic of interest in many areas, where the focus was on mimicking human behaviour. It has been researched to be incorporated into different domains, such as security, diagnosis, autonomous driving, financial prediction analysis and playing games such as chess and Go. They also worked on different subfields of AI such as machine learning, deep learning, pattern recognition and other relevant subfields. Our work in a previous paper [1] focused on a problem that has not been tackled using AI before, which is the elevator-problem. In which we try to find the optimal parking floor for the elevator for the single elevator problem. In this paper, our work extends the model by solving the more complicated scenario, which is the multi elevator problem (MEP) using Learning Automata (LA). This problem can then be generalized to be applied to a variety of problems that share the same characteristics with the elevator problem. We refer to these problems as Elevator-Like Problems (ELPs). For the extended version (MEP) we try to find the optimal parking floors for the set of elevators so as to minimize the passengers’ Average Waiting Time (AWT). Apart from proposing benchmark solutions, we have provided two different novel LA-based solutions for the multi-elevator scenario. The first solution is based on the well-known LRI scheme, and the second solution incorporates the Pursuit concept to improve the performance and the convergence speed of the first solution, leading to the P \( L_{RI} \) scheme. The simulation results presented demonstrate that our solutions performed better than those used in modern-day elevators, and provided results that are near-optimal, yielding a performance increase of up to 91%.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We will not go through irrelevant details and/or the proofs of the LA-related claims.
- 2.
We will only present what each part of LA does. Full definitions are mentioned in [14].
- 3.
This is done to prevent any of the elevators from being “stuck” at one position without being called during the whole simulation.
References
Ghaleb, O., John Oommen, B.: Learning automata-based solutions to the single elevator problem. In: MacIntyre, J., Maglogiannis, I., Iliadis, L., Pimenidis, E. (eds.) AIAI 2019. IAICT, vol. 559, pp. 439–450. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19823-7_37
Barto, A., Crites, R.H.: Improving elevator performance using reinforcement learning. In: Proceedings of the 8th International Conference on Neural Information Processing Systems, pp. 1017–1023 (1995)
Nikovski, D., Brand, M.: Decision-theoretic group elevator scheduling. In: 13th International Conference on Automated Planning and Scheduling, pp. 133–142 (2003)
Zerz, E., et al.: Exact calculation of expected waiting times for group elevator control. IEEE Trans. Automatic Control 49(10), 2002–2005 (2004)
Brand, M., Nikovski, D.: Optimal parking in group elevator control. In: IEEE International Conference on Robotics and Automation, Proceedings. ICRA 2004, vol. 1, pp. 1002–1008 (2004)
Tsetlin, M.: On behaviour of finite automata in random medium. Avtomat. i Telemekh 22(10), 1345–1354 (1961)
Varshavskii, V., Vorontsova, I.P.: On the behavior of stochastic automata with a variable structure. Avtomatika i Telemekhanika 24(3), 353–360 (1963)
Meybodi, M.R., Beigy, H.: New learning automata-based algorithms for adaptation of backpropagation algorithm parameters. Int. J. Neural Syst. 12(01), 45–67 (2002)
Misra, S., Oommen, B.J.: GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks. Int. J. Commun Syst 17(10), 963–984 (2004)
Obaidat, M.S., Papadimitriou, G.I., Pomportsis, A.S., Laskaridis, H.S.: Learning automata-based bus arbitration for shared-medium ATM switches. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 32(6), 815–820 (2002)
Oommen, B.J., Roberts, T.D.: Continuous learning automata solutions to the capacity assignment problem. IEEE Trans. Comput. 49(6), 608–620 (2000)
Seredyński, F.: Distributed scheduling using simple learning machines. Eur. J. Oper. Res. 107(2), 401–413 (1998)
Kabudian, J., Meybodi, M.R., Homayounpour, M.M.: Applying continuous action reinforcement learning automata (carla) to global training of hidden Markov models. In: Proceedings of International Conference on Information Technology: Coding and Computing, ITCC 2004, vol. 2, pp. 638–642. IEEE (2004)
Ghaleb, O., Ooommen, B.: Novel Solutions and Applications to Elevator-like Problems By (2018)
Thathachar, M.A.L., Sastry, P.S.: Estimator algorithms for learning automata. In: Platinum Jubilee Conference on Systems and Signal Processing (1986)
Oommen, B.J., Lanctot, J.K.: Discretized pursuit learning automata. IEEE Trans. Syst. Man Cybern. 20(4), 931–938 (1990)
Parlar, M., Sharafali, M., Ou, J.: Optimal parking of idle elevators under myopic and state-dependent policies. Eur. J. Oper. Res. 170(3), 863–886 (2006)
Thathachar, M.A.L., Sastry, P.S.: A new approach to the design of reinforcement schemes for learning automata. IEEE Trans. Syst. Man Cybern. SCM 15(1), 168–175 (1985)
Thathachar, M.A.L., Sastry, P.S.: A class of rapidly converging algorithms for learning automata. In: IEEE International Conference on Systems, Man and Cybernetics. IEEE (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ghaleb, O., Oommen, B.J. (2019). Learning Automata-Based Solutions to the Multi-Elevator Problem. In: Huang, DS., Huang, ZK., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2019. Lecture Notes in Computer Science(), vol 11645. Springer, Cham. https://doi.org/10.1007/978-3-030-26766-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-26766-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26765-0
Online ISBN: 978-3-030-26766-7
eBook Packages: Computer ScienceComputer Science (R0)