Related papers: A New Probability-one Homotopy Method for Solving …
This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…
This work focuses on minimum-time low-thrust orbit transfers from a prescribed low Earth orbit to a specified low lunar orbit. The well-established indirect formulation of minimum-time orbit transfers is extended to a multibody dynamical…
Emerging applications in autonomy require control techniques that take into account uncertain environments, communication and sensing constraints, while satisfying highlevel mission specifications. Motivated by this need, we consider a…
We consider solving the $\ell_1$-regularized least-squares ($\ell_1$-LS) problem in the context of sparse recovery, for applications such as compressed sensing. The standard proximal gradient method, also known as iterative…
The design of transfers to periodic orbits in the Earth-Moon system has regained prominence with NASA's Artemis and CNSA's Chang'e programs. This work addresses the problem of linking ballistic capture trajectories - exploiting multi-body…
Adaptive methods for derivation of analytical and numerical solutions of heat diffusion in one dimensional thin rod have investigated. Comperhensive comparsion analysis based on the homotopy perturbation method (HPM) and finite difference…
We introduce a novel numerical method, named the Robin Hood method, of solving electrostatic problems. The approach of the method is closest to the boundary element methods, although significant conceptual differences exist with respect to…
In this paper, we present an application of the optimal control theory to orbital transfer of Low Earth Orbit satellites. The optimal control problem is treated with Dynamic Programming techniques which require solving the…
In this paper, we introduce a homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of two-person zero-sum discounted stochastic ARAT game. We show that the algorithm has the…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
In this work, we develop a collection of novel methods for the entropic-regularised optimal transport problem, which are inspired by existing mirror descent interpretations of the Sinkhorn algorithm used for solving this problem. These are…
A deep-space exploration mission with low-thrust propulsion to rendezvous with multiple asteroids is investigated. Indirect methods, based on the optimal control theory, are implemented to optimize the fuel consumption. The application of…
We propose a homotopy sampling procedure, loosely based on importance sampling. Starting from a known probability distribution, the homotopy procedure generates the unknown normalization of a target distribution. In the context of…
The commercial interest in producing low-cost space missions by exploiting the superior propellant management of low-thrust propulsion technology has become increasingly popular. Typical to such missions is the design of transfer…
The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two-dimensional bounded Euclidean space is developed, which can…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
The Lambert problem originated in orbital mechanics. It concerns with determining the initial velocity for a boundary value problem involving the dynamical constraint due to gravitational potential with additional time horizon and endpoint…
In this paper, the time- and propellant-optimal low-thrust rephasing problems in circular orbit are studied to depict their solution spaces in an atlas. The number of key parameters that settle the rephasing problems is reduced by…
Replacing the quadratic proximal penalty familiar from Hilbert spaces by an unbalanced optimal transport distance, we develop forward-backward type optimisation methods in spaces of Radon measures. We avoid the actual computation of the…
The Quickest Transshipment Problem is to route flow as quickly as possible from sources with supplies to sinks with demands in a network with capacities and transit times on the arcs. It is of fundamental importance for numerous…