885 research outputs found

    Annales Mathematicae et Informaticae (48.)

    Get PDF

    Annales Mathematicae et Informaticae 2018

    Get PDF

    Application of optimization techniques to the design and maintenance of satellite constellations

    Get PDF
    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1999.Vita.Includes bibliographical references (p. 401-406).Optimization techniques were studied and applied to a variety of applications in both the design and maintenance of satellite constellations. Powell's method and parallel genetic algorithms were used in conjunction with precise orbit propagation schemes to develop robust orbit optimization tools. Specifically, local and global optimization methods were used to design a 113:14 repeat ground track variant of the Ellipso TM inclined elliptical sub-constellation and a gear array variant of the Ellipso TM equatorial sub-constellation. The resulting optimal constellation designs were found to maintain stability, even when subjected to full perturbation analysis. The global optimization technique of parallel genetic algorithms was also used to create an optimization approach capable of maintaining the designed orbits over specified lengths of time. Although the global method proved successful over short time periods, limitations of the approach eliminated longer time span optimizations and led to the creation of a more operational station-keeping optimization scheme. The more operational station-keeping implementation yielded similar station-keeping estimates while allowing for the study of longer time periods.by James Earl Smith.S.M

    Constellation Reconfiguration: Tools and Analysis

    Get PDF
    Constellation 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
    • …
    corecore