Analysis of the decision-making algorithm efficiency in complex game environments on the example of Pac-Man
Вантажиться...
Файли
Дата
Автори
Назва журналу
Номер ISSN
Назва тому
Анотація
Game simulations such as Pac-Man are substantial for testing decision-making algorithms in conditions that mimic real-life scenarios. This creates new opportunities for the development of autonomous systems that can adapt to changing environmental conditions and interact with other agents. The study aimed to compare Expectimax, Monte Carlo Tree Search, and Alpha-Beta Pruning algorithms in the changed conditions of the Pac-Man game to determine the most efficient approach to decision-making in complex environments. For this purpose, simulation modelling was used to evaluate the effectiveness of agents in various game mazes that differ in complexity. The study measured such indicators as the number of points, game time, and percentage of winnings, which were used to assess the effectiveness of algorithms in different situations. The analysis of the experiments determined that the Monte Carlo algorithm is the most effective among the tested methods for solving less complex mazes, confirming quickly optimal path search in simple conditions. The Alpha-Beta Pruning algorithm demonstrated less efficiency, which indicates the need to optimise it for more complex environments. Expectimax demonstrated significantly lower performance, which indicates its limited suitability for complex game mazes. The study demonstrated that increasing the complexity of the mazes significantly reduces the performance of all algorithms, especially with more obstacles, highlighting the importance of developing more robust methods for highly complex environments. Optimising the Monte Carlo and Alpha-Beta Pruning algorithms for complex environments can significantly improve their performance and make them effective for real-world applications in navigation and control of moving devices. The results of this study can be used to develop efficient navigation algorithms for autonomous vehicles, drones and other robotic systems adaptation to changes in complex environments is critical.
Опис
Ключові слова
УДК
Тип документа
Мова
ISSN
Бібліографічний опис
Novikov A., Yanovskyi V. Analysis of the decision-making algorithm efficiency in complex game environments on the example of Pac-Man // Information Technologies and Computer Engineering. 2024. № 3 (21). С. 108-118. URI: https://itce.vn.ua/uk/journals/t-21-3-2024/analiz-efektivnosti-algoritmiv-prynyattya-rishen-v-umovakh-skladnikh-igrovikh-seredovishch-na-prikladi-pac-man.
Схвалення
Рецензія
Доповнено
Цитується в
Список використаної літератури (22)
- Busatto-Gaston, D., Chakraborty, D., & Raskin, J.-F. (2020). Monte Carlo tree search guided by symbolic advice for MDPs. In 31st international conference on concurrency theory (CONCUR 2020). Leibniz international proceedings in informatics (LIPIcs) (Vol. 171, pp. 40:1-40:24). Schloss Dagstuhl: Leibniz-Zentrum für Informatik. doi: 10.4230/LIPIcs. CONCUR.2020.40.
- Cheng, K. M., Liu, H., & Dou, X. (2024). Randomized Pacman maze generation algorithm. Applied and Computational Engineering, 42, 156-162. doi: 10.54254/2755-2721/42/20230771.
- Cheng, Y., Hu, X., Tang, Q., Qi, H., & Yang, H. (2020). Monte Carlo Tree search-based mixed traffic flow control algorithm for arterial intersections. Transportation Research Record, 2674(8), 167-178. doi: 10.1177/0361198120919746.
- Evillasio2. (2022). The Pac-Man Ghosts Alt. DeviantArt. Retrieved from https://www.deviantart.com/evilasio2/art/ The-Pac-Man-Ghosts-Alt-916669643.
- Guerreiro, J.M.P. (2021). Learning agent in the Ms. Pac-Man vs Ghosts game. (Master’s Thesis, Instituto Superior Técnico, Lisboa, Portugal).
- Li, W., Liu, Y., Ma, Y., Xu, K., Qiu, J., & Gan, Z. (2023). A self-learning Monte Carlo tree search algorithm for robot path planning. Frontiers in Neurorobotics, 17. doi: 10.3389/fnbot.2023.1039644.
- Liu, X., Li, Y., He, S., Fu, Y., Yang, J., Ji, D., & Chen, Y. (2009). To create intelligent adaptive game opponent by using Monte-Carlo for the game of Pac-Man. In Fifth international conference on natural computation (pp. 598-602). Tianjian: IEEE. doi: 10.1109/ICNC.2009.633.
- Lövétei, I. F., Kővári, B., & Bécsi, T. (2021). MCTS based approach for solving real-time railway rescheduling problem. Periodica Polytechnica Transportation Engineering, 49(3), 283-291. doi: 10.3311/PPtr.18584.
- Maddipati, H., Kundurthi, A., Raaj, P., Srilatha, K., & Surapaneni, R. (2020). Artificial Intelligence based Pacman Game. International Journal of Innovative Technology and Exploring Engineering, 9, 140-144. doi: 10.35940/ijitee. I6975.079920.
- Mishra, P., Patel, V., Mittal, P., & Patni, J.C. (2018). Algorithm analysis tool based on execution time-input instancebased runtime performance benchmarking. In International conference on recent developments in science, technology, humanities and management – 2017 (pp. 27-30). Kuala Lumpur: SRD.