Abstract

We consider the attitude control problem 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 semidefinite program. This result leads to an efficient solution strategy for general quadratically constrained attitude control problems. An example demonstrates the proposed methodology.

Full Text
Paper version not known

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 call

Disclaimer: 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.