<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-20T08:12:05Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/46108" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/46108</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Nicholas Roy.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Gordeski, Valerie</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-06-30T17:18:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-06-30T17:18:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/46108</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">388032408</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 75-78).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis proposes a novel structure for robotic navigation with minimal sensing abilities called the Probabilistic Gap Navigation Tree (PGNT). In this navigation approach, we create a topological map of the environment based on a previously created Gap Navigation Tree (GNT) [40]. The "gap" in the gap navigation algorithm represents a discontinuity in the robotic field of vision. The robot is able to use the gaps to represent its world as a tree structure (GNT), in which each vertex corresponds to a gap. Ideally, the robot navigates in the world by following the tree branches to its desired goal. However, due to the sensor uncertainty, the robot may detect discontinuities when there are none present, and vice versa. The Probabilistic Gap Navigation Tree compensates for the measurement noise by sampling from a distribution of the gap navigation trees to obtain the most likely tree given the sensor measurements, similar to the particle filtering algorithm used in Monte Carlo localization. Therefore, the PGNT allows navigation in an unknown environment using a realistic range finder, as opposed to the ideal sensor model assumed previously. We demonstrate the ability to build a PGNT in a simulated environment.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Valerie Gordeski.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">78 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Topological mapping for limited sensing mobile robots using the Probabilistic Gap Navigation Tree</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="27e9f1ac-83b0-4d25-9098-d2fc64710537">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Topological mapping for limited sensing mobile robots using the Probabilistic Gap Navigation Tree&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Gordeski, Valerie&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>This thesis proposes a novel structure for robotic navigation with minimal sensing abilities called the Probabilistic Gap Navigation Tree (PGNT). In this navigation approach, we create a topological map of the environment based on a previously created Gap Navigation Tree (GNT) [40]. The &amp;quot;gap&amp;quot; in the gap navigation algorithm represents a discontinuity in the robotic field of vision. The robot is able to use the gaps to represent its world as a tree structure (GNT), in which each vertex corresponds to a gap. Ideally, the robot navigates in the world by following the tree branches to its desired goal. However, due to the sensor uncertainty, the robot may detect discontinuities when there are none present, and vice versa. The Probabilistic Gap Navigation Tree compensates for the measurement noise by sampling from a distribution of the gap navigation trees to obtain the most likely tree given the sensor measurements, similar to the particle filtering algorithm used in Monte Carlo localization. Therefore, the PGNT allows navigation in an unknown environment using a realistic range finder, as opposed to the ideal sensor model assumed previously. We demonstrate the ability to build a PGNT in a simulated environment.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>