This repository contains an implementation of the algorithms provided in the paper: An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path ...

I've written a simple Java implementation of Dijkstra's algorithm and A* search for path planning, along with a Matlab interface to the code. The Java planning code is much faster than the same thing ...

Note: The functionality of PATHMAN is likely to change considerably to include simple dependency handling and versions. These changes will likely break compatibility with current PATHMAN. Consider ...