There are 4 repositories under astar topic.
Common used path planning algorithms with animations.
Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.
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.
An asynchronous A* pathfinding API written in Javascript.
Pathfinding library for rust
Simulation of path planning for self-driving vehicles in Unity. This is also an implementation of the Hybrid A* pathfinding algorithm which is useful if you are interested in pathfinding for vehicles.
This repository contains path planning algorithms in C++ for a grid based search.
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
A fast 2D path finding library based on the A* algorithm. Works with both grids and graphs. Supports any .NET variant that supports .NETStandard 2.0 or higher. This library has no external dependencies. The library is licensed under the MIT license.
Official implementation of "Path Planning using Neural A* Search" (ICML-21)
Modular framework for creating selective indexers and featureful backends for dapps
Implementation of the D* lite algorithm in Python for "Improved Fast Replanning for Robot Navigation in Unknown Terrain"
Generate Cool-Looking Mazes and Animations Illustrating the A* Pathfinding Algorithm
Python implementations of several robotic motion planners
a godot based framework to build hex map boardgames.
A* written in C#, used with LINQ.
An all-in-one application to visualize multiple different local path planning algorithms
A collection of useful Scripts, Scenes, Systems, and Templates for the Godot Game Engine.
A* search algorithm in TypeScript
Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.
A*or A Star algorithm java implementation
Unity client navmesh export to server for pathfinding
A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.
Sampling-based Mobile Robot Path Planning Algorithm by Dijkstra, Astar and Dynamic Programming on Undirected Graph
A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.