{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/156644"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/156644","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Robot Planning in Uncertain, Dynamic Environments","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cheerla, Anika"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Lozano-Perez, Tomás"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-05","date_published":"2024-05","updated_at":"2026-07-22T22:22:13Z","subjects":[],"languages":[],"rights":["Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","Copyright retained by author(s)"],"rights_urls":["https://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/156644","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lozano-Perez, Tomás"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Cheerla, Anika"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-09-03T21:14:16Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-09-03T21:14:16Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-05"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/156644"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Robot Planning in Uncertain, Dynamic Environments"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lozano-Perez, Tomás"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Cheerla, Anika"],"dc:date.accessioned":["2024-09-03T21:14:16Z"],"dc:date.available":["2024-09-03T21:14:16Z"],"dc:date.issued":["2024-05"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/156644"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","Copyright retained by author(s)"],"dc:rights.uri":["https://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:title":["Robot Planning in Uncertain, Dynamic Environments"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:22:13Z"}