Algorithms for path optimizations: a short survey

Path finding is used to solve the problem of finding a traversable path through an environment with obstacles. This problem can be seen in many different fields of study and these areas rely on fast and efficient path finding algorithms. This paper aims to describe and review state of the art optimization techniques that are used on optimized path finding and compare their performances. Moreover, a special attention is paid on the proposed approaches to identify how they are tested on different test cases; whether the test cases are automatically generated or benchmark instances. The review opens avenues about the importance of automatic test case generation to test the different path finding algorithms.