{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-9314"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-9314","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Exact and Approximate Relaxation Techniques for Computational Guidance","abstract":"The focus of this dissertation is in the development and application of relaxation techniques that enable efficient and real-time solution of complex computational guidance problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions to the relaxed problem are optimal for the original problem. Unique contributions of this work include: 1) a relaxation technique for solving fixed final time problems between fixed points, 2) a performance analysis on the application of computational guidance for the Mars Ascent Vehicle, and 3) establishment of sufficient conditions for non-singularity of optimal control for problems on a smooth manifold with mixed constraints. The first result states that for annularly constrained linear systems, controllability is a sufficient condition for the problem to be solvable as a sequence of convex programs. The second result applies relaxations to an ascent problem. The third result is the most general result to date for problems with mixed constraints. It uses a minimum principle on manifolds with mixed constraints to analyze the problem in a geometric framework, and shows that strong observability of the dual system is sufficient for non-singularity.","abstract_html":"The focus of this dissertation is in the development and application of relaxation techniques that enable efficient and real-time solution of complex computational guidance problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions to the relaxed problem are optimal for the original problem. Unique contributions of this work include: 1) a relaxation technique for solving fixed final time problems between fixed points, 2) a performance analysis on the application of computational guidance for the Mars Ascent Vehicle, and 3) establishment of sufficient conditions for non-singularity of optimal control for problems on a smooth manifold with mixed constraints. The first result states that for annularly constrained linear systems, controllability is a sufficient condition for the problem to be solvable as a sequence of convex programs. The second result applies relaxations to an ascent problem. The third result is the most general result to date for problems with mixed constraints. It uses a minimum principle on manifolds with mixed constraints to analyze the problem in a geometric framework, and shows that strong observability of the dual system is sufficient for non-singularity.","abstract_has_math":false,"creators":["Kunhippurayil, Sheril Avikkal"],"institution":"Hosted by Utah State University Libraries","degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Mechanical and Aerospace Engineering","degree_department":null,"school":null,"contributors":["Matthew W. Harris","David Geller","Stephen A. Whitmore"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:52:35Z","subjects":["Convex relaxation","lossless convexification","optimal control","annular constraint","mixed constraint","controllability","strong observability","smooth manifold","computational guidance","fixed final time","Aerospace Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/168e-0cf2"],"render_values":[{"text":"https://doi.org/10.26076/168e-0cf2","href":"https://doi.org/10.26076/168e-0cf2","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/8172","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/8172","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-9314","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Matthew W. Harris","David Geller","Stephen A. Whitmore"]},{"key":"dc:creator","label":"Author","values":["Kunhippurayil, Sheril Avikkal"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2021-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical and Aerospace Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Convex relaxation","lossless convexification","optimal control","annular constraint","mixed constraint","controllability","strong observability","smooth manifold","computational guidance","fixed final time","Aerospace Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/8172"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/168e-0cf2"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The focus of this dissertation is in the development and application of relaxation techniques that enable efficient and real-time solution of complex computational guidance problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions to the relaxed problem are optimal for the original problem. Unique contributions of this work include: 1) a relaxation technique for solving fixed final time problems between fixed points, 2) a performance analysis on the application of computational guidance for the Mars Ascent Vehicle, and 3) establishment of sufficient conditions for non-singularity of optimal control for problems on a smooth manifold with mixed constraints. The first result states that for annularly constrained linear systems, controllability is a sufficient condition for the problem to be solvable as a sequence of convex programs. The second result applies relaxations to an ascent problem. The third result is the most general result to date for problems with mixed constraints. It uses a minimum principle on manifolds with mixed constraints to analyze the problem in a geometric framework, and shows that strong observability of the dual system is sufficient for non-singularity."]},{"key":"dc:title","label":"Title","values":["Exact and Approximate Relaxation Techniques for Computational Guidance"]}]}],"canonical_facts":{"dc:contributor":["Matthew W. Harris","David Geller","Stephen A. Whitmore"],"dc:creator":["Kunhippurayil, Sheril Avikkal"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2021-08-01T07:00:00Z"],"dc:description.abstract":["The focus of this dissertation is in the development and application of relaxation techniques that enable efficient and real-time solution of complex computational guidance problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions to the relaxed problem are optimal for the original problem. Unique contributions of this work include: 1) a relaxation technique for solving fixed final time problems between fixed points, 2) a performance analysis on the application of computational guidance for the Mars Ascent Vehicle, and 3) establishment of sufficient conditions for non-singularity of optimal control for problems on a smooth manifold with mixed constraints. The first result states that for annularly constrained linear systems, controllability is a sufficient condition for the problem to be solvable as a sequence of convex programs. The second result applies relaxations to an ascent problem. The third result is the most general result to date for problems with mixed constraints. It uses a minimum principle on manifolds with mixed constraints to analyze the problem in a geometric framework, and shows that strong observability of the dual system is sufficient for non-singularity."],"dc:identifier":["https://digitalcommons.usu.edu/etd/8172"],"dc:identifier.doi":["https://doi.org/10.26076/168e-0cf2"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Convex relaxation","lossless convexification","optimal control","annular constraint","mixed constraint","controllability","strong observability","smooth manifold","computational guidance","fixed final time","Aerospace Engineering"],"dc:title":["Exact and Approximate Relaxation Techniques for Computational Guidance"],"thesis:degree_discipline":["Mechanical and Aerospace Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:52:35Z"}