Abstract
Problems that concern a large number of possible targets, such as those typical of Global Trajectory Optimization Competitions (GTOC), require a global search for the optimal solution and a local refinement. During the 5th edition of the Global Trajectory Optimization Competition, we used different approximated techniques to perform a global search of suitable asteroid sequences; a lo- cal optimization method based on an indirect ap- proach was then used to verify the feasibility of the suggested legs and perform the optimization of multi-leg sequences. All the tools used by our team are presented in this paper. The best solution found is described and discussed.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
