Ensemble d’algorithmes classiques d’intelligence artificielle couvrant la recherche de solutions, les jeux adversariaux, les méthodes d’optimisation et l’apprentissage supervisé, avec des implémentations pratiques.

🌐 A web-based interface for running Multiple Sequence Alignment (MSA) using A-Star and PA-Star algorithms.

🦀 PA-Star is a software that performs a parallel A-Star search to solve the Multiple Sequence Alignment (MSA) problem.

Autonomous path planning system for the NAO humanoid robot using the A* algorithm, grid-based world modelling, Manhattan heuristics, obstacle avoidance and real-robot execution for ball-retrieval tasks. Includes simulation in Webots/RViz and real NAO execution.

An A* GPS road navigation system.

.NET library for procedural dungeon generation—graph-based room topology, spatial layout solver, and A* hallway generation for roguelike games

Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.

A Python implementation of the A* pathfinding algorithm with visualization.

Cost-aware A* path planner for ROS 2 Nav2 - Intelligent obstacle avoidance for autonomous navigation

Search-based decoder for quantum error correction (QEC) written in C++ and Python.

Implementacja algorytmu A* – analiza heurystyk i eksploracja grafów

Search algorithms (BFS, DFS, Best-First, A*) implemented in C for the classic Blocks World problem.

Készítette: Varga Zoltán KQTUUH, Mayer Márton IFRTOT | Automatizált labirintus generátor és útvonaltervező (A* / DFS) ROS 2 Humble/Jazzy rendszerekhez.

Motion planning(Path Planning and Trajectory Planning/Tracking) of AGV/AMR：python implementation of Dijkstra, A*, JPS, D*, LPA*, D* Lite, (Lazy)Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, Voronoi, PID, DWA, APF, LQR, MPC, RPP, Bezier, Dubins etc.

Pet project, browser game or an attempt of it. Typescript, React, Three.js

Project Texas HyperNet - Algorithmic Hyperloop Route Generation

A* Algorithm Path Visualizer Website! CC-BY-SA-4.0

Efficient A* 8-Puzzle solver utilizing a combination of cost and heuristic estimates for intelligent search. Handles both number and image-based scenarios, providing visual representation and optional step-saving.

AI project solving 8-puzzle with horizontal, vertical and diagonal moves using UCS and A*, developed for my Artificial Intelligence course.

Maze Runner Robot: An autonomous robot navigates a labyrinth to find the fastest path. Three difficulty levels with increasing uncertainty. Implemented with pathfinding algorithms and real-time exploration.