skip to main content
10.1145/3440749.3442636acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicfndsConference Proceedingsconference-collections
research-article

Generation and Search for the Shortest Path in Two-dimensional Labyrinths as A Model for Optimizing Routing Processes in the Packet Switching Network

Published: 13 May 2021 Publication History

Abstract

The algorithms for generating and finding the shortest path in two-dimensional labyrinths and their characteristics are considered. The aim of the study is to determine the dependence of the working time of the shortest path search algorithms on the characteristics of mazes. This may allow these algorithms to be used to optimise routing processes in packet switching networks. All of the characteristics of the algorithms under consideration are described in detail. These search algorithms also allow for paralleling, so they can be used when creating games or any special applications. Such generation algorithms have been selected, the resulting mazes of which have different characteristics, thus making it possible to determine the required dependence. The peculiarity of applying the result of this research is that the fastest search algorithm can be selected for the generation algorithm or for specific characteristics of an already generated maze. The search algorithms can be improved to find paths in mazes in N-dimensional spaces. This search extension possibility can be widely used not only for working with mazes, but also with any other structure of a given coordinate system.

References

[1]
Buck J. 2015. Mazes for Programmers: Code Your Own Twisty Little Passages. Pragmatic Bookshelf, Dallas, Texas - Raleigh, North Carolina
[2]
Pullen W. 2018. Think Labyrinth! (November 2018). Retrieved November 10, 2020 from http://www.astrolog.org/labyrnth.html
[3]
David J. Aldous. 1990. A random walk construction of uniform spanning trees and uniform Iabelled trees. SIAM Journal of Discrete Mathematics, 3(4):450- 465, 1990.
[4]
A. Broder. 1989. Generating random spanning trees. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, October 1989, 442- 447. https://doi.org/10.1109/SFCS.1989.63516
[5]
Buck J. 2011. Maze Generation: Aldous-Broder algorithm. (January 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/1/17/maze-generation-aldous-broder-algorithm.html.
[6]
Buck J. 2010. Maze Generation: Recursive Backtracking. (December 2010). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2010/12/27/maze-generation-recursive-backtracking.
[7]
Justin Haupt. 2019. Generating Random Mazes With Recursive Backtracking. (March 2019). Retrieved November 10, 2020 from https://medium.com/@jhaupt100/generating-random-mazes-with-recursive-backtracking-e9c8df1dcda5
[8]
Sergio Silva, Diogo Duarte, Rolando Barradas, Salviano Soares, Antonio Valente and Manuel Reis. 2017. Arduino recursive backtracking implementation. In Proceedings of the 20th International Conference on Climbing and Walking Robots and the Support Technologies for Mobile Machines, October 2017, 169-178. https://doi.org/10.1142/9789813231047_0023.
[9]
Buck J. 2011. Maze Generation: Growing Tree algorithm. (January 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/1/27/maze-generation-growing-tree-algorithm.
[10]
Hendrawan Y. F. 2018. A Maze Game on Android Using Growing Tree Method. Journal of Physics Conference Series 953(1), 2018.
[11]
Buck J. 2011. Maze Generation: Sidewinder algorithm. (February 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/2/3/maze-generation-sidewinder-algorithm.html
[12]
Amit Patel. 2020. Implementation of A*. (October 2020). Retrieved November 10, 2020 from https://www.redblobgames.com/pathfinding/a-star/implementation.html
[13]
Steve Mussmann and Abi See. Graph Search Algorithms. Retrieved November 10, 2020 from http://cs.stanford.edu/people/abisee/gs.pdf

Index Terms

  1. Generation and Search for the Shortest Path in Two-dimensional Labyrinths as A Model for Optimizing Routing Processes in the Packet Switching Network
            Index terms have been assigned to the content through auto-classification.

            Recommendations

            Comments

            Information & Contributors

            Information

            Published In

            cover image ACM Other conferences
            ICFNDS '20: Proceedings of the 4th International Conference on Future Networks and Distributed Systems
            November 2020
            313 pages
            ISBN:9781450388863
            DOI:10.1145/3440749
            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            Published: 13 May 2021

            Permissions

            Request permissions for this article.

            Check for updates

            Author Tags

            1. Maze
            2. optimization
            3. search algorithm
            4. the shortest path

            Qualifiers

            • Research-article
            • Research
            • Refereed limited

            Conference

            ICFNDS '20

            Contributors

            Other Metrics

            Bibliometrics & Citations

            Bibliometrics

            Article Metrics

            • 0
              Total Citations
            • 14
              Total Downloads
            • Downloads (Last 12 months)1
            • Downloads (Last 6 weeks)0
            Reflects downloads up to 12 Feb 2025

            Other Metrics

            Citations

            View Options

            Login options

            View options

            PDF

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format.

            HTML Format

            Figures

            Tables

            Media

            Share

            Share

            Share this Publication link

            Share on social media