Innovative observing strategy and orbit determination for Low Earth Orbit Space Debris

We present the results of a large scale simulation, reproducing the behavior of a data center for the build-up and maintenance of a complete catalog of space debris in the upper part of the low Earth orbits region (LEO). The purpose is to determine the performances of a network of advanced optical sensors, through the use of the newest orbit determination algorithms developed by the Department of Mathematics of Pisa (DM). Such a network has been proposed to ESA in the Space Situational Awareness (SSA) framework by Carlo Gavazzi Space SpA (CGS), Istituto Nazionale di Astrofisica (INAF), DM, and Istituto di Scienza e Tecnologie dell'Informazione (ISTI-CNR). The conclusion is that it is possible to use a network of optical sensors to build up a catalog containing more than 98% of the objects with perigee height between 1100 and 2000 km, which would be observable by a reference radar system selected as comparison. It is also possible to maintain such a catalog within the accuracy requirements motivated by collision avoidance, and to detect catastrophic fragmentation events. However, such results depend upon specific assumptions on the sensor and on the software technologies

Orbit Determination with the two-body Integrals

We investigate a method to compute a finite set of preliminary orbits for solar system bodies using the first integrals of the Kepler problem. This method is thought for the applications to the modern sets of astrometric observations, where often the information contained in the observations allows only to compute, by interpolation, two angular positions of the observed body and their time derivatives at a given epoch; we call this set of data attributable. Given two attributables of the same body at two different epochs we can use the energy and angular momentum integrals of the two-body problem to write a system of polynomial equations for the topocentric distance and the radial velocity at the two epochs. We define two different algorithms for the computation of the solutions, based on different ways to perform elimination of variables and obtain a univariate polynomial. Moreover we use the redundancy of the data to test the hypothesis that two attributables belong to the same body (linkage problem). It is also possible to compute a covariance matrix, describing the uncertainty of the preliminary orbits which results from the observation error statistics. The performance of this method has been investigated by using a large set of simulated observations of the Pan-STARRS project.Comment: 23 pages, 1 figur

Orbit determination of space objects based on sparse optical data

While building up a catalog of Earth orbiting objects, if the available optical observations are sparse, not deliberate follow ups of specific objects, no orbit determination is possible without previous correlation of observations obtained at different times. This correlation step is the most computationally intensive, and becomes more and more difficult as the number of objects to be discovered increases. In this paper we tested two different algorithms (and the related prototype software) recently developed to solve the correlation problem for objects in geostationary orbit (GEO), including the accurate orbit determination by full least squares solutions with all six orbital elements. Because of the presence in the GEO region of a significant subpopulation of high area to mass objects, strongly affected by non-gravitational perturbations, it was actually necessary to solve also for dynamical parameters describing these effects, that is to fit between 6 and 8 free parameters for each orbit. The validation was based upon a set of real data, acquired from the ESA Space Debris Telescope (ESASDT) at the Teide observatory (Canary Islands). We proved that it is possible to assemble a set of sparse observations into a set of objects with orbits, starting from a sparse time distribution of observations, which would be compatible with a survey capable of covering the region of interest in the sky just once per night. This could result in a significant reduction of the requirements for a future telescope network, with respect to what would have been required with the previously known algorithm for correlation and orbit determination.Comment: 20 pages, 8 figure

Multiple solutions for asteroid orbits: Computational procedure and applications

We describe the Multiple Solutions Method, a one-dimensional sampling of the six-dimensional orbital confidence region that is widely applicable in the field of asteroid orbit determination. In many situations there is one predominant direction of uncertainty in an orbit determination or orbital prediction, i.e., a ``weak'' direction. The idea is to record Multiple Solutions by following this, typically curved, weak direction, or Line Of Variations (LOV). In this paper we describe the method and give new insights into the mathematics behind this tool. We pay particular attention to the problem of how to ensure that the coordinate systems are properly scaled so that the weak direction really reflects the intrinsic direction of greatest uncertainty. We also describe how the multiple solutions can be used even in the absence of a nominal orbit solution, which substantially broadens the realm of applications. There are numerous applications for multiple solutions; we discuss a few problems in asteroid orbit determination and prediction where we have had good success with the method. In particular, we show that multiple solutions can be used effectively for potential impact monitoring, preliminary orbit determination, asteroid identification, and for the recovery of lost asteroids

A Faster Counting Protocol for Anonymous Dynamic Networks

We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links among nodes can change arbitrarily provided that the network is always connected. Tolerating dynamic topologies is crucial in face of mobility and unreliable communication whereas, even if identifiers are available, it might be convenient to ignore them in massive networks with changing topology. Counting is a fundamental task in distributed computing since knowing the size of the system often facilitates the design of solutions for more complex problems. Currently, the best upper bound proved on the running time to compute the exact network size is double-exponential. However, only linear complexity lower bounds are known, leaving open the question of whether efficient Counting protocols for Anonymous Dynamic Networks exist or not. In this paper we make a significant step towards answering this question by presenting a distributed Counting protocol for Anonymous Dynamic Networks which has exponential time complexity. Our algorithm ensures that eventually every node knows the exact size of the system and stops executing the algorithm. Previous Counting protocols have either double-exponential time complexity, or they are exponential but do not terminate, or terminate but do not provide running-time guarantees, or guarantee only an exponential upper bound on the network size. Other protocols are heuristic and do not guarantee the correct count

Innovative methods of correlation and orbit determination for space debris

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, based upon the admissible region, that is the set of the unknown quantities corresponding to possible orbits for objects in Earth orbit (as opposed to both interplanetary orbits and ballistic ones). A similar method has already been successfully used in recent years for the asteroidal case. The second algorithm uses the integrals of the geocentric 2-body motion, which must have the same values at the times of the different observations for a common orbit to exist. We also discuss how to account for the perturbations of the 2-body motion, e.g., the $J_2$ effect.Comment: 18 page