Optimal target assignment for massive spectroscopic surveys

TL;DR

This paper introduces an optimal target assignment algorithm for robotic fiber positioners in cosmological surveys, improving coordination speed and reducing collisions, thereby enhancing the efficiency of large-scale universe mapping.

Contribution

The paper presents a novel cost function-based assignment scheme that optimizes both coordination speed and collision minimization in robotic fiber positioning.

Findings

Improved convergence rates in simulations.

Reduced collision scenarios in both strategies.

Algorithm scales quadratically with full observations.

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.