v0.3.1

• Extend to A* variant to Weighted A* and Best First Search

v0.3.0

Changes

• Refactor A* and Dijkstra to share common code of A* variant
• Enable stepping of path finding
• Add struct of MapStorage
• Minor improvement for code smell

Old interface

• bool SetOccupancyGrid(const std::vector &occupancy_grid, int x_size, int y_size)
• std::vector GetPath(const Coordinate& dest)
• bool FindPath(const Coordinate& src, const Coordinate& dest)

New interface

• void SetMapStorageSize(const size_t x_size, const size_t y_size)
• bool SetOccupiedGrid(const std::vector &occupied_grid)
• bool SetStartAndDestination(const Coordinate &start, const Coordinate &dest)
• std::optional<std::vector> StepOverPathFinding()
• bool FindPath()
• std::optional<std::vector> GetPath()
• void Reset()

v0.2.2

• Added Bresenham's line algorithm on top of previous version

v0.2.1

• Basic package containing digital filter (low pass), search algorithm (A*, dijikstra)