<node id="691798">
  <nid>691798</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1787150278</created>
  <changed>1787150310</changed>
  <title><![CDATA[PhD Defense by Zhiyuan Zhang]]></title>
  <body><![CDATA[<p><strong>Title</strong>: Real-Time Game-Theoretic Control for Autonomous Racing and Driving</p><p>&nbsp;</p><p><strong>Date</strong>: Thursday, August 20th, 2026</p><p><strong>Time</strong>: 2PM ET</p><p><strong>Location</strong>: Montgomery Knight 325 or <a href="https://teams.microsoft.com/l/meetup-join/19%3ameeting_MjU1NjQ5NTEtNzE1ZS00ZjNjLWI5MzAtNzVmYzVkODE2ZWMz%40thread.v2/0?context=%7b%22Tid%22%3a%22482198bb-ae7b-4b25-8b7a-6d7f32faa083%22%2c%22Oid%22%3a%225e1db3a7-5d3c-4296-aaed-6758d9dfa883%22%7d" title="https://teams.microsoft.com/l/meetup-join/19%3ameeting_MjU1NjQ5NTEtNzE1ZS00ZjNjLWI5MzAtNzVmYzVkODE2ZWMz%40thread.v2/0?context=%7b%22Tid%22%3a%22482198bb-ae7b-4b25-8b7a-6d7f32faa083%22%2c%22Oid%22%3a%225e1db3a7-5d3c-4296-aaed-6758d9dfa883%22%7d">Teams</a></p><p>&nbsp;</p><p><strong>Zhiyuan Zhang</strong></p><p>Robotics Ph.D. Candidate</p><p>Daniel Guggenheim School of Aerospace Engineering</p><p>Georgia Institute of Technology</p><p>&nbsp;</p><p><strong>Committee</strong>:</p><p>Dr. Panagiotis Tsiotras (advisor) – School of Aerospace Engineering, Georgia Institute of Technology</p><p>Dr. Kyriakos Vamvoudakis – School of Aerospace Engineering, School of Electrical and Computer Engineering, Georgia Institute of Technology</p><p>Dr. Yongxin Chen– School of Aerospace Engineering, Georgia Institute of Technology</p><p>Dr. Glen Chou – &nbsp;School of Cybersecurity &amp; Privacy, Georgia Institute of Technology</p><p>Dr. Sarah Li – School of Aerospace Engineering, Georgia Institute of Technology</p><p>&nbsp;</p><p><strong>Abstract</strong>:</p><p>Existing dynamic-game solvers can achieve promising practical performance by solving the first-order optimality conditions of a GNE. However, these methods face several challenges: they must operate within real-time control budgets, may converge to non-equilibrium saddle points, and typically return only one of several possible local equilibria.</p><p>&nbsp;</p><p>This dissertation develops computational methods addressing these limitations. It introduces structured Newton and residual-descent solvers that exploit temporal sparsity and active constraints; an inertia-based method for efficiently verifying second-order optimality; and structural modifications that reduce attraction to saddle-type stationary points. It further develops an operator-splitting method that exploits near-potential game structure to accelerate equilibrium computation, as well as a particle-based framework for representing multiple equilibria and coordinating among them through Bayesian belief updates. The proposed methods are evaluated through numerical benchmarks and physical multi-vehicle experiments using the BuzzRacer autonomous racing platform, demonstrating real-time game-theoretic planning in tightly constrained and strategically interactive scenarios.</p><p>&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Real-Time Game-Theoretic Control for Autonomous Racing and Driving]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Real-Time Game-Theoretic Control for Autonomous Racing and Driving</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2026-08-20T14:00:00-04:00]]></value>
      <value2><![CDATA[2026-08-20T16:00:00-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>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[Montgomery Knight 325 or Teams]]></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>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
