Field Target Allocation and Routing Algorithms for Starbugs
Michael Goodwin, Nuria P. F. Lorente, Christophe Satorre, Sungwook E., Hong, Kyler Kuehn, Jon S. Lawrence

TL;DR
This paper presents algorithms for efficient target allocation and routing of Starbugs robotic devices, aiming to optimize configuration times for high-throughput astronomical surveys.
Contribution
It introduces novel algorithms specifically designed for Starbug target allocation and routing, improving configuration speed for large-scale telescope instruments.
Findings
Algorithms achieve faster configuration times in simulations
Optimized routing reduces target repositioning time
Performance improvements support high multiplex spectroscopic surveys
Abstract
Starbugs are miniaturised robotic devices that position optical fibres over a telescope's focal plane in parallel operation for high multiplex spectroscopic surveys. The key advantage of the Starbug positioning system is its potential to configure fields of hundreds of targets in a few minutes, consistent with typical detector readout times. Starbugs have been selected as the positioning technology for the TAIPAN (Transforming Astronomical Imaging surveys through Polychromatic Analysis of Nebulae) instrument, a prototype for MANIFEST (Many Instrument Fiber System) on the GMT (Giant Magellan Telescope). TAIPAN consists of a 150-fibre Starbug positioner accessing the 6 degree field-of-view of the AAO's UK Schmidt Telescope at Siding Spring Observatory. For TAIPAN, it is important to optimise the target allocation and routing algorithms to provide the fastest configurations times. 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.
