Abstract

Space mission planning and spacecraft design are tightly coupled and need to be considered together for optimal performance; however, this integrated optimization problem results in a large-scale mixed-integer nonlinear programming (MINLP) problem, which is challenging to solve. In response to this challenge, this paper proposes a new solution approach to this problem based on decomposition-based optimization via augmented Lagrangian coordination. The proposed approach leverages the unique structure of the problem that enables its decomposition into a set of coupled subproblems of different types: a mixed-integer quadratic programming (MIQP) subproblem for mission planning, and one or more nonlinear programming (NLP) subproblem(s) for spacecraft design. Because specialized MIQP or NLP solvers can be applied to each subproblem, the proposed approach can efficiently solve the otherwise intractable integrated MINLP problem. An automatic and effective method to find an initial solution for this iterative approach is also proposed so that the optimization can be performed without a user-defined initial guess. The demonstration case study shows that, compared to the state-of-the-art method, the proposed formulation converges substantially faster and the converged solution is at least the same or better given the same computational time limit.

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.