<node id="691891">
  <nid>691891</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1787583083</created>
  <changed>1787583160</changed>
  <title><![CDATA[PhD Proposal by Utkarsh A. Mishra]]></title>
  <body><![CDATA[<p><strong>Title:</strong> Compositional Generative Modeling for Robotic Planning and Control</p><p><strong>Date:</strong> Tuesday, September 1st, 2026</p><p><strong>Time:</strong> 9:00 AM to 10:30 AM ET</p><p>&nbsp;</p><p><strong>In-person Location:</strong>&nbsp;CODA C0903 Midtown</p><p><strong>Zoom:</strong>&nbsp;<a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgatech.zoom.us%2Fj%2F97270969399%3Fpwd%3DXTTOoLyDVa6w8xOKXcTYLmq6I5YueA.1&amp;data=05%7C02%7Cannouncements%40grad.gatech.edu%7C3e83054f9331437fb8a508df01e85fc0%7C482198bbae7b4b258b7a6d7f32faa083%7C1%7C0%7C639231769676923864%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&amp;sdata=sB%2FsJyHmMHUtuMMzbj6Ie%2F0kJb%2FVRNj6Z1oe8ro72gI%3D&amp;reserved=0">https://gatech.zoom.us/j/97270969399?pwd=XTTOoLyDVa6w8xOKXcTYLmq6I5YueA.1</a></p><p>&nbsp;</p><p><strong>Utkarsh Aashu Mishra</strong></p><p>Ph.D. Student<br>Institute for Robotics &amp; Intelligent Machines&nbsp;<br>Georgia Institute of Technology</p><p>&nbsp;</p><p><strong>Committee:</strong></p><p>Dr. Yongxin Chen (advisor) -- Daniel Guggenheim School of Aerospace Engineering, Georgia Institute of Technology</p><p>Dr. Danfei Xu (advisor) -- School of Interactive Computing, Georgia Institute of Technology</p><p>Dr. Harish Ravichandar -- School of Interactive Computing, Georgia Institute of Technology</p><p>Dr. Leslie Pack Kaelbling -- Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology</p><p>Dr. Yilun Du -- School of Engineering and Applied Sciences, Harvard University</p><p>&nbsp;</p><p><strong>Abstract:</strong></p><p>Long-horizon manipulation requires planning for many interdependent actions in sequence to satisfy a goal condition. Current robot-learning methods are limited along three axes: (a) Data: whole-task demonstrations are combinatorially expensive, so monolithic policies do not scale. (b) Inter-step dependencies: a locally optimal early action can make a later step infeasible, and errors compound. (c) Partial observability: an open-world scene is not fully known at planning time. The first part of this proposal develops a long-horizon planning framework that learns distributions of short-horizon behaviors using generative models and composes them at inference to generate long-horizon plans. The compositional generative modeling reasons about inter-step dependencies and goal reaching without any whole-task demonstrations. The second part extends this framework toward open-world planning along two directions: (i) it explores the compositional generalization of short-horizon models trained on a diverse set of real-world, manipulation-rich behaviors, and (ii) it adds a verification harness, an independent symbolic-geometric verifier that checks whether a proposed plan is geometrically executable before execution. Across both axes, the objective is to build a reliable framework that can replan and sufficiently generalize across behaviors and planning horizon: a composed plan should be a plausible real-world future prediction while satisfying the long-horizon goal under inter-step constraints.</p><p>&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Compositional Generative Modeling for Robotic Planning and Control]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Compositional Generative Modeling for Robotic Planning and Control</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2026-09-01T09:00:00-04:00]]></value>
      <value2><![CDATA[2026-09-01T10:30:11-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[CODA C0903 Midtown]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
