Neal Ramaswamy

Neal Ramaswamy

CS/CSE Student

Posts by Category

motion-planning

Kalman Filter

3 minute read

Published:

Article Goal

Explain the Kalman Filter algorithm for optimal state estimation in “noisy” dynamic systems

Diffusion Policy

3 minute read

Published:

Article Goal

Explain Diffusion Policy algorithm for visuomotor policy learning in robotics

Neural RRT*

3 minute read

Published:

Article Goal

Explain Neural RRT* (Neural Rapidly-exploring Random Tree Star) algorithm for learning-based optimal path planning

Fast Marching Trees (FMT*)

3 minute read

Published:

Article Goal

Explain FMT* (Fast Marching Tree) algorithm for optimal motion planning

RRT*

4 minute read

Published:

Article Goal

Explain in the most straightforward way how RRT* (Rapidly-exploring Random Tree Star) works. This is an asymptotically optimal variant of RRT that continuously improves path quality through rewiring.

RRT

3 minute read

Published:

Article Goal

Explain in the most straightforward way how RRT (Rapidly-exploring Random Tree) works. This sampling-based algorithm is widely used in robotics and autonomous systems for path planning in complex environments.

D* (Unfinished)

1 minute read

Published:

Article Goal

Explain in the most straightforward way how D*’s Algorithm works and why it’s essential for dynamic pathfinding.

A*

5 minute read

Published:

Article Goal

Explain in the most straightforward way how A*’s Algorithm works. Diagrams included!

Dijkstra’s Algorithm:

2 minute read

Published:

Article Goal

Explain in the most straightforward way how Dijkstra’s Algorithm works (With cool diagrams!). This is my first time writing and I figured this would be a fun way to get started!

projects