Comparative Analysis of Optimal Path Search Algorithms-Reference-Cited by-同舟云学术

Comparative Analysis of Optimal Path Search Algorithms

Published:2020-12-15 Issue:12 Volume:6 Page:248-255
ISSN:2414-2948
Container-title:Bulletin of Science and Practice
language:ru
Short-container-title:BSP

Author:

Sultanova A.¹^ORCID

Affiliation:

1. Azerbaijan State University of Oil and Industry

Abstract

This article discusses widely used algorithms for finding optimal paths. Currently, there is a fairly wide list of algorithms for the problem of finding the shortest path, and is actively used in mobile robotics to find the optimal route. The article offers a two-level system that performs traffic planning. Comparative analysis of various search methods was carried out: their length, complexity, and a number of turning points. The purpose of the article is to study and compare algorithms from the field of artificial intelligence for finding the shortest path in a maze and a hexagonal grid. Algorithms under study: A* (star), Dijkstra algorithm, BFS, DFS, and Greedy algorithm. Algorithms are compared based on two criteria: the length of the found path and the time it takes to find the path. The results, presented analytically and graphically, show the application of five algorithms for mazes with different size and number of obstacles.

Publisher

Publishing Center Science and Practice

Subject

General Medicine

Reference11 articles.

1. Peri, V. M., & Simon, D. (2005, June). Fuzzy logic control for an autonomous robot. In NAFIPS 2005-2005 Annual Meeting of the North American Fuzzy Information Processing Society (pp. 337-342). IEEE. https://doi.org/10.1109/NAFIPS.2005.1548558

2. Van Den Berg, J., Shah, R., Huang, A., & Goldberg, K. (2011, August). ANA*: anytime nonparametric A*. In Proceedings of twenty-fifth AAAI conference on artificial intelligence (AAAI-11) (2, 1).

3. Bnaya, Z., Stern, R., Felner, A., Zivan, R., & Okamoto, S. (2013, June). Multi-agent path finding for self interested agents. In Sixth Annual Symposium on Combinatorial Search.

4. Harabor, D. D., & Grastien, A. (2014, June). Improving Jump Point Search. In ICAPS.

5. Uras, T., Koenig, S., & Hernández, C. (2013, June). Subgoal graphs for optimal pathfinding in eight-neighbor grids. In Twenty-Third International Conference on Automated Planning and Scheduling.