<node id="659297">
  <nid>659297</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1657207767</created>
  <changed>1657207767</changed>
  <title><![CDATA[PhD Defense by Matthew Abate]]></title>
  <body><![CDATA[<p><strong>Title:</strong>&nbsp;Efficient Prediction for Dynamical Systems with Applications to Robust Safe Autonomy</p>

<p>&nbsp;</p>

<p><strong>Date:</strong> Tuesday July 19th 2022</p>

<p><strong>Time:</strong> 1:30 - 3:30 pm ET</p>

<p><strong>Location:</strong> TSRB 523</p>

<p>&nbsp;</p>

<p><strong>Matthew Abate</strong></p>

<p>Robotics PhD Candidate</p>

<p>School of Mechanical Engineering</p>

<p>Georgia Institute of Technology</p>

<p>&nbsp;</p>

<p><strong>Committee</strong></p>

<p>Dr. Samuel Coogan (Advisor) - Department of Eletrical and Computer Engineering, Georgia Tech</p>

<p>Dr. Eric Feron (Advisor) -&nbsp;Division of&nbsp;Computer, Electrical and Mathematical Sciences and Engineering, KAUST</p>

<p>Dr.&nbsp;Matthieu Bloch - Department of Eletrical and Computer Engineering, Georgia Tech<br />
Dr.&nbsp;Panagiotis Tsiotras - Department of Aerospace Engineering, Georgia Tech<br />
Dr. Yorai Wardi - Department of Eletrical and Computer Engineering, Georgia Tech</p>

<p>&nbsp;</p>

<p><strong>Summary&nbsp;</strong></p>

<p>Reachability analysis of control systems plays a crucial role in system verification and controller synthesis. However, many reachability techniques fall short, being only applicable to certain classes of systems or too computationally burdensome for real-time applications. The subject of this thesis is the mixed monotonicity property of dynamical systems which is known to be a general property and which provides a computationally efficient technique for over-approximating reachable sets using hyperrectangles. Specifically, the mixed monotonicity of a dynamical system is tied to the existence of a related decomposition function that separates the system&#39;s vector field into cooperative and competitive state interactions. Reachable sets for the mixed monotone system can then be computed simply using a decomposition function and foundational results from monotone dynamical systems theory.&nbsp;</p>

<p>&nbsp;</p>

<p>In this thesis, we establish that all continuous-time dynamical systems bearing a locally Lipschitz continuous vector field are mixed monotone and we provide a construction for the unique tight decomposition function of a dynamical system that attains the tightest possible over-approximations of reachable sets. We then provide a suite of new analysis tools for mixed monotone systems that can be applied to attain, for example, over- and under-approximations of both forward- and backward-time reachable sets, and also robustly forward invariant sets. &nbsp;As a final point, we study conservatism in mixed monotone reachable set approximations, and we provide new tools for reducing conservatism using, for example, the decomposition function of a separate dynamical system, formed via a transformation of the initial system&#39;s vector field. &nbsp;We conclude with a case study of a seven-dimensional spacecraft system and a hardware demonstration of in-the-loop reachability analysis and enforced system safety. &nbsp;Numerous illustrative numerical examples are also provided.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Efficient Prediction for Dynamical Systems with Applications to Robust Safe Autonomy ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2022-07-19T14:30:00-04:00]]></value>
      <value2><![CDATA[2022-07-19T16:30: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[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></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>
