Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions
DOI10.1007/978-3-319-41508-6_6zbMath1380.90300arXiv1511.00821OpenAlexW2225069804MaRDI QIDQ3133911
Marcus Märtens, Daniel Hennes, Luis F. Simões, Dario Izzo
Publication date: 8 February 2018
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00821
GTOCinterplanetary trajectory optimizationmulti-objective tree searchmultiple-asteroid rendezvousorbit clusteringphasing indicators
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Celestial mechanics (70F15)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Revisiting Lambert's problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods
- Multidimensional binary search trees used for associative searching
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The ESA NLP Solver WORHP
This page was built for publication: Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions