APPLYING UNINFORMED SEARCH ALGORITHMS FOR PATHFINDING IN VARIOUS ENVIRONMENTS"
Article Sidebar
Это произведение доступно по лицензии Creative Commons «Attribution» («Атрибуция») 4.0 Всемирная.
Main Article Content
Аннотация:
The A* algorithm is a well-established search method that has been widely utilized in the pathfinding research community. Its strengths—efficiency, simplicity, and modularity—distinguish it from other pathfinding tools. Because of its proven effectiveness and adaptability, A* has become a popular choice among researchers looking to address complex pathfinding challenges. Its comprehensive approach allows for effective navigation in various applications, from robotics to video games, making it a cornerstone in the field of pathfinding research. This paper investigates the application of the A* algorithm in solving pathfinding problems, focusing on its effectiveness and efficiency in various environments
Ключевые слова:
Article Details
Как цитировать:
Библиографические ссылки:
Primbetov, A. (2024). Automatic Red Eye Remover using OpenCV. Modern Science and Research, 3(1), 1-3.2. Primbetov, A., Saidova, F., Yembergenova, U., & Primbetov, A. (2024). REAL TIME LOGO RECOGNITION USING YOLO ON ANDROID. Modern Science and Research, 3(1), 1-5.
Abbaz, P. (2024). REAL TIME LOGO RECOGNITION USING YOLO ON ANDROID. Eurasian Journal of Academic Research, 4(7S), 1094-1099.
Giyosjon, J., Anvarjon, N., & Abbaz, P. (2023). SAFEGUARDING THE DIGITAL FRONTIER: EXPLORING MODERN CYBERSECURITY METHODS. JOURNAL OF MULTIDISCIPLINARY BULLETIN, 6(4), 77-85.
ОБУЧИТЕ YOLOV8 НА ПОЛЬЗОВАТЕЛЬСКОМ НАБОРЕ ДАННЫХ Примбетов Аббаз,Саидова Фазилат,Нормуминов Анваржон, Примбетов Азиз, https://doi.org/10.5281/zenodo.8023689
DEVELOP AN APPLICATION THAT CONVERTS VIDEOS INTO SLIDES UTILIZING BACKGROUND ESTIMATION AND FRAME DIFFERENCING IN OPENCV Primbetov Abbaz, Abdusalomov Shaxbozbek, To‘lqinov Oybek, Rahmonova Mahbuba, Pardaboyeva Mohichexra. https://doi.org/10.5281/zenodo.13364871
Cui, X., & Shi, H. (2011). A*-based pathfinding in modern computer games. International Journal of Computer Science and Network Security, 11(1), 125-130.
Verma, M. G., & Kumar, M. A. Algorithmic Pathfinding: Comparing Dijkstra's and A* Algorithms in Complex Grid Environment.
Foead, D., Ghifari, A., Kusuma, M. B., Hanafiah, N., & Gunawan, E. (2021). A systematic literature review of A* pathfinding. Procedia Computer Science, 179, 507-514.
Lester, P. (2005). A* pathfinding for beginners. online]. GameDev WebSite. http://www. gamedev. net/reference/articles/article2003. asp (Acesso em 08/02/2009).