Show simple item record

dc.contributor.advisorJunkins, John L.
dc.contributor.advisorMortari, Daniele
dc.creatorDavis, Jeremy John
dc.date.accessioned2011-10-21T22:02:59Z
dc.date.accessioned2011-10-22T07:09:20Z
dc.date.available2011-10-21T22:02:59Z
dc.date.available2011-10-22T07:09:20Z
dc.date.created2010-08
dc.date.issued2011-10-21
dc.date.submittedAugust 2010
dc.identifier.urihttps://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8325
dc.description.abstractConstellation reconfi guration consists of transforming an initial constellation of satellites into some final constellation of satellites to maintain system optimality. Constellations with phased deployment, changing mission requirements, or satellite failures would all benefi t from reconfi guration capability. The constellation reconfiguration problem can be broken into two broad sub-problems: constellation design and constellation transfer. Both are complicated and combinatorial in nature and require new, more efficient methods. Having reviewed existing constellation design frameworks, a new framework, the Elliptical Flower Constellations (EFCs), has been developed that offers improved performance over traditional methods. To assist in rapidly analyzing constellation designs, a new method for orbit propagation based on a sequential solution of Kepler's equation is presented. The constellation transfer problem requires an optimal assignment of satellites in the initial orbit to slots in the final orbit based on optimal orbit transfers between them. A new method for approximately solving the optimal two-impulse orbit transfer with fixed end-points, the so-called minimum Delta v Lambert's problem, is developed that requires the solution of a 4th order polynomial, as opposed to the 6th or higher order polynomials or iterative techniques of existing methods. The recently developed Learning Approach to sampling optimization is applied to the particular problem of general orbit transfer between two generic orbits, with several enhancements specifi c to this problem that improve its performance. The constellation transfer problem is then posed as a Linear Assignment Problem and solved using the auction algorithm once the orbit transfers have been computed. Constellations designed for global navigation satellite systems and for global communications demonstrate signifi cant improvements through the use of the EFC framework over existing methods. An end-to-end example of constellation recon figuration for a constellation with changing regional coverage requirements shows the effectiveness of the constellation transfer methods.en
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectconstellation designen
dc.subjectconstellation reconfigurationen
dc.subjectsatellite constellationen
dc.subjectorbit designen
dc.subjectKepler's equationen
dc.titleConstellation Reconfiguration: Tools and Analysisen
dc.typeThesisen
thesis.degree.departmentAerospace Engineeringen
thesis.degree.disciplineAerospace Engineeringen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameDoctor of Philosophyen
thesis.degree.levelDoctoralen
dc.contributor.committeeMemberHurtado, John E.
dc.contributor.committeeMemberRojas, Maurice
dc.type.genrethesisen
dc.type.materialtexten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record