<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
  This ontology document is licensed under the Creative Commons
  Attribution License. To view a copy of this license, visit
  http://creativecommons.org/licenses/by/2.0/ or send a letter to
  Creative Commons, 559 Nathan Abbott Way, Stanford, California
  94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu/tag/planning/">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <image rdf:resource="http://ebiquity.umbc.edu/img/logo.jpg" />  <title><![CDATA[RSS Tag Search]]></title>
  <link>http://ebiquity.umbc.edu/tag/planning/</link>
  <description><![CDATA[RSS Tag Search]]></description>
  <items>
   <rdf:Seq>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/472/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems-"/>
    <rdf:li resource="http://ebiquity.umbc.edu/resource/html/id/277/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems"/>
    <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/389/Solution-Border-Estimation-for-Efficient-Analysis-of-Plan-Space"/>
    <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/307/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems"/>
    <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/294/Efficient-Planning-Using-Plan-Libraries-to-Capture-the-Structure-of-the-State-Space"/>
    <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/269/Generating-Libraries-for-Rapid-Wireless-Sensor-Network-Reconfiguration-"/>
   </rdf:Seq>
  </items>
 </channel>
 <image rdf:about="http://ebiquity.umbc.edu/img/logo.jpg">
  <title>UMBC ebiquity research group</title>
  <link>http://ebiquity.umbc.edu</link>
  <url>http://ebiquity.umbc.edu/img/logo.jpg</url>
 </image>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/472/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems-">
  <title><![CDATA[Problem Space Analysis for Plan Library Generation and Algorithm Selection in  Real-time Systems]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/472/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems-</link>
  <description><![CDATA[Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include. Strategic selections will ensure that the library contains an appropriate plan for encountered situations.  This work discusses preliminary investigations into a scheme ...]]></description>
  <dc:date>2010-05-19</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/resource/html/id/277/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems">
  <title><![CDATA[Problem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systems]]></title>
  <link>http://ebiquity.umbc.edu/resource/html/id/277/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems</link>
  <description><![CDATA[Ph.D. Preliminary Exam

Computing solutions to intractable planning problems is particularly problematic within real-time domains.  Many visitation planning problems can be mapped to a Dynamic Vehicle Routing Problem (DVRP), in which a system uses a set of vehicles to visit a set of potentially changing locations.  One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a system must choose ...]]></description>
  <dc:date>2009-08-26</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/389/Solution-Border-Estimation-for-Efficient-Analysis-of-Plan-Space">
  <title><![CDATA[Solution Border Estimation for Efficient Analysis of Plan Space]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/389/Solution-Border-Estimation-for-Efficient-Analysis-of-Plan-Space</link>
  <description><![CDATA[Problem Space Analysis allows a planner to find patterns within the characteristics of problem scenarios that may be encountered in the near future.  One component of such analysis, the problem-space map (PS Map), identifies groups problems that a particular solution can resolve.  An ideal PS Map allows a system to preemptively plan for future scenarios, but is generally prohibitively expensive to compute.  This talk will give an overview of problem space analysis, discuss the Solution Border...]]></description>
  <dc:date>2011-04-05</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/307/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems">
  <title><![CDATA[Problem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systems]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/307/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems</link>
  <description><![CDATA[﻿﻿Ph.D. Preliminary Exam

Computing solutions to intractable planning problems is particularly problematic within real-time domains.  Many visitation planning problems can be mapped to a Dynamic Vehicle Routing Problem (DVRP), in which a system uses a set of vehicles to visit a set of potentially changing locations.  One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a system must c...]]></description>
  <dc:date>2009-08-26</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/294/Efficient-Planning-Using-Plan-Libraries-to-Capture-the-Structure-of-the-State-Space">
  <title><![CDATA[Efficient Planning Using Plan Libraries to Capture the Structure of the State Space]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/294/Efficient-Planning-Using-Plan-Libraries-to-Capture-the-Structure-of-the-State-Space</link>
  <description><![CDATA[Ph.D. Dissertation Defense

Automated, domain-independent planning is a research area within Artificial Intelligence that is used in a variety of practical applications, especially those for which a large degree of autonomy is required. Planning programs that are given information about the current state of the world, the available actions, and a set of goals that should be achieved. The planner's task is determining the plan: a set of actions and ordering constraints among them. A domain-i...]]></description>
  <dc:date>2009-04-29</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/269/Generating-Libraries-for-Rapid-Wireless-Sensor-Network-Reconfiguration-">
  <title><![CDATA[Generating Libraries for Rapid Wireless Sensor Network Reconfiguration]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/269/Generating-Libraries-for-Rapid-Wireless-Sensor-Network-Reconfiguration-</link>
  <description><![CDATA[This talk discusses early research in the creation of libraries
for rapid wireless sensor network (WSN) reconfiguration.
Appropriate reconfiguration allows the WSN to save energy while
tracking a target. If the target moves slowly enough, the WSN can
successfully reconfigure itself during runtime.  However, a
fast-moving target forces the WSN to use more energy or risk
losing track of the target.

Our research explores the precomputation of libraries such that a
WSN can quickly choos...]]></description>
  <dc:date>2008-10-21</dc:date>
 </item>
</rdf:RDF>

