A differential evolution-based optimization tool for interplanetary transfer trajectory design

• URL: http://arxiv.org/abs/2011.06780v3
• Date: Tue, 13 Apr 2021 13:55:31 GMT
• Title: A differential evolution-based optimization tool for interplanetary transfer trajectory design
• Authors: Mingcheng Zuo, Guangming Dai, Lei Peng, Zhe Tang
• Abstract summary: A powerful differential evolution-based optimization tool named COoperative Differential Evolution (CODE) is proposed in this paper. CODE employs a two-stage evolutionary process, which concentrates on learning global structure in the earlier process, and tends to self-adaptively learn the structures of different local spaces. For the most complicated Messenger (full) problem, the found best solution with objective function equaling to 3.38 km/s is still a level that other swarm intelligent algorithms cannot easily reach.
• Score: 0.5792385818430937
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The extremely sensitive and highly nonlinear search space of interplanetary transfer trajectory design bring about big challenges on global optimization. As a representative, the current known best solution of the global trajectory optimization problem (GTOP) designed by the European space agency (ESA) is very hard to be found. To deal with this difficulty, a powerful differential evolution-based optimization tool named COoperative Differential Evolution (CODE) is proposed in this paper. CODE employs a two-stage evolutionary process, which concentrates on learning global structure in the earlier process, and tends to self-adaptively learn the structures of different local spaces. Besides, considering the spatial distribution of global optimum on different problems and the gradient information on different variables, a multiple boundary check technique has been employed. Also, Covariance Matrix Adaptation Evolutionary Strategies (CMA-ES) is used as a local optimizer. The previous studies have shown that a specific swarm intelligent optimization algorithm usually can solve only one or two GTOP problems. However, the experimental test results show that CODE can find the current known best solutions of Cassini1 and Sagas directly, and the cooperation with CMA-ES can solve Cassini2, GTOC1, Messenger (reduced) and Rosetta. For the most complicated Messenger (full) problem, even though CODE cannot find the current known best solution, the found best solution with objective function equaling to 3.38 km/s is still a level that other swarm intelligent algorithms cannot easily reach.

Related papers

• Global Search for Optimal Low Thrust Spacecraft Trajectories using Diffusion Models and the Indirect Method [0.0]
  Long time-duration low-thrust nonlinear optimal spacecraft trajectory global search is a computationally and time expensive problem. Generative machine learning models can be trained to learn how the solution structure varies with respect to a conditional parameter. State-of-the-art diffusion models are integrated with the indirect approach for trajectory optimization within a global search framework.
  arXiv  Detail & Related papers  (2025-01-13T01:49:17Z)
• SPGD: Steepest Perturbed Gradient Descent Optimization [0.0]
  This paper presents the Steepest Perturbed Gradient Descent (SPGD) algorithm. It is designed to generate a set of candidate solutions and select the one exhibiting the steepest loss difference. Preliminary results show a substantial improvement over four established methods.
  arXiv  Detail & Related papers  (2024-11-07T18:23:30Z)
• Learning Multiple Initial Solutions to Optimization Problems [52.9380464408756]
  Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications. We propose learning to predict emphmultiple diverse initial solutions given parameters that define the problem instance. We find significant and consistent improvement with our method across all evaluation settings and demonstrate that it efficiently scales with the number of initial solutions required.
  arXiv  Detail & Related papers  (2024-11-04T15:17:19Z)
• Path Signatures for Diversity in Probabilistic Trajectory Optimisation [24.101232487591094]
  Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. Recent advancements in computing hardware allow for parallel trajectory optimisation where multiple solutions are obtained simultaneously. We propose an algorithm for parallel trajectory optimisation that promotes diversity over the range of solutions, therefore avoiding mode collapses.
  arXiv  Detail & Related papers  (2023-08-08T06:10:53Z)
• Fighting the curse of dimensionality: A machine learning approach to finding global optima [77.34726150561087]
  This paper shows how to find global optima in structural optimization problems. By exploiting certain cost functions we either obtain the global at best or obtain superior results at worst when compared to established optimization procedures.
  arXiv  Detail & Related papers  (2021-10-28T09:50:29Z)
• A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs [91.07247251502564]
  We propose a hybrid approach to combine the best of the two worlds, in which a bi-level framework is developed with an upper-level learning method to optimize the graph. Such a bi-level approach simplifies the learning on the original hard CO and can effectively mitigate the demand for model capacity.
  arXiv  Detail & Related papers  (2021-06-09T09:18:18Z)
• A Framework for Discovering Optimal Solutions in Photonic Inverse Design [0.0]
  Photonic inverse design has emerged as an indispensable engineering tool for complex optical systems. Finding solutions approaching global optimum may present a computationally intractable task. We develop a framework that allows expediting the search of solutions close to global optimum on complex optimization spaces.
  arXiv  Detail & Related papers  (2021-06-03T22:11:03Z)
• AutoSpace: Neural Architecture Search with Less Human Interference [84.42680793945007]
  Current neural architecture search (NAS) algorithms still require expert knowledge and effort to design a search space for network construction. We propose a novel differentiable evolutionary framework named AutoSpace, which evolves the search space to an optimal one. With the learned search space, the performance of recent NAS algorithms can be improved significantly compared with using previously manually designed spaces.
  arXiv  Detail & Related papers  (2021-03-22T13:28:56Z)
• Evolutionary Gait Transfer of Multi-Legged Robots in Complex Terrains [14.787379075870383]
  This paper proposes a transfer learning-based evolutionary framework for gait optimization, named Tr-GO. The idea is to initialize a high-quality population by using the technique of transfer learning, so any kind of population-based optimization algorithms can be seamlessly integrated into this framework. The experimental results show the effectiveness of the proposed framework for the gait optimization problem based on three multi-objective evolutionary algorithms.
  arXiv  Detail & Related papers  (2020-12-24T16:41:36Z)
• Domain Adaptive Person Re-Identification via Coupling Optimization [58.567492812339566]
  Domain adaptive person Re-Identification (ReID) is challenging owing to the domain gap and shortage of annotations on target scenarios. This paper proposes a coupling optimization method including the Domain-Invariant Mapping (DIM) method and the Global-Local distance Optimization ( GLO) GLO is designed to train the ReID model with unsupervised setting on the target domain.
  arXiv  Detail & Related papers  (2020-11-06T14:01:03Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)
• sKPNSGA-II: Knee point based MOEA with self-adaptive angle for Mission Planning Problems [2.191505742658975]
  Some problems have many objectives which lead to a large number of non-dominated solutions. This paper presents a new algorithm that has been designed to obtain the most significant solutions. This new algorithm has been applied to the real world application in Unmanned Air Vehicle (UAV) Mission Planning Problem.
  arXiv  Detail & Related papers  (2020-02-20T17:07:08Z)
• Self-Directed Online Machine Learning for Topology Optimization [58.920693413667216]
  Self-directed Online Learning Optimization integrates Deep Neural Network (DNN) with Finite Element Method (FEM) calculations. Our algorithm was tested by four types of problems including compliance minimization, fluid-structure optimization, heat transfer enhancement and truss optimization. It reduced the computational time by 2 5 orders of magnitude compared with directly using methods, and outperformed all state-of-the-art algorithms tested in our experiments.
  arXiv  Detail & Related papers  (2020-02-04T20:00:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.