Efficient intra- and inter-night linking of asteroid detections using kd-trees

July 2007 • 2007Icar..189..151K

Authors • Kubica, Jeremy • Denneau, Larry • Grav, Tommy • Heasley, James • Jedicke, Robert • Masiero, Joseph • Milani, Andrea • Moore, Andrew • Tholen, David • Wainscoat, Richard J.

Abstract • The Panoramic Survey Telescope and Rapid Response System (Pan-STARRS) under development at the University of Hawaii's Institute for Astronomy is creating the first fully automated end-to-end Moving Object Processing System (MOPS) in the world. It will be capable of identifying detections of moving objects in our solar system and linking those detections within and between nights, attributing those detections to known objects, calculating initial and differentially corrected orbits for linked detections, precovering detections when they exist, and orbit identification. Here we describe new kd-tree and variable-tree algorithms that allow fast, efficient, scalable linking of intra and inter-night detections. Using a pseudo-realistic simulation of the Pan-STARRS survey strategy incorporating weather, astrometric accuracy and false detections we have achieved nearly 100% efficiency and accuracy for intra-night linking and nearly 100% efficiency for inter-night linking within a lunation. At realistic sky-plane densities for both real and false detections the intra-night linking of detections into 'tracks' currently has an accuracy of 0.3%. Successful tests of the MOPS on real source detections from the Spacewatch asteroid survey indicate that the MOPS is capable of identifying asteroids in real data.

Links

• PREPRINT http://arxiv.org/abs/astro-ph/0703475
• ELECTR https://doi.org/10.1016%2Fj.icarus.2007.01.008
• SPIRES http://inspirehep.net/search?p=find+eprint+astro-ph/0703475