<node id="588777">
  <nid>588777</nid>
  <type>event</type>
  <uid>
    <user id="28475"><![CDATA[28475]]></user>
  </uid>
  <created>1489525583</created>
  <changed>1489525583</changed>
  <title><![CDATA[Ph.D. Dissertation Defense - Matthew Hale]]></title>
  <body><![CDATA[<p><strong>itle</strong><em>:&nbsp; </em><em>Mixed Centralized/Decentralized Coordination Protocols for Multi-agent Systems</em></p>

<p><strong>Committee:</strong></p>

<p>Dr. Magnus Egerstedt, ECE, Chair , Advisor</p>

<p>Dr. Yorai Wardi, ECE, Co-Advisor</p>

<p>Dr. Aaron Ames, ECE</p>

<p>Dr. Jeff Shamma, ECE</p>

<p>Dr. Mark Davenport, ECE</p>

<p>Dr. Eric Feron, AE</p>

<p><strong>Abstract: </strong></p>

<p>The objective of this research is to develop coordination strategies&nbsp;for multi-agent systems that use a mixture of centralized and&nbsp;decentralized architectures and algorithms. Conventionally, centralized&nbsp;and decentralized methods are regarded as distinct paradigms,&nbsp;each with its own features and drawbacks, and multi-agent coordination&nbsp;algorithms are typically classified as being exclusively one or the other.&nbsp;However, emerging technologies such as cloud computing make it feasible to&nbsp;incorporate some centralization into an otherwise decentralized system,&nbsp;and one may ask how to embrace this mix of centralized and decentralized&nbsp;information that is rapidly being integrated into various systems such as the smart power grid, teams of robots, and cyber-physical systems.&nbsp;To address this question, two problem domains are considered. The first&nbsp;is that of asynchronous coordination, in which agents generate and share&nbsp;information with arbitrary timing. The second concerns private&nbsp;coordination, in which teams of agents must work together without&nbsp;revealing sensitive information. In both cases, the mixture of&nbsp;centralized and decentralized information enables successful coordination&nbsp;despite the challenges imposed by asynchrony and privacy, and theoretical&nbsp;performance guarantees are derived in both cases. Complementing these&nbsp;theoretical developments, robotic experiments are included that demonstrate&nbsp;the utility of these algorithms in practice.&nbsp;</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Mixed Centralized/Decentralized Coordination Protocols for Multi-agent Systems]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2017-03-29T13:00:00-04:00]]></value>
      <value2><![CDATA[2017-03-29T15: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[]]></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>434381</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ECE Ph.D. Dissertation Defenses]]></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>
          <item>
        <tid>1808</tid>
        <value><![CDATA[graduate students]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
