Year: 2024
Type: article
Abstract: The development of gaming software, which is used for both entertainment and educational purposes, is becoming increasingly important at present time. Pathfinding algorithms play a special role in this type of software. Pathfinding algorithms are needed to solve problems related to finding the optimal path between two points on a graph, which can be a computer game map or any other system of interconnected objects and take into account various restrictions and conditions, such as network congestion, the presence of various obstacles, cost, etc. This paper focuses on various pathfinding algorithms used in modern technologies such as artificial intelligence, robotics, and computer games. The strengths and weaknesses of the algorithms are analyzed with a focus on video game applications. Recommendations for selecting the optimal algorithm for specific tasks in different game scenarios are also discussed in the paper.
Source: SYNCHROINFO JOURNAL
Authors: Igor Udalov, V.A. Dokuchaev
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7083677182