8-puzzle-game made with pygame and use A* to solve the game

Building and Solving Sokoban game using AI

AI project written in Python Pyamaze that lets you create your own mazes and watch as they're solved in real time.

Drone control algorithm: A* obstacle avoidance, grid search and image recognition (OpenCV)

This program based on plants vs zombies simulates the problem of the sample collecting robot (multi-agent system) proposed to be carried out with the A* informed search algorithm where the samples will be found and grouped into clusters, using crumbs to trace the path to the ship. and describe the collaboration between agents.

A global planner plugin of a grid-based A-star search algorithm for ROS navigation stack.

The ride-sharing simulation replicates services like Uber or Lyft, analyzing user demand, driver availability, and pricing dynamics for optimization.

Visualization of several well-known graph pathfinding algorithms using Rust programming language with pixels crate for graphics

Pacman Agent: an artificial intelligent agent that plays Pacman.

CentA*, an A* algorithm extension, revolutionizes NPC pathfinding in Unreal Engine 5. Optimal start and end node selection improves efficiency. Developed with Blueprints and C++, it introduces diverse enemy behaviors via a behavior tree. Balancing accuracy and efficiency accommodates obstacles, dynamic environments, and multiple agents.

project in python based on PyQT6 framework implementing the visualization of a shortest path search

Implementation of artificial intelligence search algorithms for robot movement on the table.

This is 8-Puzzle-Problem Solver In which We can Input any intermediate State in it and because of it will generate solution of this state and give us goal state based on input state .

Priority queues in finding shortest path.

A Bresenham's line based global path planning algorithm. A recursive path planning algorithm was developed that operates on the grid maps represented by a masked array and solves potential looping problems using a state machine-based loop breaking mechanism.

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

path finder in maze using graph algos