Comparative analysis of algorithms to search for the shortest path in a maze

被引：0
|
作者：
Karova, Milena [1 ]
Penev, Ivaylo [1 ]
Kalcheva, Neli [1 ]
机构：
[1] Tech Univ Varna, Dept Comp Engn, Varna, Bulgaria
来源：
2016 IEEE INTERNATIONAL BLACK SEA CONFERENCE ON COMMUNICATIONS AND NETWORKING (BLACKSEACOM) | 2016年
关键词：
robots; labyrinth; maze; path finding; backtracking; A*; genetic algorithm;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The aim of the paper is research and comparative analysis of algorithms from the field of artificial intelligence for searching shortest path in a maze. The algorithms studied are A* (A star), backtracking algorithm and genetic algorithm (GAPP Genetic Algorithm Path Planning). The algorithms are compared by two criteria: length of the found path and time for finding the path. The results, presented analytically and graphically, show the application of the three algorithms for mazes with various size and number of obstacles.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] Comparative Analysis of Parallelised Shortest Path Algorithms using Open MP
    Uditi
    Arun, M.
    [J]. 2017 IEEE 3RD INTERNATIONAL CONFERENCE ON SENSING, SIGNAL PROCESSING AND SECURITY (ICSSS), 2017, : 369 - 377
  • [2] Analysis of algorithms for shortest path problem in parallel
    Popa, Bogdan
    Popescu, Dan
    [J]. PROCEEDINGS OF THE 2016 17TH INTERNATIONAL CARPATHIAN CONTROL CONFERENCE (ICCC), 2016, : 613 - 617
  • [3] A performance analysis of hierarchical shortest path algorithms
    Fetterer, A
    Shekhar, S
    [J]. NINTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1997, : 84 - 93
  • [4] Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
    Hansen, Eric A.
    Abdoulahi, Ibrahim
    [J]. PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 3283 - 3290
  • [5] Genetic Algorithms for Solving Shortest Path Problem in Maze-Type Network with Precedence Constraints
    JunWoo Kim
    Soo Kyun Kim
    [J]. Wireless Personal Communications, 2019, 105 : 427 - 442
  • [6] Genetic Algorithms for Solving Shortest Path Problem in Maze-Type Network with Precedence Constraints
    Kim, JunWoo
    Kim, Soo Kyun
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2019, 105 (02) : 427 - 442
  • [7] Engineering shortest path algorithms
    Demetrescu, C
    Italiano, GF
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 191 - 198
  • [8] General Error Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
    Hansen, Eric A.
    Abdoulahi, Ibrahim
    [J]. THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 3130 - 3137
  • [9] Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms
    Demetrescu, Camil
    Italiano, Giuseppe F.
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (04)
  • [10] SHORTEST PATH WITH CONSTRAINTS - ALGORITHMS AND APPLICATIONS
    MINOUX, M
    [J]. ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1975, 30 (11-1): : 383 - 394
12345