<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Shrenik Muralidhar</title>
    <link>https://shrenikm.com/</link>
    <description>Posts for when I feel like it</description>
    <language>en-us</language>
    <lastBuildDate>Thu, 26 Jun 2025 07:57:00 GMT</lastBuildDate>
    <atom:link href="https://shrenikm.com/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Reference: Behavior Cloning for Manipulation</title>
      <link>https://shrenikm.com/posts/2025-05-17-reference-behavior-cloning-for-manipulation/</link>
      <guid>https://shrenikm.com/posts/2025-05-17-reference-behavior-cloning-for-manipulation/</guid>
      <pubDate>Thu, 26 Jun 2025 07:57:00 GMT</pubDate>
      <description>Hello, it&apos;s time for my yearly post! The goal of this one is to be a handy reference for behavior cloning as applied to manipulation -- something I&apos;ve been spending quite a bit of time on over the past 6-9 months. The field has been progressing at an absurdly rapid pace of late (somehow we&apos;re at a point where robots can do laundry), so I thought it&apos;d be a good…</description>
    </item>
    <item>
      <title>ZMP: Generating Bipedal Walking Trajectories</title>
      <link>https://shrenikm.com/posts/2024-04-03-zmp-generating-bipedal-walking-trajectories/</link>
      <guid>https://shrenikm.com/posts/2024-04-03-zmp-generating-bipedal-walking-trajectories/</guid>
      <pubDate>Thu, 04 Apr 2024 05:31:49 GMT</pubDate>
      <description>Legged robot research has been an active area of study since the late nineties. Let&apos;s take a look at how we can generate walking trajectories for bipedal robots, using some of these ideas. The Objective: Implement a quick and dirty way of generating walking trajectories Constraints: Do it quickly. Minimize sophistication. Anything goes! What this post will cover: 1. Overview of the minimal set of ideas required to develop walking…</description>
    </item>
    <item>
      <title>Setting Up a Robotic Manipulator</title>
      <link>https://shrenikm.com/posts/2024-03-08-setting-up-a-manipulator/</link>
      <guid>https://shrenikm.com/posts/2024-03-08-setting-up-a-manipulator/</guid>
      <pubDate>Sat, 09 Mar 2024 06:11:21 GMT</pubDate>
      <description>Let&apos;s take a look at how we can set up a framework for streamlined simulation and hardware control of a manipulator. The robot under consideration is Ufactory&apos;s Lite6 manipulator and the simulation/setup tool used is Drake. All the code used in this post can be found in my repo. But before we start, some explanations are in order. Lite6? The Lite6 is one of the more economical (not to be…</description>
    </item>
    <item>
      <title>Understanding TrajOpt</title>
      <link>https://shrenikm.com/posts/2024-01-06-understanding-trajopt/</link>
      <guid>https://shrenikm.com/posts/2024-01-06-understanding-trajopt/</guid>
      <pubDate>Sat, 06 Jan 2024 19:11:12 GMT</pubDate>
      <description>TrajOpt is an optimization based approach for motion planning. More specifically, it uses a sequential convex optimization procedure along with a formulation of collision constraints to find locally optimal planning trajectories, even for robotic systems that have a large number of degrees of freedom. This post will go into the details of the optimization part, and give an outline of how it can be implemented. My implementation can be found…</description>
    </item>
    <item>
      <title>Multi Vehicle Mixed Integer Programming</title>
      <link>https://shrenikm.com/posts/2023-12-24-multi-vehicle-mixed-integer-programming/</link>
      <guid>https://shrenikm.com/posts/2023-12-24-multi-vehicle-mixed-integer-programming/</guid>
      <pubDate>Mon, 25 Dec 2023 02:54:32 GMT</pubDate>
      <description>In this post, we take a look at this paper, which introduces a simple, yet interesting approach to solving a multi-vehicle path planning problem. My implementation of the algorithm that was used to evaluate its performance and generate all the results in this post can be found here Problem The paper tries to tackle the issue of finding fuel optimal paths for multiple vehicles, given vehicle-obstacle and vehicle-vehicle collision constraints.…</description>
    </item>
    <item>
      <title>Implicit Euler integration using Newton-Raphson</title>
      <link>https://shrenikm.com/posts/2021-09-25-implicit-euler-integration-using-newton-raphson/</link>
      <guid>https://shrenikm.com/posts/2021-09-25-implicit-euler-integration-using-newton-raphson/</guid>
      <pubDate>Sun, 26 Sep 2021 03:11:57 GMT</pubDate>
      <description>We take a look at the implicit or backward Euler integration scheme for computing numerical solutions of ordinary differential equations. We will go over the process of integrating using the backward Euler method and make comparisons to the more well known forward Euler method. Numerical integration is extremely important when it comes to simulating real world physical systems. For robotic systems, we usually have a continuous time state dynamics that…</description>
    </item>
    <item>
      <title>Injective linear transformations</title>
      <link>https://shrenikm.com/posts/2021-09-20-injective-linear-transformations/</link>
      <guid>https://shrenikm.com/posts/2021-09-20-injective-linear-transformations/</guid>
      <pubDate>Mon, 20 Sep 2021 08:02:55 GMT</pubDate>
      <description>In this post, we take a look at some characteristics of injective linear transformations. Let be a linear transformation from some vector space to another vector space , both defined over a field . being injective, means that no two vectors in can be mapped to the same vector in . We have a one-to-one mapping between the vectors in and their images in . What does the null space…</description>
    </item>
    <item>
      <title>Change of basis</title>
      <link>https://shrenikm.com/posts/2021-09-06-change-of-basis/</link>
      <guid>https://shrenikm.com/posts/2021-09-06-change-of-basis/</guid>
      <pubDate>Tue, 07 Sep 2021 05:32:43 GMT</pubDate>
      <description>We look into the problem of expressing a vector , whose coordinates relative to some basis is known, through the coordinates relative to a different basis. Let&apos;s assume that lies in an dimensional vector space defined over the field . Let and be two different sets of basis vectors containing the vectors and respectively. Let represent the coordinates of with respect to the basis . Now, how do we go…</description>
    </item>
    <item>
      <title>Dimension of a proper subspace</title>
      <link>https://shrenikm.com/posts/2021-08-29-dimension-of-a-proper-subspace/</link>
      <guid>https://shrenikm.com/posts/2021-08-29-dimension-of-a-proper-subspace/</guid>
      <pubDate>Sun, 29 Aug 2021 17:20:38 GMT</pubDate>
      <description>Let be a finite dimensional vector space over the field , with . We also define the ordered basis for to be . Consider a subspace of the vector space . Naturally, we have . This is because for any , we have , which can then be expressed as a linear combination of the basis vectors in . Hence, we don&apos;t require more than linearly independent vectors to represent…</description>
    </item>
  </channel>
</rss>