PROJECT TITLE :

Benchmarks for Grid-Based Pathfinding

ABSTRACT:

The study of algorithms on grids has been widespread in a range of analysis areas. Grids are easy to implement and offer fast memory access. As a result of of their simplicity, they're used even in industrial video games. However, the analysis of labor on grids has been inconsistent between different papers. Many analysis papers use different downside sets, creating it troublesome to compare results between papers. Furthermore, the performance characteristics of each take a look at set aren't necessarily obvious. This has motivated the creation of a commonplace test set of maps and problems on the maps that are open for all researchers to use. In addition to creating these sets, we use a selection of metrics to investigate the properties of the check sets. The goal is that these check sets will be useful to many researchers, making experimental results more comparable across papers, and improving the standard of analysis on grid-based domains.