Open Source Routing Engine for OpenStreetMap
-
Updated
Dec 23, 2025 - C++
Open Source Routing Engine for OpenStreetMap
Motion planning and Navigation of AGV/AMR:ROS planner plugin implementation of A*, JPS, D*, LPA*, D* Lite, Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, PSO, Voronoi, PID, LQR, MPC, DWA, APF, Pure Pursuit etc.
This repository contains path planning algorithms in C++ for a grid based search.
Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.
A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong
Based on David Silver's paper "Cooperative Pathfinding"
This repository contains ROS2 Humble packages implementing hybrid path planning algorithms, including reeds_shepp_hybrid_astar and dubins_hybrid_star
all kinds of path planning algorithms to learn
A tool for visualizing numerous path planning algorithms.
C++ Implementation of Path Planning Algorithms based on the Python Implementation by Huiming Zhou (https://github.com/zhm-real)
2D pathfinding on quadtrees (A* and flowfield)
a star path finder for game server,with nav,tile,way point
nanoplan is a header-only C++11 library for search-based robot planning.
Shortest Path Algorithms on an Ocean Routing Graph extracted from Open Street Map data.
Selected Graph Algorithms
A ROS package for navigation based on A* search
VBM is an efficient exact wave propagation technique that has an O(n) compute and space complexity. Inherently produces globally optimal paths to all grid points. Solves several shortcomings of state-of-the-art FMM.
Add a description, image, and links to the astar topic page so that developers can more easily learn about it.
To associate your repository with the astar topic, visit your repo's landing page and select "manage topics."