Past Projects
Chaos Playground
Pursuit-evasion games are strategic contests between two or more entities, where one side (the pursuer) aims to capture or reach a target, while the other side (the evader) seeks to avoid capture or elude pursuit. These games are commonly found in military, law, gaming, and even biological contexts, showcasing complex tactics, resource management, and decision-making under uncertainty. They often involve dynamic interactions and can be analyzed using game theory and optimization techniques.
We analyze these games using nonlinear control mechanisms like Model Predictive Control (MPC), Linear Quadratic Regulator (LQR) and Reinforcement Learning (RL).
Conceptualization and Design of Permutation Puzzles
This project involves study and investigation of design and solutions of Permutation Puzzles. The primary motivation stems from Cayley’s theorem of Group Theory which states that every group is isomorphic to a Permutation Group. Hence, by analyzing Permutation Puzzles we aimed at developing a generalized mathematical framework for implementation of novel mechanical puzzle structures akin to the well-known Rubik’s Cube, 15-Puzzle etc.
DiceForge
DiceForge is an open source library written in C++ from scratch with the aim of providing fast, efficient, easy to use methods similar to those of python’s random library for pseudo-random number generation , discrete and continuous probability distribution sampling and fitting experimental data to those distributions. DiceForge is on average 8 times faster than C++’s standard library and 400 times faster than python’s random library. The pseudo-random number generators were tested rigorously using a series of Dieharder tests.
Heuristic Tourist
Under this project we solved the very famous Travelling Salesman Problem using a deterministic heuristical algorithm which runs in O(nlogn) called Polar optimisation. The algorithm initially focuses on minimising angular distances and then later improves the convexity of the figure. It outperforms as well as runs much faster than traditional approximation algorithms like the simulated annealing.