Neal Ramaswamy

Neal Ramaswamy

CS/CSE Student

Posts by Tags

CHOMP

Inverse Kinematics

Kinematics

Model Predictive Control

algorithms

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!

automation

computer science

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!

computer-science

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.

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!

control-theory

diffusion-models

Diffusion Policy

3 minute read

Published:

Article Goal

Explain Diffusion Policy algorithm for visuomotor policy learning in robotics

dynamic planning

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.

engineering

Kalman Filter

3 minute read

Published:

Article Goal

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

feedback-control

graph theory

A*

5 minute read

Published:

Article Goal

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

graph-theory

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!

imitation-learning

Diffusion Policy

3 minute read

Published:

Article Goal

Explain Diffusion Policy algorithm for visuomotor policy learning in robotics

kalman-filter

Kalman Filter

3 minute read

Published:

Article Goal

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

machine-learning

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

model-predictive-control

motion planning

neural-networks

Neural RRT*

3 minute read

Published:

Article Goal

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

optimal

Fast Marching Trees (FMT*)

3 minute read

Published:

Article Goal

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

optimal-filtering

Kalman Filter

3 minute read

Published:

Article Goal

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

optimization

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.

path-planning

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.

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!

pathfinding

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!

pid-controller

robotics

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.

sampling-based

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.

sensor-fusion

Kalman Filter

3 minute read

Published:

Article Goal

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

state-estimation

Kalman Filter

3 minute read

Published:

Article Goal

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

trajectory-optimization