Package pathfind finds the shortest path based on graph of squares.
The algorithm works as follows:
First setup:
- determine all squares wrapped polygon with holes
- build a visibility graph based on squares edges
Path search:
- add start and end points to visibility graph (include dynamic obstacles are optional)
- use the A* search algorithm (package astar) on the visibility graph to find the shortest path
apt-get install libgl1-mesa-dev libxi-dev libxcursor-dev libxrandr-dev libxinerama-dev libwayland-dev libxkbcommon-dev
On Windows you need C compiler, like Mingw-w64 or TDM-GCC. You can also build binary in MSYS2 shell.
To remove console window, build with -ldflags "-H=windowsgui".