ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Path search algorithms

Lovrenc Gregorčič (2012) Path search algorithms. EngD thesis.

Download (2288Kb)


    Path finding algorithms are part of artificial intelligence. First algorithms were presented in the 1950s. This paper will present some of the algorithms from those days as well as their successors. The provided information about their logic and defining properties should suffice the reader to find the appropriate algorithm for his needs. Each presented algorithm has already many modifications invented, but those modifications are out of scope of this paper. They are, however, described in some of the literature I used. Map presentation is another thing lacking sufficient attention in this paper. All I was using were grids, but there are many other possibilities (waypoints, mesh…) [5], which offer some advantages. Described algorithms are also not the best choice for imitating AI on limited resources [3]. However, they provide you a good basis.

    Item Type: Thesis (EngD thesis)
    Keywords: algorithms, path finding, A*
    Number of Pages: 30
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Igor Kononenko237Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00009489236)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 1891
    Date Deposited: 16 Oct 2012 14:10
    Last Modified: 06 Nov 2012 12:51
    URI: http://eprints.fri.uni-lj.si/id/eprint/1891

    Actions (login required)

    View Item