The goal of this thesis is to create a demonstration software, that allows us to examine the properties and running characteristics of a special group of path finding methods, called „anytime search algorithms”. The main feature of these algorithms is that they find a – possibly suboptimal – solution „quickly” and then gradually refine their search results as opposed to focusing on finding an optimal solution.
During my work I research some of these algorithms and select a few to incorporate into the application. An interface will also be defined, which gives us means to evaluate the properties and performance of the selected algorithms.
Following the introduction of the selected algorithms, I specify the requirements towards the demonstration software and present the system design. Following the design description I show the implemented system and explain how to use its features and functions. Finally using some test scenarios I evaluate the running performance and properties of the selected anytime algorithms.