Popular GitHub Repositories for Astar

Motion planning algorithms commonly used on autonomous vehicles. (path planning + path tracking)

Distributed Java game server, including cluster management server, gateway server, hall server, game logic server, background monitoring server and a running web version of fishing. State machine, behavior tree, A* pathfinding, navigation mesh and other AI tools

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.

Code for DeepCubeA, a Deep Reinforcement Learning algorithm that can learn to solve the Rubik's cube.

Game AI for java.NavMesh、A*、BehaviorTree、FSM

Solving a Rubik's Cube and 15 Puzzle using the Deep Reinforcement Learning and Search

Created in Unity 5 for the purposes of learning AI techniques. Features behaviour trees and A* pathfinding.

CS50’s Introduction to Artificial Intelligence with Python. This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation.

Solving Rubik's Cube with Deep Reinforcement Learning, A* and visualize with PyQt5.

Project for ROB 550. Implementing SLAM using LIDAR, wheel encoders and IMU on MBot.

TurtleSim A* Path Planning with Meta LLaMA-3.1-405B-Instruct model powered by NVIDIA / LlamaIndex Agent

AI Module based on Unity HTFramework.

code corresponding to a research paper about M* (M star) and it's modification to solve multi agent pathfinding with matching problems (MMAPF)

An easy A* pathfinding plugin (addon) for Godot's GridMap.

在互联节点网络中查找两个节点之间的最短路径

Self Driven Vehicle using AI in Robotics ,i.e., Kalman filters, A* algorithm, PID control, localization, etc.The basic functionality of this car is just to chase and catch the running away car just like cops. For this, the car is such designed that is takes all the desired steps on its own in order to catch the running away car safely on a high traffic lane.

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

2D Maze game with AI built using Godot

This is a sliding puzzle game with AI solution finder. The solution employs a minimum priority queue (binary heap) coupled with an A* algorithm.

Implemented reinforcement learning algorithms, including Value-Iteration and Q-Learning, for a 2D grid world Markov Decision Process resembling a Pac-man game. Also applied the Mini-Max algorithm and common path-planning techniques such as A*, Dijkstra, and bidirectional search.