{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/85396"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/85396","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Path planning for autonomous parafoils using particle chance constrained rapidly-exploring random trees in a computationally constrained environment","abstract":"Particle chance constrained rapidly-exploring random trees (PCC-RRT) is a sampling-based path-planning algorithm which uses particles to approximate an uncertainty distribution. In this thesis, we study the use of PCC-RRT on an autonomous parafoil. Specifically, we explore the behavior of PCC-RRT in a computationally constrained environment by studying the tradeoff between the number of samples and number of particles per sample and its effect on miss distance in single-threaded coded with a time constraint. We compare the results generated with the PCC-RRT planner to the equivalent data from a nominal planner using rapidly-exploring random trees (RRT) to determine the effect of robustness.","abstract_html":"Particle chance constrained rapidly-exploring random trees (PCC-RRT) is a sampling-based path-planning algorithm which uses particles to approximate an uncertainty distribution. In this thesis, we study the use of PCC-RRT on an autonomous parafoil. Specifically, we explore the behavior of PCC-RRT in a computationally constrained environment by studying the tradeoff between the number of samples and number of particles per sample and its effect on miss distance in single-threaded coded with a time constraint. We compare the results generated with the PCC-RRT planner to the equivalent data from a nominal planner using rapidly-exploring random trees (RRT) to determine the effect of robustness.","abstract_has_math":false,"creators":["Klerman, Shoshana"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Jonathan P. How."],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-07-22T22:21:07Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/85396","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Jonathan P. How."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Klerman, Shoshana"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-06T15:39:02Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-06T15:39:02Z"]},{"key":"dc:date.issued","label":"Date","values":["2012"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/85396"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2012.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-58)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Particle chance constrained rapidly-exploring random trees (PCC-RRT) is a sampling-based path-planning algorithm which uses particles to approximate an uncertainty distribution. In this thesis, we study the use of PCC-RRT on an autonomous parafoil. Specifically, we explore the behavior of PCC-RRT in a computationally constrained environment by studying the tradeoff between the number of samples and number of particles per sample and its effect on miss distance in single-threaded coded with a time constraint. We compare the results generated with the PCC-RRT planner to the equivalent data from a nominal planner using rapidly-exploring random trees (RRT) to determine the effect of robustness."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Path planning for autonomous parafoils using particle chance constrained rapidly-exploring random trees in a computationally constrained environment"]}]}],"canonical_facts":{"dc:contributor.advisor":["Jonathan P. How."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Klerman, Shoshana"],"dc:date.accessioned":["2014-03-06T15:39:02Z"],"dc:date.available":["2014-03-06T15:39:02Z"],"dc:date.issued":["2012"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2012.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-58)."],"dc:description.abstract":["Particle chance constrained rapidly-exploring random trees (PCC-RRT) is a sampling-based path-planning algorithm which uses particles to approximate an uncertainty distribution. In this thesis, we study the use of PCC-RRT on an autonomous parafoil. Specifically, we explore the behavior of PCC-RRT in a computationally constrained environment by studying the tradeoff between the number of samples and number of particles per sample and its effect on miss distance in single-threaded coded with a time constraint. We compare the results generated with the PCC-RRT planner to the equivalent data from a nominal planner using rapidly-exploring random trees (RRT) to determine the effect of robustness."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/85396"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Path planning for autonomous parafoils using particle chance constrained rapidly-exploring random trees in a computationally constrained environment"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:07Z"}