H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)

Notebook for quick search

A cool project in which we do path planning in an environment with moving obstacles and large scale fixed obstacles. We use two different representations of the world to handle the fixed and moving obstacles.

The differential drive has an ESP32 board for wireless connectivity a Client-Server network is established between the server laptop and client ESP to transmit the coordinates to the robot. An overhead camera is used to visually survey the obstacle course and image processing is used to segment the obstacles and the robot from the captured image…

This repository contains my Implementation of hybrid A star for a vehicle with Ackerman steering to perform complex parking maneuvers in tight parking spaces

Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics

A* graph-search algorithm for solving 2x2x2 Rubik's Cube.

Planning Project Implementation for the Udacity Artificial Intelligence Nanodegree Program

Code and notes for the Stanford Algorithms Specialization course.

Problem Solving With AI Approaches: Heuristic Searches, Statistical Classifications

Reply Code Challenge 2019 writeup.

n-dimensional A* Graph Search

The Cogito Cube Solver project aims to develop an AI-driven solution for solving the Rubik's cube by combining traditional algorithms like 3BLD and Domino Reduction with advanced machine learning techniques

Patient Priority Management System is a Python-based project that prioritizes patient care based on illness severity, age, and arrival time using a min-heap priority queue, graph traversal for room allocation, and a binary search tree for efficient patient lookup. The system ensures optimal patient flow and room allocation in healthcare facilities.

This is the backend for a RAG system that runs on Docker Compose. It registers documents in a wide range of file formats, which can be searched using the MCP server.

Implementation of search algorithms from CS50's Introduction to Artificial Intelligence - includes DFS, BFS maze solvers with visual comparisons

A visual tool for understanding the A* search algorithm. This project demonstrates the algorithm’s step-by-step pathfinding process using a graphical interface built in Python. It’s perfect for educational purposes and for anyone looking to explore efficient graph traversal techniques.

This repository consists of my implementations of various graph search and sampling based path planning algorithms

Maze generation and path finding using graph search and divide and conquer algorithms.

Simulation of a social network in a graph developed as the final project of the second module of the Let's Code Data Science course