Orbit determination with very short arcs. I admissible regions
- 437 Downloads
Most asteroid discoveries consist of a few astrometric observations over a short time span, and in many cases the amount of information is too limited to compute a full orbit according to the least squares principle. We investigate whether such a Very Short Arc may nonetheless contain significant orbit information, with predictive value, e.g., allowing to compute useful ephemerides with a well defined uncertainty for some time in the future.For short enough arcs, all the significant information is contained in an attributable, consisting of two angles and two angular velocities for a given time; an apparent magnitude is also often available. In this case, no information on the geocentric range r and range-raterdot is available from the observations themselves. However, the values of (r, rdot ) are constrained to a compact subset, the admissible region , if we can assume that the discovered object belongs to the Solar System, is not a satellite of the Earth and is not a shooting star (very small and very close). We give a full algebraic description of the admissible region, including geometric properties like the presence of either one or two connected components.The admissible region can be sampled by selecting a finite number of points in the (r, rdot ) plane, each corresponding to a full set of six initial conditions (given the four component attributable) for the asteroid orbit. Because the admissible region is a region in the plane, it can be described by a triangulation with the selected points as nodes. We show that triangulations with optimal properties, such as theDelaunay triangulations , can be generated by an effective algorithm; however, the optimal triangulation depends upon the choice of a metric in the (r,rdot ) plane.Each node of the triangulation is a Virtual Asteroid, for which it is possible to propagate the orbit and predict ephemerides. Thus for each time there is an image triangulation on the celestial sphere, and it can be used in a way similar to the use of the nominal ephemerides (with their confidence regions) in the classical case of a full least square orbit.
Keywordsasteroid recovery Delaunay triangulation ephemerides orbit determination
Unable to display preview. Download preview PDF.
- Bern, M. and Eppstein, D.: 1992, ‘Mesh Generation and Optimal Triangulation’, In: D. -Z. Du and F. K. Hwang (eds), Computing in Euclidean Geometry, World Scientific, pp. 23–90.Google Scholar
- Bowell, E., Hapke, B., Domingue, D., Lumme, K., Peltoniemi, J., Harris, A.W. 1989‘Application of photometric models to asteroids’Binzel, R.P.Gehrels, T.Matthews, M.S. eds. Asteroids IIUniversity of Arizona PressTucson524556Google Scholar
- Danby, J. M. A. 1989Fundam. Celestial Mech.Willmann-BellRichmondGoogle Scholar
- Delaunay, B.: 1934, ‘Sur la sphere vide’, Izv. Akad. Nauk SSSR, Otdel. Mat. Estestv. Nauk 7, 793–800.Google Scholar
- de’ Michieli Vitturi, M.: 2004, ‘Approximate gradient-based methods for optimum shape design in aerodynamic’, Ph.D. Thesis, University of Pisa.Google Scholar
- Gauss, C. F.: 1809, ‘Theory of the Motion of the Heavenly Bodies Moving about the Sun in Conic Sections’, reprinted by Dover publications, 1963.Google Scholar
- Risler, J. J. 1991‘Méthodes mathematiques pour le CAO Collection Recherche en mathematiques appliquées’RMA 18 MassonGoogle Scholar
- Winslow, A. M.: 1964, ‘An irregular triangle mesh generator’ Report UCXRL-7880, National Technical Information Service, Springfield, VA.Google Scholar