Related papers: Fast error-safe MOID computation involving hyperbo…
We present an algorithm to compute the minimum orbital intersection distance (MOID), or global minimum of the distance between the points lying on two Keplerian ellipses. This is achieved by finding all stationary points of the distance…
The computation of the Minimum Orbital Intersection Distance (MOID) is an old, but increasingly relevant problem. Fast and precise methods for MOID computation are needed to select potentially hazardous asteroids from a large catalogue. The…
The minimum orbital intersection distance is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications.…
We obtain a lower bound of the distance function (MOID) between two noncoplanar bounded Keplerian orbits (either circular or elliptic) with a common focus. This lower bound is positive and vanishes if and only if the orbits intersect. It is…
The increasing congestion in the near-Earth space environment has amplified the need for robust and efficient conjunction analysis techniques including the computation of the minimum distance between orbital paths in the presence of…
We consider the Keplerian distance $d$ in the case of two elliptic orbits, i.e. the distance between one point on the first ellipse and one point on the second one, assuming they have a common focus. The absolute minimum $d_{\rm min}$ of…
In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…
An algorithm for robust initial orbit determination (IOD) under perturbed orbital dynamics is presented. By leveraging map inversion techniques defined in the algebra of Taylor polynomials, this tool returns a highly accurate solution to…
We present the results of our investigation on the use of the two-body integrals to compute preliminary orbits by linking too short arcs of observations of celestial bodies. This work introduces a significant improvement with respect to the…
Initial Orbit Determination (IOD) is the classical problem of estimating the orbit of a body in space without any presumed information about the orbit. The geometric formulation of the ''angles-only'' IOD in three-dimensional space: find a…
We construct a highly-symmetric periodic orbit of eight bodies in three dimensions. In this orbit, each body collides with its three nearest neighbors in a regular periodic fashion. Regularization of the collisions in the orbit is achieved…
We introduce a new algorithm for the calculation of multidimensional optical depths in approximate radiative transport schemes, equally applicable to neutrinos and photons. Motivated by (but not limited to) neutrino transport in…
In this paper, we look into the minimum obstacle displacement (MOD) planning problem from a mobile robot motion planning perspective. This problem finds an optimal path to goal by displacing movable obstacles when no path exists due to…
We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by $m$ hyperplanes, and the minimum enclosing ball (MinEB) of a set of $n$ points, both in…
Hyperbolic polynomials is a class of real-roots polynomials that has wide range of applications in theoretical computer science. Each hyperbolic polynomial also induces a hyperbolic cone that is of particular interest in optimization due to…
The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…
This paper develops a robust angles-only IROD method based on polynomial optimization for arbitrary nonlinear dynamics. First, the relative motion is approximated by high-order Taylor polynomials within the differential algebra framework,…
The radii polynomial approach is an a posteriori validation method based on the contraction of a quasi-Newton operator. We apply this strategy to give a computer-assisted proof of a transverse heteroclinic orbit in the Shimizu--Morioka…
We propose a new algorithm to compute a shifted proper orthogonal decomposition (sPOD) for systems dominated by multiple transport velocities. The sPOD is a recently proposed mode decomposition technique which overcomes the poor performance…
We present a method for guaranteed collision detection with toleranced motions. The basic idea is to consider the motion as a curve in the 12-dimensional space of affine displacements, endowed with an object-oriented Euclidean metric, and…