Date of Award:

5-2023

Document Type:

Dissertation

Degree Name:

Doctor of Philosophy (PhD)

Department:

Mechanical and Aerospace Engineering

Committee Chair(s)

Matthew W. Harris

Committee

Matthew W. Harris

Committee

David K. Geller

Committee

Tianyi He

Committee

Douglas Hunsaker

Committee

Greg Droge

Abstract

The focus of this dissertation is in the application of convexity for control problems; specifically, single-agent problems with linear or nonlinear dynamics and multi-agent problems with linear dynamics. A mixture of convex and non-convex constraints for optimal control problems is also considered. The main contributions of this dissertation include: 1) a convexification of single-agent problems with linear dynamics and annular control constraint, 2) a technique for controlling bounded nonlinear single-agent systems, and 3) a technique for solving multi-agent pursuit-evasion games with linear dynamics and convex control and state constraints. The first result shows that for annularly constrained linear systems, controllability is a sufficient condition for a free or fixed time problem to be solvable as a sequence of convex optimization problems. The second result shows that if a nonlinear system is bounded and “ordered”, it is possible to use a convex combination of bounding linear systems to design a control for the nonlinear system. The third result takes advantage of a convex reachable set computation for each agent in solving games using a geometrical approach. Altogether, the theoretical and computational results demonstrate the significance of convex analysis in solving non-convex control problems.

Checksum

19e2400761af2df68417ffee9770027e

Download

Share

COinS

Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .