This is the authors' abstract. We don't add key points for this paper.
We present a novel algorithm for scheduling the observations of time-domain imaging surveys. Our integer linear programming approach optimizes an observing plan for an entire night by assigning targets to temporal blocks, enabling strict control of the number of exposures obtained per field and minimizing filter changes. A subsequent optimization step minimizes slew times between each observation. Our optimization metric self-consistently weights contributions from time-varying airmass, seeing, and sky brightness to maximize the transient discovery rate. We describe the implementation of this algorithm on the surveys of the Zwicky Transient Facility and present its on-sky performance.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Bellm et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: