{"id":{"repo_id":"unr","oai_identifier":"oai:null:11714/2004"},"canonical_url":"https://search.ndltd.org/etd/unr/oai:null:11714/2004","repository":{"repo_id":"unr","name":"University of Nevada - Reno","base_url":"https://scholarwolf.unr.edu/server/oai/request"},"display":{"title":"Dynamic Path Planning and Replanning for Mobile Robot Team Using RRT*","abstract":"It is necessary for a mobile robot to be able to efficiently plan a path from itsstarting or current location to a desired goal location. This is a trivial task when theenvironment is static. However, the operational environment of the robot is rarelystatic, and it often has many moving obstacles. The robot may encounter one, ormany, of these unknown and unpredictable moving obstacles. The robot will need todecide how to proceed when one of these obstacles is obstructing it's path. A methodof dynamic replanning using RRT* is presented. The robot will modify its currentplan when an unknown random moving obstacle obstructs the path. In multi-robotscenarios it is important to efficiently develop path planning solutions. A methodof node sharing is presented to quickly develop path plans for a multi-robot team.Various experimental results show the effectiveness of the proposed methods.","abstract_html":"It is necessary for a mobile robot to be able to efficiently plan a path from itsstarting or current location to a desired goal location. This is a trivial task when theenvironment is static. However, the operational environment of the robot is rarelystatic, and it often has many moving obstacles. The robot may encounter one, ormany, of these unknown and unpredictable moving obstacles. The robot will need todecide how to proceed when one of these obstacles is obstructing it&#x27;s path. A methodof dynamic replanning using RRT* is presented. The robot will modify its currentplan when an unknown random moving obstacle obstructs the path. In multi-robotscenarios it is important to efficiently develop path planning solutions. A methodof node sharing is presented to quickly develop path plans for a multi-robot team.Various experimental results show the effectiveness of the proposed methods.","abstract_has_math":false,"creators":["Connell, Devin"],"institution":null,"degree_name":null,"degree_level":"Master's Degree","degree_discipline":null,"degree_department":"Computer Science and Engineering","school":null,"contributors":[],"advisors":["La, Hung M."],"committee_chairs":[],"committee_members":["Nicolescu, Monica","Menezes, Pradeep"],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-11-19T09:55:42Z","subjects":["Path Planning","Robotics","RRT"],"languages":[],"rights":["In Copyright(All Rights Reserved)","Author(s)"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11714/2004","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11714/2004","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarwolf.unr.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Anull%3A11714%2F2004","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["La, Hung M."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Nicolescu, Monica","Menezes, Pradeep"]},{"key":"dc:creator","label":"Author","values":["Connell, Devin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-09-08T17:37:32Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-09-08T17:37:32Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:date.submitted","label":"Dc Date Submitted","values":["2017-01-01"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2017-09-06T17:48:49Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_department","label":"Department","values":["Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's Degree"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Path Planning","Robotics","RRT"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright(All Rights Reserved)"]},{"key":"dc:rights.holder","label":"Dc Rights Holder","values":["Author(s)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11714/2004"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["It is necessary for a mobile robot to be able to efficiently plan a path from itsstarting or current location to a desired goal location. This is a trivial task when theenvironment is static. However, the operational environment of the robot is rarelystatic, and it often has many moving obstacles. The robot may encounter one, ormany, of these unknown and unpredictable moving obstacles. The robot will need todecide how to proceed when one of these obstacles is obstructing it's path. A methodof dynamic replanning using RRT* is presented. The robot will modify its currentplan when an unknown random moving obstacle obstructs the path. In multi-robotscenarios it is important to efficiently develop path planning solutions. A methodof node sharing is presented to quickly develop path plans for a multi-robot team.Various experimental results show the effectiveness of the proposed methods."]},{"key":"dc:format","label":"Dc Format","values":["PDF"]},{"key":"dc:title","label":"Title","values":["Dynamic Path Planning and Replanning for Mobile Robot Team Using RRT*"]}]}],"canonical_facts":{"dc:contributor.advisor":["La, Hung M."],"dc:contributor.committeemember":["Nicolescu, Monica","Menezes, Pradeep"],"dc:creator":["Connell, Devin"],"dc:date.accessioned":["2017-09-08T17:37:32Z"],"dc:date.available":["2017-09-08T17:37:32Z"],"dc:date.issued":["2017"],"dc:date.submitted":["2017-01-01"],"dc:date.updated":["2017-09-06T17:48:49Z"],"dc:description.abstract":["It is necessary for a mobile robot to be able to efficiently plan a path from itsstarting or current location to a desired goal location. This is a trivial task when theenvironment is static. However, the operational environment of the robot is rarelystatic, and it often has many moving obstacles. The robot may encounter one, ormany, of these unknown and unpredictable moving obstacles. The robot will need todecide how to proceed when one of these obstacles is obstructing it's path. A methodof dynamic replanning using RRT* is presented. The robot will modify its currentplan when an unknown random moving obstacle obstructs the path. In multi-robotscenarios it is important to efficiently develop path planning solutions. A methodof node sharing is presented to quickly develop path plans for a multi-robot team.Various experimental results show the effectiveness of the proposed methods."],"dc:format":["PDF"],"dc:identifier.uri":["http://hdl.handle.net/11714/2004"],"dc:rights":["In Copyright(All Rights Reserved)"],"dc:rights.holder":["Author(s)"],"dc:subject":["Path Planning","Robotics","RRT"],"dc:title":["Dynamic Path Planning and Replanning for Mobile Robot Team Using RRT*"],"dc:type":["Thesis"],"thesis:degree_department":["Computer Science and Engineering"],"thesis:degree_level":["Master's Degree"]},"updated_at":"2026-11-19T09:55:42Z"}