Keplerian integrals, elimination theory and identification of very short arcs in a large database of optical observations
Giovanni Federico Gronchi, Giulio Bau, Andrea Milani

TL;DR
This paper develops efficient algebraic methods based on Keplerian integrals and elimination theory to link very short arc observations of asteroids across multiple nights, improving orbit determination accuracy.
Contribution
It introduces a polynomial-based approach for linking multiple VSAs using conservation laws, with optimal degree properties and comparable complexity to classical methods.
Findings
The polynomial degree for linking two VSAs is reduced to 9, optimizing computational efficiency.
A new method for linking three VSAs achieves similar complexity to Gauss' method but with potentially higher accuracy.
Numerical tests show improved solution selection and accuracy over traditional approaches.
Abstract
The modern optical telescopes produce a huge number of asteroid observations, that are grouped into very short arcs (VSAs), each containing a few observations of the same object in one single night. To decide whether two VSAs, collected in different nights, refer to the same observed object we can attempt to compute an orbit with the observations of both arcs: this is called the linkage problem. Since the number of orbit computations to be performed is very large, we need efficient methods of orbit determination. Using the first integrals of Kepler's motion we can write algebraic equations for the linkage problem, which can be put in polynomial form. The equations introduced in (Gronchi et al. 2015) can be reduced to a univariate polynomial of degree 9: the unknown is the topocentric distance of the observed body at the mean epoch of one of the VSAs. Using elimination theory we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
