A multiobjective, multidisciplinary design optimization methodology for the conceptual design of distributed satellite systems
Author(s)
Jilla, Cyrus D., 1974-![Thumbnail](/bitstream/handle/1721.1/16837/51283638-MIT.pdf.jpg?sequence=5&isAllowed=y)
DownloadFull printable version (5.661Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Advisor
David W. Miller.
Terms of use
Metadata
Show full item recordAbstract
A multiobjective, multidisciplinary design optimization methodology for mathematically modeling the distributed satellite system (DSS) conceptual design problem as an optimization problem has been developed to advance the state-of-the-art in complex distributed satellite network design. An increasing number of space missions are utilizing DSS architectures in which multiple satellites work in a coordinated fashion to improve system performance, cost, and survivability. The trade space for distributed satellite systems can be enormous - too large to enumerate, analyze, and compare all possible architectures. The seven-step methodology enables an efficient search of the trade space for the best families of architectures, and explores architectures that might not otherwise be considered during the conceptual design phase, the phase of a DSS program in which the majority of lifecycle cost gets locked in. Four classes of multidisciplinary design optimization (MDO) techniques are investigated - Taguchi, heuristic, gradient, and univariate methods. The heuristic simulated annealing (SA) algorithm found the best DSS architectures with the greatest consistency due to its ability to escape local optima within a nonconvex trade space. Accordingly, this SA algorithm forms the core single objective MDO algorithm in the methodology. The DSS conceptual design problem scope is then broadened by expanding from single objective to multiobjective optimization problems, and two variant multiobjective SA algorithms are developed. (cont.) The utility in knowing the global Pareto boundary of a DSS trade space is presented, and several methods are explored for approximating the true global Pareto boundary with only a limited knowledge of the full DSS trade space. Finally, methods for improving the performance of the SA algorithm are tested, and it was found that the 2-DOF variant of the SA algorithm is most effective at both single objective and multiobjective searches of a DSS trade space. The versatility of the methodology is demonstrated through its application to the conceptual design of three separate distributed satellite systems - the civil NASA Origins Terrestrial Planet Finder mission, the military TechSat 21 GMTI space-based radar mission, and the commercial broadband satellite communications mission. In each case, the methodology identifies more cost-effective system architectures than those previously considered for the single objective optimization problem, and a Pareto optimal set of architectures for the multiobjective optimization problem. In this manner, the methodology serves as a powerful, versatile systems engineering tool for the conceptual design of distributed satellite systems.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2002. Includes bibliographical references (p. 427-438). This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Date issued
2002Department
Massachusetts Institute of Technology. Department of Aeronautics and AstronauticsPublisher
Massachusetts Institute of Technology
Keywords
Aeronautics and Astronautics.