Automatic MGA trajectory planning with a modified ant colony optimization algorithm

This paper assesses the problem of designing multiple gravity assist (MGA) trajectories, including the sequence of planetary encounters. The problem is treated as planning and scheduling of events, such that the original mixed combinatorial-continuous problem is discretised and converted into a purely discrete problem with a finite number of states. We propose the use of a two-dimensional trajectory model in which pairs of celestial bodies are connected by transfer arcs containing one deep-space manoeuvre. A modified Ant Colony Optimisation (ACO) algorithm is then used to look for the optimal solutions. This approach was applied to the design of optimal transfers to Saturn and to Mercury, and a comparison against standard genetic algorithm based optimisers shows its effectiveness

Low-thrust trajectories design for the European Student Moon Orbiter mission

The following paper presents the mission analysis studies performed for the phase A of the solar electric propulsion option of the European Student Moon Orbiter (ESMO) mission. ESMO is scheduled to be launched in 2011, as an auxiliary payload on board of Ariane 5. Hence the launch date will be imposed by the primary payload. A method to efficiently assess wide launch windows for the Earth-Moon transfer is presented here. Sets of spirals starting from the GTO were propagated forward with a continuous tangential thrust until reaching an apogee of 280,000 km. Concurrently, sets of potential Moon spirals were propagated backwards from the lunar orbit injection. The method consists of ranking all the admissible lunar spiral-down orbits that arrive to the target orbit with a simple tangential thrust profile after a capture through the L1 Lagrange point. The 'best' lunar spiral is selected for each Earth spiral. Finally,comparing the value of the ranking function for each launch date, the favourable and unfavourable launch windows are identified

Global Trajectory Optimisation : Can We Prune the Solution Space When Considering Deep Space Manoeuvres? [Final Report]

This document contains a report on the work done under the ESA/Ariadna study 06/4101 on the global optimization of space trajectories with multiple gravity assist (GA) and deep space manoeuvres (DSM). The study was performed by a joint team of scientists from the University of Reading and the University of Glasgow

Ascent trajectory optimisation for a single-stage-to-orbit vehicle with hybrid propulsion

This paper addresses the design of ascent trajectories for a hybrid-engine, high performance, unmanned, single-stage-to-orbit vehicle for payload deployment into low Earth orbit. A hybrid optimisation technique that couples a population-based, stochastic algorithm with a deterministic, gradient-based technique is used to maximize the nal vehicle mass in low Earth orbit after accounting for operational constraints on the dynamic pressure, Mach number and maximum axial and normal accelerations. The control search space is first explored by the population-based algorithm, which uses a single shooting method to evaluate the performance of candidate solutions. The resultant optimal control law and corresponding trajectory are then further refined by a direct collocation method based on finite elements in time. Two distinct operational phases, one using an air-breathing propulsion mode and the second using rocket propulsion, are considered. The presence of uncertainties in the atmospheric and vehicle aerodynamic models are considered in order to quantify their effect on the performance of the vehicle. Firstly, the deterministic optimal control law is re-integrated after introducing uncertainties into the models. The proximity of the final solutions to the target states are analysed statistically. A second analysis is then performed, aimed at determining the best performance of the vehicle when these uncertainties are included directly in the optimisation. The statistical analysis of the results obtained are summarized by an expectancy curve which represents the probable vehicle performance as a function of the uncertain system parameters. This analysis can be used during the preliminary phase of design to yield valuable insights into the robustness of the performance of the vehicle to uncertainties in the specification of its parameters

Optimal Control Theory for Continuous Variable Quantum Gates

We apply the methodology of optimal control theory to the problem of implementing quantum gates in continuous variable systems with quadratic Hamiltonians. We demonstrate that it is possible to define a fidelity measure for continuous variable (CV) gate optimization that is devoid of traps, such that the search for optimal control fields using local algorithms will not be hindered. The optimal control of several quantum computing gates, as well as that of algorithms composed of these primitives, is investigated using several typical physical models and compared for discrete and continuous quantum systems. Numerical simulations indicate that the optimization of generic CV quantum gates is inherently more expensive than that of generic discrete variable quantum gates, and that the exact-time controllability of CV systems plays an important role in determining the maximum achievable gate fidelity. The resulting optimal control fields typically display more complicated Fourier spectra that suggest a richer variety of possible control mechanisms. Moreover, the ability to control interactions between qunits is important for delimiting the total control fluence. The comparative ability of current experimental protocols to implement such time-dependent controls may help determine which physical incarnations of CV quantum information processing will be the easiest to implement with optimal fidelity.Comment: 39 pages, 11 figure

Toward real-world automated antibody design with combinatorial Bayesian optimization

Antibodies are multimeric proteins capable of highly specific molecular recognition. The complementarity determining region 3 of the antibody variable heavy chain (CDRH3) often dominates antigen-binding specificity. Hence, it is a priority to design optimal antigen-specific CDRH3 to develop therapeutic antibodies. The combinatorial structure of CDRH3 sequences makes it impossible to query binding-affinity oracles exhaustively. Moreover, antibodies are expected to have high target specificity and developability. Here, we present AntBO, a combinatorial Bayesian optimization framework utilizing a CDRH3 trust region for an in silico design of antibodies with favorable developability scores. The in silico experiments on 159 antigens demonstrate that AntBO is a step toward practically viable in vitro antibody design. In under 200 calls to the oracle, AntBO suggests antibodies outperforming the best binding sequence from 6.9 million experimentally obtained CDRH3s. Additionally, AntBO finds very-high-affinity CDRH3 in only 38 protein designs while requiring no domain knowledge

Innovative Applications of Genetic Algorithms to Problems in Accelerator Physics

The genetic algorithm (GA) is a powerful technique that implements the principles nature uses in biological evolution to optimize a multidimensional nonlinear problem. The GA works especially well for problems with a large number of local extrema, where traditional methods (such as conjugate gradient, steepest descent, and others) fail or, at best, underperform. The field of accelerator physics, among others, abounds with problems which lend themselves to optimization via GAs. In this paper, we report on the successful application of GAs in several problems related to the existing Continuous Electron Beam Accelerator Facility nuclear physics machine, the proposed Medium-energy Electron-Ion Collider at Jefferson Lab, and a radio frequency gun-based injector. These encouraging results are a step forward in optimizing accelerator design and provide an impetus for application of GAs to other problems in the field. To that end, we discuss the details of the GAs used, include a newly devised enhancement which leads to improved convergence to the optimum, and make recommendations for future GA developments and accelerator applications