Abstract
This article presents new mathematical results for exact and approximate relaxations of nonconvex optimal control problems defined on disconnected control sets. The exact relaxations are based upon extreme point relaxations wherein the relaxed control set is constructed so that its extreme points belong to the original set. A system property required for exactness is normality. In the absence of normality, control set approximations and system dynamic perturbations are introduced so that normality holds. The results hold for linear dynamical systems and nonlinear systems affine in the control. It is shown that the convex relaxations enable the efficient solution of problems in aerospace engineering, sparsity-promoting optimization, overactuated systems, and multiplexing systems. The computational guarantees associated with convex optimization make the relaxation techniques suitable for real-time control.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
