<node id="627123">
  <nid>627123</nid>
  <type>event</type>
  <uid>
    <user id="28475"><![CDATA[28475]]></user>
  </uid>
  <created>1570133871</created>
  <changed>1570135495</changed>
  <title><![CDATA[Andrew Price Thesis Defense]]></title>
  <body><![CDATA[<p><strong>Committee Members:</strong></p>

<p>Professor Henrik Christensen (Advisor), ECE &amp; UCSD</p>

<p>Stephen Balakirsky, PhD - GTRI</p>

<p>Professor Patricio Vela - ECE</p>

<p>Professor Aaron Ames - CalTech</p>

<p>Professor Dmitry Berenson - University of Michigan</p>

<p><strong>Abstract:</strong></p>

<p>This document introduces a novel technique for addressing the fragility of solutions that is common to configuration space-based planners. Both the state and the pre- and post-conditions of actions are represented as volumes of the configuration space. Feasibility of the various action types is determined by a subset test: if the set of possible states is a subset of the pre-condition set of a given action, then that action is feasible. This system is then incorporated into a planning system which is demonstrated on a number of household, scientific, and industrial application domains.</p>

<p>In the development of this framework, we build off of the idea of affordances: a high-level technique for reasoning about the space of latent action possibilities between an agent and its environment. In the language of affordances, our contributions are as follows:</p>

<p>* We formalize the computational notion of an affordance by introducing a set-based formulation of action pre-conditions and post-conditions.</p>

<p>* We define the feasibility of an action as an inclusion predicate between convex sets representing the possible system configuration and the parameterized action pre-conditions.</p>

<p>* We introduce a novel planning algorithm incorporating the previous contributions to jointly reason over information gathering and state transformation.</p>

<p>* We demonstrate the proposed system on a variety of simulated and real scenarios derived from household, scientific research, and industrial application domains.</p>

<p>This approach has a number of indirect benefits as well. First, the definition of action predicate sets depends on deep knowledge of the agent in question; as a result, the affordance representation specializes to a variety of agents while requiring only commonly-used mechanical and kinematic parameters. Second, as actions may serve to expand or contract the belief state, information-gathering actions may be planned without the need for e.g. a bespoke entropy minimization framework.</p>

<p>These benefits do incur some trade-offs, however. An explicit enumeration of possible actions is required, as are detailed models of their input-output behavior. These models may be developed from existing theory, via simulation, or by physical experimentation. In principle, such models could be discovered by self-experimentation or learning from demonstration, but these techniques are outside the scope of this work.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Set Predicates for Planning with Robot Capabilities and Affordances]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2019-10-16T15:00:00-04:00]]></value>
      <value2><![CDATA[2019-10-16T17: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>
