{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/63035"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/63035","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Path optimization using sub-Riemannian manifolds with applications to astrodynamics","abstract":"Differential geometry provides mechanisms for finding shortest paths in metric spaces. This work describes a procedure for creating a metric space from a path optimization problem description so that the formalism of differential geometry can be applied to find the optimal paths. Most path optimization problems will generate a sub-Riemannian manifold. This work describes an algorithm which approximates a sub-Riemannian manifold as a Riemannian manifold using a penalty metric so that Riemannian geodesic solvers can be used to find the solutions to the path optimization problem. This new method for solving path optimization problems shows promise to be faster than other methods, in part because it can easily run on parallel processing units. It also provides some geometrical insights into path optimization problems which could provide a new way to categorize path optimization problems. Some simple path optimization problems are described to provide an understandable example of how the method works and an application to astrodynamics is also given.","abstract_html":"Differential geometry provides mechanisms for finding shortest paths in metric spaces. This work describes a procedure for creating a metric space from a path optimization problem description so that the formalism of differential geometry can be applied to find the optimal paths. Most path optimization problems will generate a sub-Riemannian manifold. This work describes an algorithm which approximates a sub-Riemannian manifold as a Riemannian manifold using a penalty metric so that Riemannian geodesic solvers can be used to find the solutions to the path optimization problem. This new method for solving path optimization problems shows promise to be faster than other methods, in part because it can easily run on parallel processing units. It also provides some geometrical insights into path optimization problems which could provide a new way to categorize path optimization problems. Some simple path optimization problems are described to provide an understandable example of how the method works and an application to astrodynamics is also given.","abstract_has_math":false,"creators":["Whiting, James K. (James Kalani), 1980-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.","school":null,"contributors":[],"advisors":["Olivier deWeck, Manuel Martinez-Sanchez and Ray Sedwick."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-07-22T22:21:05Z","subjects":["Aeronautics and Astronautics."],"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/63035","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Olivier deWeck, Manuel Martinez-Sanchez and Ray Sedwick."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics."]},{"key":"dc:creator","label":"Author","values":["Whiting, James K. (James Kalani), 1980-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-05-23T18:06:00Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-05-23T18:06:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2011"]},{"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":["Aeronautics and Astronautics."]}]},{"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/63035"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2011.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 131)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Differential geometry provides mechanisms for finding shortest paths in metric spaces. This work describes a procedure for creating a metric space from a path optimization problem description so that the formalism of differential geometry can be applied to find the optimal paths. Most path optimization problems will generate a sub-Riemannian manifold. This work describes an algorithm which approximates a sub-Riemannian manifold as a Riemannian manifold using a penalty metric so that Riemannian geodesic solvers can be used to find the solutions to the path optimization problem. This new method for solving path optimization problems shows promise to be faster than other methods, in part because it can easily run on parallel processing units. It also provides some geometrical insights into path optimization problems which could provide a new way to categorize path optimization problems. Some simple path optimization problems are described to provide an understandable example of how the method works and an application to astrodynamics is also given."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Path optimization using sub-Riemannian manifolds with applications to astrodynamics"]}]}],"canonical_facts":{"dc:contributor.advisor":["Olivier deWeck, Manuel Martinez-Sanchez and Ray Sedwick."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics."],"dc:creator":["Whiting, James K. (James Kalani), 1980-"],"dc:date.accessioned":["2011-05-23T18:06:00Z"],"dc:date.available":["2011-05-23T18:06:00Z"],"dc:date.issued":["2011"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2011.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 131)."],"dc:description.abstract":["Differential geometry provides mechanisms for finding shortest paths in metric spaces. This work describes a procedure for creating a metric space from a path optimization problem description so that the formalism of differential geometry can be applied to find the optimal paths. Most path optimization problems will generate a sub-Riemannian manifold. This work describes an algorithm which approximates a sub-Riemannian manifold as a Riemannian manifold using a penalty metric so that Riemannian geodesic solvers can be used to find the solutions to the path optimization problem. This new method for solving path optimization problems shows promise to be faster than other methods, in part because it can easily run on parallel processing units. It also provides some geometrical insights into path optimization problems which could provide a new way to categorize path optimization problems. Some simple path optimization problems are described to provide an understandable example of how the method works and an application to astrodynamics is also given."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/63035"],"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":["Aeronautics and Astronautics."],"dc:title":["Path optimization using sub-Riemannian manifolds with applications to astrodynamics"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:05Z"}