Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA New Probability-one Homotopy Method for Solving Minimum-Time Low-Thrust Orbital Transfer Problems
182
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Homotopy methods have been widely utilized to solve low-thrust orbital transfer problems, however, it is not guaranteed that the optimal solution can be obtained by the existing homotopy methods. In this paper, a new homotopy method is presented, by which the optimal solution can be found with probability one. Generalized sufficient conditions, which are derived from the parametrized Sards theorem, are first developed. A new type of probability-one homotopy formulation, which is custom-designed for solving minimum-time low-thrust trajectory optimization problems and satisfies all these sufficient conditions, is then constructed. By tracking the continuous zero curve initiated by an initial problem with known solution, the optimal solution of the original problem is guaranteed to be solved with probability one. Numerical demonstrations in a three-dimensional time-optimal low-thrust orbital transfer problem with 43 revolutions is presented to illustrate the applications of the method.
rate research
Read More
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (emph{e.g.} Newton-Raphson method). A sole solution is obtained whereas many exist. However the number of solutions can be exponential and methods should provide solutions close to a sketch drawn by the user.Geometric reasoning can help to simplify the underlying system of equations by changing a few equations and triangularizing it.This triangularization is a geometric construction of solutions, called construction plan. We aim at finding several solutions close to the sketch on a one-dimensional path defined by a global parameter-homotopy using a construction plan. Some numerical instabilities may be encountered due to specific geometric configurations. We address this problem by changing on-the-fly the construction plan.Numerical results show that this hybrid method is efficient and robust.
We propose a reachability approach for infinite and finite horizon multi-objective optimization problems for low-thrust spacecraft trajectory design. The main advantage of the proposed method is that the Pareto front can be efficiently constructed from the zero level set of the solution to a Hamilton-Jacobi-Bellman equation. We demonstrate the proposed method by applying it to a low-thrust spacecraft trajectory design problem. By deriving the analytic expression for the Hamiltonian and the optimal control policy, we are able to efficiently compute the backward reachable set and reconstruct the optimal trajectories. Furthermore, we show that any reconstructed trajectory will be guaranteed to be weakly Pareto optimal. The proposed method can be used as a benchmark for future research of applying reachability analysis to low-thrust spacecraft trajectory design.
Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function. We propose a new parameter fitting method, Minimum Probability Flow (MPF), which is applicable to any parametric model. We demonstrate parameter estimation using MPF in two cases: a continuous state space model, and an Ising spin glass. In the latter case it outperforms current techniques by at least an order of magnitude in convergence time with lower error in the recovered coupling parameters.
We introduce a new technique to solve period problems on minimal surfaces called limit-method. If a family of surfaces has Weierstrass-data converging to the data of a known example, and this presents a transversal solution of periods, then the original family contains a sub-family with closed periods.
Consider using the right-preconditioned generalized minimal residual (AB-GMRES) method, which is an efficient method for solving underdetermined least squares problems. Morikuni (Ph.D. thesis, 2013) showed that for some inconsistent and ill-conditioned problems, the iterates of the AB-GMRES method may diverge. This is mainly because the Hessenberg matrix in the GMRES method becomes very ill-conditioned so that the backward substitution of the resulting triangular system becomes numerically unstable. We propose a stabilized GMRES based on solving the normal equations corresponding to the above triangular system using the standard Cholesky decomposition. This has the effect of shifting upwards the tiny singular values of the Hessenberg matrix which lead to an inaccurate solution. Thus, the process becomes numerically stable and the system becomes consistent, rendering better convergence and a more accurate solution. Numerical experiments show that the proposed method is robust and efficient for solving inconsistent and ill-conditioned underdetermined least squares problems. The method can be considered as a way of making the GMRES stable for highly ill-conditioned inconsistent problems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
