Find the way

To further improve our library, we have created a path finder algorithm. We are currently using the well-known A*Star algorithm for finding the shortest path, and a modified Djikstra algorithm for finding the coverage area.