6,178 research outputs found
Optimal low-thrust trajectories to asteroids through an algorithm based on differential dynamic programming
In this paper an optimisation algorithm based on Differential Dynamic Programming is applied to the design of rendezvous and fly-by trajectories to near Earth objects. Differential dynamic programming is a successive approximation technique that computes a feedback control law in correspondence of a fixed number of decision times. In this way the high dimensional problem characteristic of low-thrust optimisation is reduced into a series of small dimensional problems. The proposed method exploits the stage-wise approach to incorporate an adaptive refinement of the discretisation mesh within the optimisation process. A particular interpolation technique was used to preserve the feedback nature of the control law, thus improving robustness against some approximation errors introduced during the adaptation process. The algorithm implements global variations of the control law, which ensure a further increase in robustness. The results presented show how the proposed approach is capable of fully exploiting the multi-body dynamics of the problem; in fact, in one of the study cases, a fly-by of the Earth is scheduled, which was not included in the first guess solution
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference âOptimisation of Mobile Communication Networksâ focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
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
Stochastic level-set method for shape optimisation
We present a new method for stochastic shape optimisation of engineering
structures. The method generalises an existing deterministic scheme, in which
the structure is represented and evolved by a level-set method coupled with
mathematical programming. The stochastic element of the algorithm is built on
the methods of statistical mechanics and is designed so that the system
explores a Boltzmann-Gibbs distribution of structures. In non-convex
optimisation problems, the deterministic algorithm can get trapped in local
optima: the stochastic generalisation enables sampling of multiple local
optima, which aids the search for the globally-optimal structure. The method is
demonstrated for several simple geometrical problems, and a proof-of-principle
calculation is shown for a simple engineering structure.Comment: 17 pages, 10 fig
Multi-objective engineering shape optimization using differential evolution interfaced to the Nimrod/O tool
This paper presents an enhancement of the Nimrod/O optimization tool by interfacing DEMO, an external multiobjective optimization algorithm. DEMO is a variant of differential evolution â an algorithm that has attained much popularity in the research community, and this work represents the first time that true multiobjective optimizations have been performed with Nimrod/O. A modification to the DEMO code enables multiple objectives to be evaluated concurrently. With Nimrod/Oâs support for parallelism, this can reduce the wall-clock time significantly for compute intensive objective function evaluations. We describe the usage and implementation of the interface and present two optimizations. The first is a two objective mathematical function in which the Pareto front is successfully found after only 30 generations. The second test case is the three-objective shape optimization of a rib-reinforced wall bracket using the Finite Element software, Code_Aster. The interfacing of the already successful packages of Nimrod/O and DEMO yields a solution that we believe can benefit a wide community, both industrial and academic
Spaceplane trajectory optimisation with evolutionary-based initialisation
In this paper, an evolutionary-based initialisation method is proposed based on Adaptive Inflationary Differential Evolution algorithm, which is used in conjunction with a deterministic local optimisation algorithm to efficiently identify clusters of optimal solutions. The approach is applied to an ascent trajectory for a single stage to orbit spaceplane, employing a rocket-based combine cycle propulsion system. The problem is decomposed first into flight phases, based on user defined criteria such as a propulsion cycle change translating to different mathematical system models, and subsequently transcribed into a multi-shooting NLP problem. Examining the results based on 10 independent runs of the approach, it can be seen that in all cases the method converges to clusters of feasible solutions. In 40% of the cases, the AIDEA-based initialisation found a better solution compared to a heuristic approach using constant control for each phase with a single shooting transcription (representing an expert user). The problem was run using randomly generated control laws, only 2/20 cases converged, both times with a less optimal solution compared to the baseline heuristic approach and AIDEA
Optimal mixing enhancement
We introduce a general-purpose method for optimising the mixing rate of
advective fluid flows. An existing velocity field is perturbed in a
neighborhood to maximize the mixing rate for flows generated by velocity fields
in this neighborhood. Our numerical approach is based on the infinitesimal
generator of the flow and is solved by standard linear programming methods. The
perturbed flow may be easily constrained to preserve the same steady state
distribution as the original flow, and various natural geometric constraints
can also be simply applied. The same technique can also be used to optimize the
mixing rate of advection-diffusion flow models by manipulating the drift term
in a small neighborhood
Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems.
We propose a new class of multi-objective benchmark problems on which we analyse the performance of four well established multi-objective evolutionary algorithms (MOEAs) â each implementing a different search paradigm â by comparing run-time convergence behaviour over a set of 1200 problem instances. The new benchmarks are created by fusing previously proposed single-objective interpolated continuous optimisation problems (ICOPs) via a common set of Pareto non-dominated seeds. They thus inherit the ICOP property of having tunable fitness landscape features. The benchmarks are of intrinsic interest as they derive from interpolation methods and so can approximate general problem instances. This property is revealed to be of particular importance as our extensive set of numerical experiments indicates that choices pertaining to (i) the weighting of the inverse distance interpolation function and (ii) the problem dimension can be used to construct problems that are challenging to all tested multi-objective search paradigms. This in turn means that the new multi-objective ICOPs problems (MO-ICOPs) can be used to construct well-balanced benchmark sets that discriminate well between the run-time convergence behaviour of different solvers
- âŠ