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

An A* pathfinding implementation with PCG (Procedural Content Generation) to generate custom splines in unreal engine between two points

Basic Shooting Game in C++ and OpenCV

A maze generator written in Dart and Flutter.

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

This workspace is a sandbox for multi-robot research. Initially, it includes a fully opperational multi-robot exploration stack for ROS Noetic and Ubuntu 20.04 that allows them to keep intermittent communication in Gazebo 11 simulations.

Multiagent pathfinding plugin for Unreal Engine 4. Implementation is based on WHCA*, readme contains a detailed explanation of the approach with pictures from a tech demo.

Implementation of the A* and Jump Point Search (JPS) algorithms

The pathfinding implementation in the Unreal Engine 5

A Route Planner based on A* search algorithm implemented in C++ to find the best route in a given OpenStreetMap

This is a collection of my implementation of robotic 2D path planning algorithms.

Route planning on Earth map with opencv c++ through Greedy , A-start and etc. algorithm

Implementation of some pathfinding and multi-agent pathfinding algorithms

C++ implementation of A* Search Algorithm for finding the shortest path between two nodes on OpenStreetMap data.

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.

An AI gym for building, measuring, and learning agents in massively parallel fuzzed environments using the Chinese Room Abstract Stack (Crabs) machine, ASCII Data Types, and Script2.

🤖📚 Comprehensive AI Learning Repo: Master DFS, BFS, DLS, IDS, UCS, Bidirectional Search, Greedy, A*, Mini-max, Alpha-beta Pruning, and Genetic Algorithm. Your go-to resource for AI course notes, lab codes, and exploration

cpp17 implementation of A* Search Algorithm for finding the shortest path between two nodes on OpenStreetMap data

Simple implementation for solving the 8 puzzle problem using parallel programing "MPI-C++"

This repository is for Single Agent Course Project (3rd Assignment): Evaluating FastMap and Hybrid Heuristics for Fast Grid Pathfinding