Skip to content

Various Pathplanning Algorithms Derived off Dijkstra's in mulitple situations visualized by SFML. Paper: https://schmider.kim/vwa/main.pdf

Notifications You must be signed in to change notification settings

kim366/Pathplanning

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pathplanning

Various Pathplanning Algorithms Derived off Dijkstra's in multiple situations visualized by SFML

Dependencies

Build Instructions

For Building cmake and a C++17 compiler is necessary (for example g++ 7.1 or Clang 4). The MinGW-w64 fork comes with g++ 7.1 and works for building this project.

Download SFML for your compiler and place it within the project's root directory.

mkdir build
cd build
cmake ..

And then invoke the appropriate command for your build system. Which may be make, ninja or opening the generated Visual Studio project file. A binary named "gui" will be generated.

Full example using MinGW:

mkdir build
cd build
cmake -G "MinGW Makefiles" ..
mingw32-make

Build Tests

To build tests first download the Catch single include and place it as "catch.hpp" into the include folder. Then add -DBUILD_TESTS=ON when invoking cmake. The additional "tests" binary will be generated.