Related papers: On the minimum orbital intersection distance compu…
Inspired by the recent 11th Global Trajectory Optimisation Competition, this paper presents the asteroid routing problem (ARP) as a realistic benchmark of algorithms for expensive bound-constrained black-box optimization in permutation…
Periodic orbits are important objects of discrete dynamical systems, but finding them is not always easy. We present a self-contained introductory account, aimed at non-experts, to prove their existence and study their stability using the…
This paper proposes a solution for multiple-impulse orbital maneuvers near circular orbits for special cases where orbital observations are not globally available and the spacecraft is being observed through a limited window from a ground…
Space debris is a major threat to the satellite infrastructure. A collision with even small particle, e.g. 1 cm of size, can cause a catastrophic event when the parent body, spacecraft or upper stage, will break up into hundreds of…
Over 34,000 objects bigger than 10 cm in length are known to orbit Earth. Among them, only a small percentage are active satellites, while the rest of the population is made of dead satellites, rocket bodies, and debris that pose a…
Building and maintaining a space object catalog is necessary for space situational awareness. To realize this, one great challenge is uncooperative spacecraft maneuver detection because unknown maneuver events can lead to deviated orbital…
Several celestial bodies in co-orbital configurations exist in the solar system. However, co-orbital exoplanets have not yet been discovered. This lack may result from a degeneracy between the signal induced by co-orbital planets and other…
We introduce an efficient framework for computing the distance between collider events using the tools of Linearized Optimal Transport (LOT). This preserves many of the advantages of the recently-introduced Energy Mover's Distance, which…
The knowledge of the orbit or the ephemeris uncertainty of asteroid presents a particular interest for various purposes. These quantities are for instance useful for recovering asteroids, for identifying lost asteroids or for planning…
We introduce a new method to perform preliminary orbit determination for space debris on low Earth orbits (LEO). This method works with tracks of radar observations: each track is composed by $n\ge 4$ topocentric position vectors per pass…
A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and…
For two multisets $S$ and $T$ of points in $[\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e.,…
In this work, we propose a method to efficiently compute smooth, time-optimal trajectories for micro aerial vehicles (MAVs) evading a moving obstacle. Our approach first computes an n-dimensional trajectory from the start- to an arbitrary…
Spacecraft collision avoidance procedures have become an essential part of satellite operations. Complex and constantly updated estimates of the collision risk between orbiting objects inform the various operators who can then plan risk…
We present a procedure for determination of positions and orbital elements, and associated uncertainties, of outer Solar System planets. The orbit-fitting procedure is greatly streamlined compared to traditional methods because acceleration…
Collision-tolerant trajectory planning is the consideration that collisions, if they are planned appropriately, enable more effective path planning for robots capable of handling them. A mixed integer programming (MIP) optimization…
Context: Various ideas have been proposed to explain the formation of the Geminid meteoroid stream from the asteroid (3200) Phaethon. However, little has been studied about the Geminid formation based on the assumption that mass ejection…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
This paper investigates the mission planning problem for spacecraft confronting orbital debris to achieve autonomous avoidance. Firstly, combined with the avoidance requirements, a closed-loop framework of autonomous avoidance for orbital…
We propose a densification algorithm to improve the Line Of Variations (LOV) method for impact monitoring, which can fail when the information is too little, as it may happen in difficult cases. The LOV method uses a 1-dimensional sampling…