There are 4 repositories under a-star topic.
VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem
Motion planning and Navigation of AGV/AMR:python implementation of Dijkstra, A*, JPS, D*, LPA*, D* Lite, (Lazy)Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, Voronoi, PID, DWA, APF, LQR, MPC, RPP, DDPG, Bezier, Dubins etc.
BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms
Motion planning and Navigation of AGV/AMR:matlab implementation of Dijkstra, A*, Theta*, JPS, D*, LPA*, D* Lite, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, Voronoi, PID, LQR, MPC, APF, RPP, DWA, DDPG, Bezier, B-spline, Dubins, Reeds-Shepp etc.
An simple and optimized grid pathfinding
Common data structures and algorithms implemented in JavaScript
路径规划算法,A*,A-star启发搜索,Hybrid-A*,混合A*算法,Dijkstra迪杰斯特拉算法,GBFS贪婪最佳优先搜索算法,DFS深度优先搜索,BFS广度优先搜索算法等,车辆路径规划算法,小黑子路径规划
Hex-grid utilities for board and strategy games with path-finding, field-of-view, and more
Motion planning algorithm implementation
Autonomous driving trajectory planning solution for U-Turn scenario
Conflict-based search for multi-agent path finding
Hybrid A* Motion Planner for a Car using kinematic & Reeds-Shepp Model
A* search algorithm in TypeScript
Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
Implementation of Elementary Algorithms (infix-prefix-postfix-evaluation-to-longest-common-increasing-sub-sequence-activity-selection-balance-kd-binary-heap-binomial-tree-breath-depth-first-search-max-flow-shortest-path-topological-sort-calculus-derivative-integration-forward-interpolation-simpson-rule-intersecting-area-non-linear-equation-jacobis-gauss-seidal-bisection-false-position-newton-raphson-fixed-point-secant-cigarette-smokers-genetic-huffman-a-a*-star-binary-knuth-morris-pratt-kmp-quick-thread-priority-based-premitive-shortest-job-non-primitive-arithmetic-expression-data-structures-list-node-implementation-one-two-way-linked-stack-string-graph-numerical-methods-equation-solving-solve-process-problem-search-sort-prime-ugly-friend-perfect-fibonacci-factorial-factor-number)
Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.
A Python implementation of the A* algorithm in a 2D Occupancy Grid Map
Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
A* Mario AI as used by Robin Baumgarten for the CIG 2009 Mario AI competition
Based on David Silver's paper "Cooperative Pathfinding"
Implementation of the A*-Algorithm in Unity3D
C++ General Purpose Goal Oriented Action Planning framework for Unreal Engine
Swift implementation of the Sliding Puzzle game with Iterative Deepening A* AI Solver.
Best practices for implementing A* with a focus on four- and eight-connected grid worlds.
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. :gear:
GraphLab is an application that shows visually how several graph algorithms work
This work proposes an anytime iterative system to concurrently solve the multi-objective path planning problem and determine the visiting order of destinations. The paper has been uploaded to arXiv at https://arxiv.org/abs/2205.14853