相关论文: An elementary solution to Lambert's problem

We consider a parabolic version of the mass transport problem, and show that it converges to a solution of the original mass transport problem under suitable conditions on the cost function, and initial and target domains.

We briefly report on our method [Fiore JPA 2017] of simplifying the equations of motion of charged particles in an electromagnetic field that is the sum of a plane travelling wave and a static part; it is based on changes of the dependent…

We discuss methods of Optimal Transportation Theory and its relations to problems in quantum mechanics. This essentially means that the cost function is some Hamiltonian $H(q,p)$ on a phase space (symplectic manifold), and the marginal…

A novel method is presented and explored within the framework of Potts neural networks for solving optimization problems with a non-trivial topology, with the airline crew scheduling problem as a target application. The key ingredient to…

Optimal transport has gained significant attention in recent years due to its effectiveness in deep learning and computer vision. Its descendant metric, the Wasserstein distance, has been particularly successful in measuring distribution…

A simple procedure is developed to determine orbital elements of an object orbiting in a central force field which contribute more than three independent celestial positions. By manipulation of formal three point Gauss method of orbit…

Geometry of relativistic jets in active galaxies provides important information about mechanisms of launching, collimation and acceleration of plasma flow. We propose a new method to probe a boundary shape of a jet on parsec scales -- in…

The landing and takeoff operations for an airport at any given day are described in terms of the capacity envelopes associated to runway system configurations, of the scheduled flights along the day and of predefined delay tolerances for…

Multi-agent Path Finding (MAPF) is the problem of planning collision-free movements of agents so that they get from where they are to where they need to be. Commonly, agents are located on a graph and can traverse edges. This problem has…

We define the Landau problem on two-dimensional surfaces of revolution of the second order: ellipsoid, hyperboloid and paraboloid. We start form the two-center MICZ-Kepler system Hamiltonian and then making the reduction into the various…

The motion of overdamped particles in a one-dimensional spatially-periodic potential is considered. The potential is also randomly-fluctuating in time, due to multiplicative colored noise terms, and has a deterministic tilt. Numerical…

Destination passing -- aka. out parameters -- is taking a parameter to fill rather than returning a result from a function. Due to its apparently imperative nature, destination passing has struggled to find its way to pure functional…

Numerical transfer matrices have been widely used in the study of wave propagation and scattering. These may be viewed as descretizations of a recently introduced fundamental notion of transfer matrix which admits a representation in terms…

Two-point boundary value problems for cislunar trajectories present significant challenges in circler restricted three body problem, making traditional analytical methods like Lambert's problem inapplicable. This study proposes a novel…

The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\mu : P \to \mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\tau : P \times…

In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which $k$ robots occupy $k$ distinct starting gridpoints and need to reach $k$ distinct destination gridpoints. In each time step, any robot may move to a neighboring…

A significant fraction of an exoplanet transit model evaluation time is spent calculating projected distances between the planet and its host star. This is a relatively fast operation for a circular orbit, but slower for an eccentric one.…

This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be fullfiled over a multi-day planning horizon. Unlike some…

We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude to reach our aim to meet these qualities of generic,…

We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and…