Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Designing optimal low-thrust gravity-assist trajectories using space-pruning and a multi-objective approach

Schütze, Oliver and Vasile, Massimiliano and Junge, Oliver and Delinitz, M. and Izzo, Dario (2009) Designing optimal low-thrust gravity-assist trajectories using space-pruning and a multi-objective approach. Engineering Optimization, 41 (2). pp. 155-181. ISSN 0305-215X

[img]
Preview
PDF (Designing optimal low-thrust gravity-assist trajectories using space-pruning and a multi-objective approach)
ltgasp_engopt_r2.dvi.pdf - Preprint

Download (947kB) | Preview

Abstract

A multi-objective problem is addressed consisting of finding optimal low-thrust gravity-assist trajectories for interplanetary and orbital transfers. For this, recently developed pruning techniques for incremental search space reduction - which will be extended for the current situation - in combination with subdivision techniques for the approximation of the entire solution set, the so-called Pareto set, are used. Subdivision techniques are particularly promising for the numerical treatment of these multi-objective design problems since they are characterized (amongst others) by highly disconnected feasible domains, which can easily be handled by these set oriented methods. The complexity of the novel pruning techniques is analysed, and finally the usefulness of the novel approach is demonstrated by showing some numerical results for two realistic cases.