Quadratically constrained attitude control via semidefinite programmingDownload PDFOpen Website

Published: 2003, Last Modified: 15 May 2023CDC 2003Readers: Everyone
Abstract: We consider the attitude control problem as augmented with an arbitrary number of nonconvex quadratic constraints. By utilizing the implicit magnitude constraint of the state vector (i.e., quaternion), we are able to reduce this problem to a convex quadratically constrained quadratic program or a semi-definite program. This result leads to an efficient solution strategy for general quadratically constrained attitude control problems. An example demonstrates the proposed methodology.
0 Replies

Loading