<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-20T11:23:12Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/121986" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/121986</identifier>
        <datestamp>2024-03-01</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Driggs-Campbell, Katherine R</dc:contributor>
          <dc:date>2023-12</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:language>en</dc:language>
          <dc:type>text</dc:type>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms</dc:description>
          <dc:description>The student, Andre Schreiber, accepted the attached license on 2023-11-13 at 18:00.</dc:description>
          <dc:description>The student, Andre Schreiber, submitted this Thesis for approval on 2023-11-13 at 18:11.</dc:description>
          <dc:description>This Thesis was approved for publication on 2023-11-14 at 10:57.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #19918 on 2024-03-01 at 13:14:31</dc:description>
          <dc:title>Weakly-supervised traversability estimation for mobile robots using sparse point annotation</dc:title>
          <dc:creator>Schreiber, Andre Maurice</dc:creator>
          <dc:subject>Mobile Robots</dc:subject>
          <dc:subject>Field Robotics</dc:subject>
          <dc:subject>Traversability</dc:subject>
          <dc:subject>Weak Supervision</dc:subject>
          <dc:date>2023-11-14</dc:date>
          <dc:description>The task of traversability estimation is of key importance for mobile robots operating in unstructured environments. Such mobile robots need to be able to correctly predict where they can and cannot travel in order to ensure that they do not damage their environment or themselves. However, existing methods for estimating traversability in mobile robotics applications have significant limitations, as they can involve significant labeling tedium or require a robot to experience conditions of interest in order to label them. To overcome some of these challenges, we propose a weakly-supervised framework for traversability estimation in unstructured environments. Our framework uses sparse annotations to reduce labeling tedium, and we combine prior methods for weakly-supervised learning with a neural network-guided sampling strategy in order to improve results on our traversability prediction task. Our method demonstrates accuracy approaching that of the strongly-supervised approach, while significantly reducing labeling burden. Even though our initial proposed sparse annotation strategy demonstrates performance comparable to the strongly-supervised method with significantly reduced labeling effort, it can fail in cases of isolated, small obstacles. To address this issue, we propose a sampling strategy that explicitly emphasizes traversable regions and obstacles, and we demonstrate that this method can significantly improve prediction quality for small but untraversable obstacles.</dc:description>
          <dc:type>Text</dc:type>
          <dc:language>eng</dc:language>
          <dc:identifier>https://hdl.handle.net/2142/121986</dc:identifier>
          <dc:rights>Copyright 2023 Andre Maurice Schreiber</dc:rights>
          <degree>
            <name>M.S.</name>
            <level>Thesis</level>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <department>Electrical &amp; Computer Eng</department>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
