Rohit's Projects
Implementation of A* Algorithm to find a path between start and end point on a given map for a robot
Implementation A* algorithm for turtlebot in 2D and 3D(ROS-Gazebo)
Design and implement LQR, LQG controller & Luenberger observer for two load crane
Udacity - Data structures and algorithms - Problems and solutions
Implementation of Dijkstra algorithm for a Point Robot
An industrial robot is tasked to fill up boxes with parts. All parts are of the same type. Boxes come in four different sizes: Small (S), medium (M), large (L), and extra large (XL).
Forward and Inverse Kinematics and dynamics of KUKA and PUMA robots
Solutions for LeetCode problems
Micromouse is an event where small robot mice solve a 16Ć16 maze. The mouse needs to keep track of where it is, discover walls as it explores the maze, and map out the maze and detect when it has reached the goal. Once the optimal route has been found, the mouse will run that route in the shortest possible time.
7th December
Public profile repository
Website: