Path Finding in a Terrain with Obstacles: An Experimentation System and Algorithms Comparison

Lukasz Gadek, Leszek Koszalka, Iwona Pozniak-Koszalka, and Andrzej Kasprzak


path problem, optimization, algorithm, simulated annealing


In this paper, the research on a two dimensional path problem is conducted using a designed and implemented experimentation system. Studies are performed with respect to various parameters and distinct path problem categories: shortest path, pseudo Hamilton cycle, decisive problem. Two heuristic algorithms for solving such problems are created, including the Algorithm Based on Simulated Annealing (ABSA) and the Algorithm Based on Ant Colony (ABAC). The properties of algorithms are discussed with reference to Bellman - Ford deterministic algorithm. Analysis of results of the designed simulation experiments allows recommending the both proposed algorithms

Important Links:

Go Back