Lovrenc Gregorčič (2012) Path search algorithms. EngD thesis.
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…) , which offer some advantages. Described algorithms are also not the best choice for imitating AI on limited resources . However, they provide you a good basis.
Actions (login required)