Capability of a space-based space surveillance system to detect and track objects in GEO, MEO and LEO orbits

In this paper we present the results from the coverage and the orbit determination accuracy simulations performed within the recently completed ESA study “Assessment Study for Space Based Space Surveillance (SBSS) Demonstration System” (Airbus Defence and Space consortium). This study consisted in investigating the capability of a space based optical sensor (SBSS) orbiting in low Earth orbit (LEO) to detect and track objects in GEO (geosynchronous orbit), MEO (medium Earth orbit) and LEO and to determinate and improve initial orbits from such observations. Space based systems may achieve better observation conditions than ground based sensors in terms of astrometric accuracy, detection coverage, and timeliness. The primary observation mode of the proposed SBSS demonstrator is GEO surveillance, i.e. the systematic search and detection of unknown and known objects. GEO orbits are specific and unique orbits from dynamical point of view. A space-based sensor may scan the whole GEO ring within one sidereal day if the orbit and pointing directions are chosen properly. For an efficient survey, our goal was to develop a leak-proof GEO fence strategy. Collaterally, we show that also MEO, LEO and other (GTO,Molniya, etc.) objects would be possible to observe by the system and for a considerable number of LEO objects to down to size of 1 cm we can obtain meaningful statistical data for improvement and validation of space debris environment models

A Genetic Algorithm to associate optical measurements and estimate orbits of geocentric objects

Cataloging geocentric objects can be put in the framework of Multiple Target Tracking (MTT). Current work tends to focus on the S = 2 MTT problem because of its favorable computational complexity of O(n²). The MTT problem becomes NP-hard for a dimension of S˃3. The challenge is to find an approximation to the solution within a reasonable computation time. To effciently approximate this solution a Genetic Algorithm is used. The algorithm is applied to a simulated test case. These results represent the first steps towards a method that can treat the S˃3 problem effciently and with minimal manual intervention.

Associating optical measurements and estimating orbits of geocentric objects through population-based meta-heuristic methods

Currently several thousands of objects are being tracked in the MEO and GEO regions through optical means. The problem faced in this framework is that of Multiple Target Tracking (MTT). In this context both, the correct associations among the observations and the orbits of the objects have to be determined. The complexity of the MTT problem is defined by its dimension S. The number S corresponds to the number of fences involved in the problem. Each fence consists of a set of observations where each observation belongs to a different object. The S ≥ 3 MTT problem is an NP-hard combinatorial optimization problem. There are two general ways to solve this. One way is to seek the optimum solution, this can be achieved by applying a branch-and- bound algorithm. When using these algorithms the problem has to be greatly simplified to keep the computational cost at a reasonable level. Another option is to approximate the solution by using meta-heuristic methods. These methods aim to efficiently explore the different possible combinations so that a reasonable result can be obtained with a reasonable computational effort. To this end several population-based meta-heuristic methods are implemented and tested on simulated optical measurements. With the advent of improved sensors and a heightened interest in the problem of space debris, it is expected that the number of tracked objects will grow by an order of magnitude in the near future. This research aims to provide a method that can treat the correlation and orbit determination problems simultaneously, and is able to efficiently process large data sets with minimal manual intervention.

Decision Support Models for Composing and Navigating through e-Learning Objects

Libraries of learning objects may serve as basis for deriving course offerings that are customized to the needs of different learning communities or even individuals. Several ways of organizing this course composition process are discussed. Course composition needs a clear understanding of the dependencies between the learning objects. Therefore we discuss the metadata for object relationships proposed in different standardization projects and especially those suggested in the Dublin Core Metadata Initiative. Based on these metadata we construct adjacency matrices and graphs. We show how Gozinto-type computations can be used to determine direct and indirect prerequisites for certain learning objects. The metadata may also be used to define integer programming models which can be applied to support the instructor in formulating his specifications for selecting objects or which allow a computer agent to automatically select learning objects. Such decision models could also be helpful for a learner navigating through a library of learning objects. We also sketch a graph-based procedure for manual or automatic sequencing of the learning objects.