{"title":"Automated tour design in the Saturnian system","authors":"Yuji Takubo, Damon Landau, Brian Anderson","doi":"10.1007/s10569-023-10179-8","DOIUrl":null,"url":null,"abstract":"<p>Future missions to Enceladus would benefit from multi-moon tours that leverage <span>\\(V_\\infty \\)</span> on resonant orbits to progressively transfer between moons. Such resonance hopping trajectories present a vast search space for global optimization due to the different combinations of available resonances and flyby velocities. The proposed multi-objective tour design algorithm optimizes entire moon tours from Titan to Enceladus via grid-based dynamic programming, in which the computation time is significantly reduced by discretization of the design variables and pre-computation of a database of <span>\\(V_\\infty \\)</span>-leveraging transfers. The result unveils a complete trade space of the moon tour design to Enceladus, and the obtained solution is validated in a full-ephemeris model.</p>","PeriodicalId":72537,"journal":{"name":"Celestial mechanics and dynamical astronomy","volume":"92 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Celestial mechanics and dynamical astronomy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10569-023-10179-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Future missions to Enceladus would benefit from multi-moon tours that leverage \(V_\infty \) on resonant orbits to progressively transfer between moons. Such resonance hopping trajectories present a vast search space for global optimization due to the different combinations of available resonances and flyby velocities. The proposed multi-objective tour design algorithm optimizes entire moon tours from Titan to Enceladus via grid-based dynamic programming, in which the computation time is significantly reduced by discretization of the design variables and pre-computation of a database of \(V_\infty \)-leveraging transfers. The result unveils a complete trade space of the moon tour design to Enceladus, and the obtained solution is validated in a full-ephemeris model.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
