a-star-search
Here are 202 public repositories matching this topic...
Language:All
Sort:Most stars
A* search algorithm in TypeScript
- Updated
Apr 26, 2023 - TypeScript
A visualizer for the core search algorithms used in AI and game development. Special thanks to Amit Patel and his cool tutorials for providing me with the inspiration. #MadeWithUnity
- Updated
Oct 10, 2024 - C#
Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces
- Updated
Mar 11, 2025 - C++
Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
- Updated
Jan 10, 2025 - C++
CSE 571 Artificial Intelligence
- Updated
Jan 3, 2018 - Python
🔍 A friendly visualizer for some search algorithms like DFS, BFS, Greedy and A*
- Updated
Jul 24, 2020 - TypeScript
A Hybrid-A* planner with early stopping for efficient path planning and extended motion primitives to account for the motion capabilities of the U-Shift II vehicle. Author: Oliver Schumann
- Updated
Nov 19, 2024 - C++
A grid geometry toolkit for A* pathfinding and 2D sprite motion.
- Updated
Jan 7, 2023 - JavaScript
Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.
- Updated
Sep 28, 2021 - Python
collection of motion planning algorithms
- Updated
Nov 1, 2020 - Jupyter Notebook
Simple graph classes
- Updated
Jan 8, 2025 - Python
A simple fastest route finder written in Java includes BFS, Djikstra(Speed limits included) and A* Algortihms also has the feature of visualization of visited nodes.
- Updated
Jun 7, 2019 - Java
It's an implimetetion a Pathfinding Algorithm with multiple agents
- Updated
Nov 20, 2019 - C++
Eight Puzzle solver using BFS, DFS & A* search algorithms
- Updated
May 8, 2020 - Java
Romania Problem with A* Algorithm - AI Class Homework
- Updated
Aug 20, 2019 - Python
Desktop app for visualizing graph search algorithms
- Updated
May 23, 2022 - Python
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
- Updated
Dec 3, 2018 - C++
This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.
- Updated
Apr 30, 2024 - C++
CIT-316 (Artificial Intelligence Sessional)
- Updated
Feb 14, 2023 - Jupyter Notebook
Implementations of artificial intelligence agents that plays Pac-Man
- Updated
Apr 10, 2019 - Python
Improve this page
Add a description, image, and links to thea-star-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thea-star-search topic, visit your repo's landing page and select "manage topics."