Related papers: On the minimum orbital intersection distance compu…
We extend our previous algorithm computing the minimum orbital intersection distance (MOID) to include hyperbolic orbits, and mixed combinations ellipse--hyperbola. The MOID is computed by finding all stationary points of the distance…
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 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.…
The catalog of km-sized near-Earth objects (NEOs) is nearly complete. Typical impact monitoring analyses search for possible impacts over the next 100 years and none of the km-sized objects represent an impact threat over that time…
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…
In this paper, the minimum orbit intersection distances (MOIDs) of near-Earth asteroids (NEAs) over the next 200 years were computed and analyzed in detail. It was shown that the MOID of a NEA relative to the Earth-Moon barycenter (EMB) is…
This paper presents an analysis of optimal impact strategies to deflect potentially dangerous asteroids. To compute the increase in the minimum orbit intersection distance of the asteroid due to an impact with a spacecraft, simple…
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…
The interest in the problem of small asteroids observed shortly before a deep close approach or an impact with the Earth has grown a lot in recent years. Since the observational dataset of such objects is very limited, they deserve…
A method is developed to calculate collision probability in this paper. Based on the encounter geometric features of space objects, it is reasonable to separate the radial orbital motions from that in the cross section for most encounter…
A central aspect of robotic motion planning is collision avoidance, where a multitude of different approaches are currently in use. Optimization-based motion planning is one method, that often heavily relies on distance computations between…
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…
When an asteroid has a few observations over a short time span the information contained in the observational arc could be so little that a full orbit determination may be not possible. One of the methods developed in recent years to…
Short-arc orbit determination is crucial when an asteroid is first discovered. In these cases usually the observations are so few that the differential correction procedure may not converge. We have developed an initial orbit computation…
The proliferation of space debris in LEO has become a major concern for the space industry. With the growing interest in space exploration, the prediction of potential collisions between objects in orbit has become a crucial issue. It is…
An analytical formulation for collision avoidance maneuvers involving a spacecraft and a space debris is presented, including solutions for the maximum deviation and minimum collision probability cases. Gauss' planetary equations and…
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 have made an extensive search for grouping amongst the near Earth asteroids (NEAs). We used two D- functions and rigorous cluster analysis approach. We have found sev- eral new groups (associations) among the NEAs: the objects moving on…
We propose two algorithms to provide a full preliminary orbit of an Earth-orbiting object with a number of observations lower than the classical methods, such as those by Laplace and Gauss. The first one is the Virtual debris algorithm,…
This work introduces the problem of initial orbit determination (IOD) from only heading measurements. Such a problem occurs in practice when estimating the orbit of a spacecraft using visual odometry measurements from an optical camera.…