<?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-19T08:07:04Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/156644" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/156644</identifier><datestamp>2024-09-04T03:08:45Z</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">Lozano-Perez, Tomás</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Cheerla, Anika</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">2024-09-03T21:14:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-09-03T21:14:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-05</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2024-07-11T14:36:09.294Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/156644</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Many real-world applications require robots to operate in dynamic environments characterized by moving objects or agents whose trajectories are unpredictable. This thesis addresses the challenges posed by such environments by introducing Relative Temporal Probabilistic Roadmaps (Rel-T-PRM), a novel motion planning algorithm that builds upon the Temporal Probabilistic Roadmap (T-PRM) algorithm. The Rel-T-PRM allows for variable dynamic obstacle size, enables robustness with respect to minor changes in time and position and and introduces the concept of waiting until obstacles clear. Furthermore, we leverage Rel-T-PRM’s strengths to propose two replanning strategies. The first attempts to rapidly replan on-the-fly by using waiting to modify the trajectory without needing to modify the path. The second proposed replanning strategy identifies and plans to safe locations, where the robot can safely replan under a longer time horizon. We demonstrate Rel-T-PRM through a variety of simulation experiments on a fixed-base robotic manipulator.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright retained by author(s)</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by-nc-nd/4.0/</dim:field>
   <dim:field mdschema="dc" element="title">Robot Planning in Uncertain, Dynamic Environments</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Master</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Engineering in Electrical Engineering and Computer Science</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="d27eb9f5-4e5c-4b01-ad03-7574b2cdc933">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Robot Planning in Uncertain, Dynamic Environments&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-05&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Cheerla, Anika&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>https://creativecommons.org/licenses/by-nc-nd/4.0/&lt;/License>
   	&lt;Abstract>Many real-world applications require robots to operate in dynamic environments characterized by moving objects or agents whose trajectories are unpredictable. This thesis addresses the challenges posed by such environments by introducing Relative Temporal Probabilistic Roadmaps (Rel-T-PRM), a novel motion planning algorithm that builds upon the Temporal Probabilistic Roadmap (T-PRM) algorithm. The Rel-T-PRM allows for variable dynamic obstacle size, enables robustness with respect to minor changes in time and position and and introduces the concept of waiting until obstacles clear. Furthermore, we leverage Rel-T-PRM’s strengths to propose two replanning strategies. The first attempts to rapidly replan on-the-fly by using waiting to modify the trajectory without needing to modify the path. The second proposed replanning strategy identifies and plans to safe locations, where the robot can safely replan under a longer time horizon. We demonstrate Rel-T-PRM through a variety of simulation experiments on a fixed-base robotic manipulator.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>