A mixed integer convex programming approach to constrained attitude guidance

dc.contributor.advisorAçıkmeşe, Behçeten
dc.contributor.committeeMemberAkella, Maruthi R.en
dc.creatorEren, Utkuen
dc.creator.orcid0000-0001-8751-8977en
dc.date.accessioned2016-04-06T16:44:02Z
dc.date.accessioned2018-01-22T22:29:42Z
dc.date.available2016-04-06T16:44:02Z
dc.date.available2018-01-22T22:29:42Z
dc.date.issued2015-12en
dc.date.submittedDecember 2015
dc.date.updated2016-04-06T16:44:02Z
dc.description.abstractThis brief report introduces a new algorithm for attitude motion planning, Constrained Attitude Guidance (CAG) problem, in the presence of angular rate constraints and conic exclusion regions (pointing constraints). The CAG problem is solved by considering only the quaternion kinematics in the formulation and using constraints on quaternions and its time derivatives to indirectly apply bounds on the angular rates and accelerations. The CAG formulation makes use of Mixed Integer Convex Programming (MICP) in order to impose, approximately, the unity constraint on the quaternion magnitude, where the approximation accuracy can be set to a desired accuracy. The solution complexity of the MICP formulation increases exponentially with the number of binary variables that are used to impose the unit norm constraint on the quaternion. Since this number is independent of the number of exclusion pointing constraints, the solution approach has favorable complexity in terms of the number of pointing constraints. The report also provides a numerical example that incorporates both angular rate and pointing constraints.en
dc.description.departmentAerospace Engineeringen
dc.format.mimetypeapplication/pdfen
dc.identifierdoi:10.15781/T2J213en
dc.identifier.urihttp://hdl.handle.net/2152/34139en
dc.language.isoenen
dc.subjectAttitude guidanceen
dc.subjectMixed-integer programmingen
dc.titleA mixed integer convex programming approach to constrained attitude guidanceen
dc.typeThesisen

Files