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

In earlier published work, it was proposed that light speed was larger in the early universe by 30 orders of magnitude compared to its presently observed value. This change in the speed of light is associated with a spontaneous breaking of…

We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set ${\cal T}$ of trajectories in the plane, and an integer $k\geq 2$, we seek to compute a set of $k$ points (``portals'') to…

In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…

Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although many works appear on this topic, all current algorithms…

Transit timing variations - deviations from strict periodicity between successive passages of a transiting planet - can be used to probe the structure and dynamics of multiple-planet systems. In this paper, we examine prospects for…

A linear programming (LP) model is proposed to improve the performance of a controlled freeway during an emergency evacuation. Based on reasonable assumptions, the main relationships among key factors are kept without the uncertain impact…

We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…

In this paper, we present a new method for the solution of those linear transport processes that may be described by a Master Equation, such as electron, neutron and photon transport, and more exotic variants thereof. We base our algorithm…

Link Streams were proposed a few years ago as a model of temporal networks. We seek to understand the topological and temporal nature of those objects through efficiently computing the distances, latencies and lengths of shortest fastest…

The electromagnetic self-force equation of motion is known to be afflicted by the so-called runaway problem. A similar problem arises in the semiclassical Einstein's field equation and plagues the self-consistent semiclassical evolution of…

The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…

The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances…

We address a fundamental challenge in space mission design and space logistics: planning interplanetary trajectories for missions that must rendezvous with multiple bodies. Such mission occur, for instance, in active debris removal,…

The maximum capacity path problem is to find a path from a source to a sink which has the maximum capacity among all paths. This paper addresses an extension of this problem which considers loss factors. It is called the generalized maximum…

In the circular restricted three-body problem, low energy transit orbits are revealed by linearizing the governing differential equations about the collinear Lagrange points. This procedure fails when time-periodic perturbations are…

The standard way to construct a path integral is to use a Legendre transformation to find the hamiltonian, to repeatedly insert complete sets of states into the time-evolution operator, and then to integrate over the momenta. This procedure…

In this paper we consider the fuel-optimal rendezvous between a satellite and a spacecraft in a central force field with a drag force that is linear in the velocity. In this general setting we linearize the equations of motion of the…

We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…

A data-driven procedure for identifying the dominant transport barriers in a time-varying flow from limited quantities of Lagrangian data is presented. Our approach partitions state space into pairs of coherent sets, which are sets of…

Fitting model parameters to experimental data is a common yet often challenging task, especially if the model contains many parameters. Typically, algorithms get lost in regions of parameter space in which the model is unresponsive to…