Optimal target assignment for massive spectroscopic surveys

Abstract

Robotics have recently contributed to cosmological spectroscopy to automatically obtain the map of the observable universe using robotic fiber positioners. For this purpose, an assignment algorithm is required to assign each robotic fiber positioner to a target associated with a particular observation. The assignment process directly impacts on the coordination of robotic fiber positioners to reach their assigned targets. In this paper, we establish an optimal target assignment scheme which simultaneously provides the fastest coordination accompanied with the minimum of colliding scenarios between robotic fiber positioners. In particular, we propose a cost function by whose minimization both of the cited requirements are taken into account in the course of a target assignment process. The applied simulations manifest the improvement of convergence rates using our optimal approach. We show that our algorithm scales the solution in quadratic time in the case of full observations. Additionally, the convergence time and the percentage of the colliding scenarios are also decreased in both supervisory and hybrid coordination strategies.

References in corpus (6)

• The Sloan Digital Sky Survey: Technical Summary
• Extragalactic Science, Cosmology and Galactic Archaeology with the Subaru Prime Focus Spectrograph (PFS)
• An Efficient Algorithm for Positioning Tiles in the Sloan Digital Sky Survey
• Fiber Assignment in Next-generation Wide-field Spectrographs
• Complete coordination of robotic fiber positioners for massive spectroscopic surveys
• Supervisory Coordination of Robotic Fiber Positioners in Multi-Object Spectrographs

Cited by in corpus (2)

• Astrobotics: Swarm Robotics for Astrophysical Studies
• Experimental evaluation of complete safe coordination of astrobots for Sloan Digital Sky Survey V