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

Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

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

It's an implimetetion a Pathfinding Algorithm with multiple agents

A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts

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.

Solves puzzles of various sizes

Solving 8-puzzle problem with A-star algorithm, GUI implementation with Qt.

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.

This repository contains my solutions to the assignments of the course CSE-318 | Artificial Intelligence.

Larger scope projects.

Backing up codes I wrote, during my Artificial Intelligence course.

A route planner that can find a path between any two points on a real map of a real city using io2d library , google teste library for testing and pugixml for parsing xml files from open street map data to the project.

This is a C++ implementation of A* search algorithm, referenced from Udacity.

This code solves the 8 puzzle problem with A star algorithm.

Проект по предметот Компјутерска графика на ФИНКИ - Имплементација на А* алгоритмот во C++ и OpenGL.

Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET

A* algorithm-based route planner built in C++ using IO2D library (Udacity C++ Nanodegree).

A program in C++ that creates a pseudo-random Rubik Cube and tries to solve it using the A* Algorithm.