Deterministic Telescope Scheduling for Synoptic Surveys: An Alternative for LSST
Abstract
Telescope scheduling is the task of determining the best sequence of observations (pointings and filter choices) for a survey system. The definition of “best” typically comprises a weighted combination of performance metrics, such as cadence, uniformity of coverage, and image depth. One popular scheduling algorithm – the local greedy optimizer – rankorders candidate fields and picks the sequence of upcoming observations so as to maximize a composite merit function. One point of this paper is to stress that a local greedy optimizer does not typically produce a global optimum for a multiyear survey such as LSST. We show here that a deterministic scheduler that forces LSST to observe fields close to the meridian, alternating between sky regions N and S of the observatory latitude on alternate nights, equals or outperforms the LSST baseline scheduler in essentially all quantitative performance metrics. This is due to a number of factors, including our forcing dual visits to a field to occur in different filters. We find it easier to use a deterministic algorithm than to adjust weights and penalties to persuade a greedy optimizer to produce a desired outcome. We have developed a prototype implementation of this deterministic alternative scheduler, which produces observing sequences that can be compared directly with the LSST baseline plan. Our implementation is considerably faster than the OpSim, the simulated greedy optimizer currently used by the LSST project: a full ten year survey can be simulated in 4 minutes, as opposed to tens of hours for OpSim. We also describe a dithering strategy that achieves uniform spatial coverage at the subfield level, that is superior to a fixedfieldcenter framework.
Department of Electrical Engineering and Computer Science, University of California, Berkeley ^{†}^{†}Corresponding author: Daniel Rothchild ^{†}^{†}drothchild@berkeley.edu
Department of Physics, Center for Astrophysics, Harvard University
Department of Astronomy, University of Washington
1 Introduction
A succession of groundbased widefield survey telescopes (SDSS (sdss), PanSTARRS (chambers2016panstarrs), PTF (rau2009ptf), ZTF (bellm2014ztf; smith2014ztf), ATLAS (atlas)…) has provided an everincreasing ability to scan the sky and carry out “static” science with coadded images and “timedomain” science by searching for variability with frame subtraction methods. The LSST project (lsst) will provide unprecedented survey capability, reaching 24th magnitude in 30 seconds of integration while covering the entire accessible sky every few nights. With the LSST project well into the construction phase, the system’s engineering characteristics (aperture, field size, slew rate, quantum efficiency…) are fixed. Apart from actively engineering the weather in Chile, the only remaining opportunities to extract optimum performance from the LSST system are in the scheduler and in the processing pipeline that extracts knowledge from the survey’s image stream.
In this paper we demonstrate a way to schedule LSST observations that increases its overall scientific effectiveness, as compared to previous scheduling schemes. Our approach is fundamentally different from local greedy optimizers, including the “featurebased scheduler” naghib+2018 that uses machinelearning methods to determine parameters for a greedy optimizer scheduler. The LSST project’s baseline scheduler, implemented in a software suite called OpSim, successfully meets the LSST minimum scientific requirements. But we if there are ways to increase the scientific utility of the LSST system, we should consider them as viable alternatives for survey operations.
The literature on scheduling algorithms for synoptic widefield groundbased telescopes is mostly limited to discussions of how telescopespecific problems were overcome, and there has been little theoretical analysis of what constitutes a globally optimal schedule. In this paper, we describe some properties of a schedule that determine how well, if the schedule were executed, the resulting survey would enable a range of scientific goals. We discuss the tensions between the properties, and examine how a scheduler can control which properties to prioritize.
The total merit of a schedule is some function of the schedule’s achieved value on each property, whose form depends on the scientific priorities of the survey’s designers. In the space whose dimensions are these desirable schedule properties and where points represent schedules, there is a volume of accessible space determined by the instrument hardware and by basic physics. An ideal scheduler will only produce schedules that lie on the surface of this volume (the Pareto frontier), and will take as inputs parameters that directly control where on the surface the resulting schedule lies. This gives the survey designers complete control over which Paretooptimal schedule to execute. In this paper, we argue that a scheduler that produces a class of schedules called “deterministic” schedules approaches this ideal for groundbased widefield survey telescopes with fast readouts. We then describe our implementation of a deterministic scheduler for the Large Synoptic Survey Telescope (LSST) and compare its performance to that of the existing stateoftheart.
2 Related Work
The scheduling principles we describe in this paper apply to any groundbased telescope able to image a large sky area per unit time. Such telescopes include LSST (lsst), Palomar Transient Factory (PTF) (rau2009ptf), Zwicky Transient Facility (ZTF) (smith2014ztf), PanSTARRS1 (chambers2016panstarrs), SkyMapper (skymapper), the Dark Energy Survey (DES) (des), and others. Scheduling software has been developed for each of these telescopes, but often only limited information about these schedulers can be found in the literature. Broadly speaking, most schedulers operate by choosing each observation as the night progresses based on where the telescope is currently pointing and on current or predicted observing conditions. By choosing observations that maximize scientific merit at each point in the night, these scheduling algorithms seek to maximize the scientific merit of the entire resulting schedule. Algorithms that follow such a strategy are called greedy algorithms, since they greedily take the most meritorious option at each decision point instead of strategizing about what will lead to the most merit in the long term. In general, greedy algorithms are guaranteed to maximize merit in the long term in only the simplest of problems, and telescope scheduling is not one of those problems. To see why, consider a scenario where every field North of the telescope has a merit score of, say, 5, and every field South of the telescope has a merit score of 4. Fields directly overhead have low merit. If the telescope happens to be pointing in the South and long slews are penalized, then a greedy algorithm will call for observing in the South the entire night, even though the globally optimal policy would be to slew to the North at the very beginning and observe there for the rest of the night.
The PTF scheduler is a greedy algorithm that operates under four modes, where the two main modes are a 5day cadence (5DC) and a dynamic cadence (DyC) (law2009ptf). In the 5DC, the telescope takes two 60s exposures separated by 60 minutes on average every 5 days. The DyC observes a smaller number of fields with a higher cadence, with the exact observing strategy to be reviewed by the PTF collaboration every 6 months. The scheduler itself chooses fields by calculating, for each candidate observation, values for several criteria: the sun altitude, moon sky brightness and phase, expected slew time, and airmass. Candidates get a point for each criterion for which they exceed a threshold value. A smooth function of the time since the candidate was last observed is added to this value to get a final score. The scheduler then chooses the candidate with the highest score. For the 5DC, “the scheduler is required to optimize the field selection so that each field is observed twice during the night for asteroid detection” (law2009ptf). We were unable to find information about what this optimization was or whether it succeeded at achieving all 60minute revisits. We were also unable to determine if the scoring system described achieved a constant 5day cadence or whether the distribution of intervisit gaps followed a potentially less desirable distribution.
ZTF, unlike PTF, schedules an entire night of observations at a time. It chooses a schedule by solving an integer program designed to maximize observing efficiency subject to constraints on when and how often each field needs to be observed (ztf2019). The Las Cumbres Observatory schedules its telescopes in a similar way (lco2014). For LSST, this approach is challenging for a few reasons: the overhead for each observation varies considerably (a few seconds to 2 minutes); in order to achieve a more uniform sky coverage, LSST may not use fixed fields at all; and the large number of fields and observations per night may render the integer program intractable to solve repeatedly during a night when weather changes.
Another telescope, PanSTARRS1, conducted a steradian survey while following two different observing strategies: the Design Reference Mission (DRM) from 2009 to early 2012, and the Modified Design Reference Mission (MDRM) from early 2012 to 2014. The DRM (chambers2008drm) specifies that observations in the steradian survey should be carried out in pairs, separated by about 30 minutes, with each field observed at a cadence of about 5 days over two months. Images in the z and y bands are taken mostly near twilight. Although the DRM schedule is described in almost sufficient detail to implement in code directly, it was instead implemented using an early version of the LSST scheduler, which uses a greedy algorithm. We did not obtain the final algorithm that was used to schedule PanSTARRS1.
Lastly, LSST’s scheduler is part of a package called the Operations Simulator (OpSim) (delgado2016lsst). OpSim uses a greedy algorithm to choose fields based on a proposal system, where abstractions of different scientific proposals give a score for each candidate field, and the scheduler chooses the field with the highest combined score. Results from OpSim are presented in more depth in Section 9. Several alternatives to OpSim have also been proposed. naghib2016 frame the scheduling problem as a Markovian decision process. ridgway2015units proposes scheduling LSST by dividing observing into blocks that are observed (and then reobserved) in an optimal manner. Ridgway’s proposal is similar in spirit to the algorithm developed and described in this paper.
Most classically scheduled nonsurvey telescopes operate on a proposal system, where scientists submit observing proposals that are then scheduled on the instrument by a central scheduler. The literature on scheduling algorithms for such telescopes is much more developed, and colome2012research survey various algorithms that are currently in use to solve this sort of scheduling problem. Fewnight observing run scheduling decisions are typically made by the astronomer, based on scientific priorities, with dynamic adjustments for weather and seeing conditions.
3 Desirable Properties of a Schedule
A schedule for a particular survey telescope is a feasible sequence of observations to be carried out, where each observation is assigned, in addition to a pointing, an exposure time, rotator angle, and photometric filter. The scientific merit of a schedule can be assessed by calculating summary statistics, such as “fraction of supernovae that are sampled often enough to classify their type with high confidence” or “fraction of galaxies for which data quality is high enough to measure shape for weak lensing”. For the purposes of this paper, summary statistics like these are too difficult to calculate and too numerous to be of use. We therefore distill these “science metrics” into much simpler “technical metrics”, or simple properties of the final schedule. We contend that a schedule that performs well on these properties is likely to perform well on the more complicated science metrics as well. We divide these properties into two groups: those that depend on the time and rough location of the pointings, and those that depend on the sky tiling from which the exact pointings are drawn.
Properties that depend on the gross distribution of pointings in RA/Dec/time are:

Typical singlevisit depth,

Openshutter fraction,

Final coadded depth in each band,

Typical histogram of intervisit times, and

Typical histogram of perband intervisit times.
Properties that depend on the sky tiling are:

RMS fluctuation in sky maps of coadded depth,

Typical distribution over position angles at each sky pixel, and

Typical distribution over CCDs used to image each sky pixel.
The properties in the first group are highly interconnected with each other. The properties in the second group can be jointly optimized by carefully choosing a sky tiling and rotator angle strategy, and are mostly independent of the properties in the first group. We examine each of these properties in the following two sections and explore the tradeoffs between them. Along the way, we introduce tunable parameters that allow the survey designers to control these tradeoffs directly.
4 Pointing History Properties
Consider a multiyear schedule, and for simplicity, assume that the survey footprint extends over all right ascensions between two declinations. We consider the five properties from the first group in order.
4.1 SingleVisit Depth
The singlevisit depth determines the detection limit for fast transients. It is determined by the singlevisit exposure time, , and the achieved SNR, which depends on the weather, seeing, transparency, and on the observed airmass.
There are multiple ways to go about choosing . bellm2014ztf propose choosing in order to optimize the number of transients with some fixed absolute magnitude that are discovered. Because each visit involves some overhead closedshutter time, there is a value of that maximizes the volume in which the specified transients will be detected that is probed by the survey. For surveys that are particularly interested in transients with a single absolute magnitude (SN Ia, for instance), this method is optimal. However, for surveys interested in a transients with a wide range of absolute magnitudes, could instead be chosen as the shortest possible value that does not incur an unacceptable openshutter fraction. Choosing in this way prioritizes finding brighter, rarer transients, which are the ones where rapid spectroscopic followup is easiest.
Choosing gives the survey designers a tunable knob to control the tradeoff between the openshutter fraction and the volume of space explored for fast, bright transients. Numerical values for this tradeoff cannot be calculated, since the exact abundance and nature of all transients is unknown.
4.2 OpenShutter Fraction
The openshutter fraction is the fraction of survey time spent with the shutter open. If is the exposure time for some visit, is the slew time (including any filter change time), and is the camera readout time, then the openshutter fraction for a single visit is
assuming the camera can read out while slewing.
The openshutter fraction can be minimized by reducing the slew time (assuming the readout time is usually smaller than the slew time). The schedule can, without penalty, reduce the slew time until the focal plane footprints of consecutive visits abut. Beyond this point, there is a tradeoff between increasing openshutter fraction and cadence properties: if consecutive visits overlap, the schedule gains rapid revisits on the order of , but the area of sky that can be imaged per night goes down.
This gives the survey designers another knob to tune, which controls the tradeoff between increasing openshutter time and rapid revisit cadence on the one hand, vs. increasing sky area covered per night on the other. This tradeoff is difficult to write down analytically, since it depends sensitively on the maximum speeds and accelerations of the instrument and of the dome, along with settling time and camera readout time. However, once these parameters are set, it should be straightforward to calculate for telescopes with simple field of view shapes, and can be calculated numerically otherwise.
This tradeoff is discussed from the standpoint of the sky tiling in greater detail in Section 5.
4.3 Coadded Depth
Coadded depth is maximized by increasing openshutter fraction and observing at the highest possible SNR.^{3}^{3}3This assumes that increasing openshutter fraction and observing at the highest possible SNR can be independently achieved. However, this may not the case for some telescopes: if slews are usually limited by the azimuth speed (either of the instrument or of the dome), slewing by one field of view takes less time when observing at lower elevation – i.e. at higher airmass for any given field. We have not explored this tradeoff in detail, but it should be possible to calculate the optimal (nonzero) hour angle to observe at for each declination, depending on what kind of mount the telescope is on. The former is controlled by the tradeoffs described above, and the latter is accomplished by observing along the meridian.
4.4 InterVisit Gap Histogram
The cadence properties of a schedule are much more complicated than the static survey properties. For simplicity, we assume throughout this section that the same sort of cadence is desired across the entire survey footprint. We choose to analyze the intervisit gap histograms as a metric of cadence because they are simple to interpret, they capture all the information about a cadence, and because, for alternative survey strategies, the area under each histogram is conserved, making alternative histograms easy to compare.
We first introduce the idea of a “rolling cadence”, which applies at many different cadence timescales. For the purposes of this paper, we define a uniform rolling cadence (here referred to simply as a rolling cadence) to be any schedule that is produced by dividing up the sky into disjoint regions of equal area and then exclusively observing each region in turn for a time , where is an integer number of nights. is called the rolling multiplicity and is the dwell time of the cadence.
There are several ways to create the sky partitions. One simple and effective way is to divide the declination range of the survey footprint into ranges such that the area of each region is equal. and are global properties of the survey that don’t change over time. We treat sky pixels outside of the current rolling partition as if they are not currently observable.
One quantity that is fundamental for determining cadence properties is the number of visits available to each observable sky pixel in a single night. To calculate that, we first need to determine the length of the observing season, since each field will get more visits per night if the observing season is shorter. In order to maximize SNR, the schedule should generally observe on the meridian, since fields are at their minimum airmass when they cross the meridian. If the schedule observes exclusively on the meridian, the observing season is completely determined, since it begins when a field crosses the meridian just after sunset and ends when the field crosses the meridian just before sunrise.
To allow for some flexibility in the observing season length, consider a schedule that deviates from the meridian. Define , the “normalized airmass” as the quotient of the airmass a field is observed at and the minimum airmass that the field could ever be observed at (i.e. the airmass of the field when it is on the meridian). For a field at declination observed at a zenith angle :
Say we require to limit degradation to SNR. This yields a nontrivially shaped segment of the alt/az sphere that is acceptable to observe in. For simplicity, we approximate this shape as the portion of the alt/az sphere between and for some that satisfies
The cadence that maximizes observing season starts the night observing in the West and ends the night observing in the East. The cadence that minimizes observing seasons starts in the East and ends in the West.
Schedules that observe in this manner – scanning North and South on or parallel to the meridian at some hour angle that changes slowly as the night progresses – are called “marching army” schedules. We show how the parameters of a marching army scheduler are easily interpretable and directly control tradeoffs between the global schedule properties introduced above.
Let the duration of the night be hours. For simplicity, assume that the survey footprint includes all right ascensions between two fixed declinations. The possible range of observing season lengths (in days) is then:
If we choose and let hours, then the permissible season length ranges from to days. For a telescope that stays on the meridian (), the season length will be days.
To see how the observing rate changes with the observing season length, consider a survey telescope that images a solid angle per second^{4}^{4}4 must include a realistic average slew time in addition to the singleexposure time. over a survey footprint of size . Assuming the focal plane tiles the sky, a survey that seeks to achieve a uniform cadence everywhere can reach a maximum cadence of
visits per unit time to each sky pixel within the current rolling partition that is in season ( here is in radians). For and hours as above, and using fiducial LSST values of square degrees/second and square degrees, this corresponds to a range of visits per night, where we have set to 1. Figure 4.4 shows the relationship between cadence, season length, and graphically.
There is a direct tradeoff between maximizing SNR and having flexibility in observing season length: observing only on the meridian completely fixes the observing season length, while observing slightly offmeridian (i.e. moving away from the line in Figure 4.4) allows a the scheduler to sacrifice overall survey depth in order to prioritize sampling of shorter or longer transients. , which determines the range of available cadences on a shorter time scale, is fixed by choosing the observing season. gives the survey designers an additional knob to turn, controlling the tradeoff between maximizing SNR on the one hand and gaining flexibility in and on the other.
Assume for the moment that is an integer. If , the schedule is simple: to maintain minimum slews, it will scan North and South along a particular hour angle (along the meridian if ), and the sky will scroll by at the right speed for the telescope to expose at each sky pixel exactly once while staying at the prescribed hour angle. Consider the histogram of intervisit times – the “property” we are trying to optimize. If , the histogram has a single peak around 1 day. For larger , the histogram will have two peaks, one at 1 day and one at days. The ratio of the areas under the 1day peak and the peak is . In this way, and give the survey designers another knob to tune, which controls the location and sizes of the peaks in the internight visit gap histogram.
If , the schedule can proceed in two ways. There is more observable sky area per night than the telescope can physically observe, so the schedule can either randomly choose a subset of the observable area to observe, or it can increase by a factor of in order to bring up to 1. In the first case, the intervisit gaps will follow an exponential distribution; in the second, they will follow the regular distribution for described above.
If , the histogram of intervisit gaps is split into two parts: gaps between visits within a single night and gaps between visits in different nights. The latter part obeys the same properties as the distribution described above. We now consider the intranight visit gap distribution histogram. Because fields rise and set each night, all observations to a sky pixel must occur within a relatively short time. We consider the simplest case, where a single peak in the histogram is desired at some value . In this case, the schedule will observe in blocks of duration , during which time a fixed set of fields are observed, in order, times. Since the schedule observes on or near the meridian, this will result in observing blocks consisting of a rectangle of fields extended in the NorthSouth direction and only a few fields wide in the EastWest direction. Every seconds, the schedule will scan North and South, covering the entire block, before starting again at the beginning of the block. To minimize the slew time into each revisit sequence, the schedule should scan North and South an even number of times for each block. The ratio of the area under the peak at to the area under the internight peaks in the final intervisit gap histogram is . Figure 4.4 shows schematic representations of these intervisit gap histograms for and .
gives the survey designers another knob to turn to control the intranight visit gap histogram. More complicated histograms can be constructed by changing the value of from night to night.
4.5 PerBand InterVisit Gap Histograms
As shown above, the bandindependent intervisit gap distribution is mostly determined by , , , and . However, there is still considerable leeway in the perband intervisit gap histograms. For example, if and is long, the schedule could change filters before every night, or it could use the same filter for a week at a time before switching. A full description of the perband intervisit gap histograms depends in a complicated way on , , , the number of filters , and when and how often filters are changed compared to . We consider only a few simple cases here. In addition, we ignore banddependent atmospheric effects such as weather, the moon, and twilight. In a production scheduler, these must be accounted for, but they make the analysis more complicated, obscuring the main tradeoffs that control perband cadence.
First, let and . There is no need to change filters more often than before the beginning of each night, since there are no revisits. If the schedule cycles through the filters in order, each band will have an intervisit gap histogram with a single peak at days. Now let . If the schedule uses the same filter cadence (change before each night), the intervisit gap histograms for each band will have a peak at and another at days, where the ratio of the areas under the and peaks is . On the other hand, if the schedule changes filters before every revisit block, the histogram will instead have a single peak at , assuming that the schedule cycles through the filters at each sky pixel. This filter changing strategy requires filter changes per night: one for each time an observing block is revisited.
This is a critical point: if an even cadence is desired, the maximum achievable cadence in a particular band is one visit every nights. Because the area under the intervisit gap histogram is conserved, it is impossible to image the field more regularly without also leaving it unobserved for longer periods.
For , the filter changing strategy can be applied independently to each rolling partition. However, the situation becomes more complicated if is on the order of the typical intervisit gap time or shorter. Furthermore, in real surveys, different depths are often desired in different filters, which precludes strictly cycling through the filters. Adding banddependent sky brightness from the moon and from twilight introduces a timevarying favorability for observing in each filter. Lastly, it is often the case that certain bands are prioritized when the seeing happens to be especially good, making this favorability function more complicated. Despite these many caveats, we find that using the principles described above to design a filter changing strategy – and then adding a few adhoc rules to prevent the schedule from, say, staring at the moon in the u band all night – yields significantly more favorable perband cadence properties than existing alternatives.
5 Sky Tiling Properties
We now consider properties of a schedule that depend on how the sky is tiled. Telescopes are increasingly being designed to cover a large area of sky per unit time, so we assume here that each sky pixel will get a large number of visits over the course of the entire survey. We define a tiling to be a set of distinct pointings in RA/Dec with associated position angles on the sky, where the average number of fields that overlap a sky pixel is about 1. Transformations to a tiling include:

Rotation: the tiling can be rotated rigidly on the celestial sphere about the x/y/z axes.

Dithering: the individual pointings in the tiling can be slightly offset from one another, usually by less than a single field width.

Rotational dithering: the individual pointings in the tiling can change position angle.
We consider the three schedule properties described above: RMS fluctuation in coadded depth, distribution at each sky pixel over CCDs, and distribution at each sky pixel over position angles. To measure the first, we use as a proxy the RMS fluctuation in number of visits, since this is easier to compute.
Consider a survey that observes only at pointings drawn from some fixed sky tiling. Let the area not covered by any pointing be , the area covered by exactly one pointing be , and the area covered by exactly two pointings be . Assume no part of the sky is covered by three or more fields – i.e. that the total sky area . If this tiling is observed once, the mean number of times a sky pixel will be observed is
and the RMS fluctuation in number of visits to a pixel is
If the tiling is observed times without rotation or dithering, the final average and standard deviation in number of visits will be and . Using this strategy, each sky pixel would be imaged on the same CCD and with the same position angle every time.
Now consider a random tiling, where every night, the schedule randomly chooses a number of fields in the survey area to observe based on how many observations it expects to carry out (each with a random position angle). Let the mean number of times a sky pixel is visited be . The RMS fluction in number of visits to a pixel is
because the distribution of number of visits to a sky pixel is Poisson with parameter . With this strategy, the distribution of CCDs that are used to image each sky pixel is flat, and so is the position angle.
Lastly, consider again the fixed sky tiling, but introduce a random rotation in all three axes that is much larger than a field of view. If this tiling is observed without dithering times, then by the central limit theorem, the probability distribution of number of visits to each sky pixel is normal with mean
and standard deviation
As with the random strategy, the distributions of CCDs and position angles to each pixel are flat in expectation.
To compare these strategies numerically, we consider two tilings: one with no gaps and 20% double coverage (Tiling 1, similar to the OpSim tiling), and one with 10% gaps and 10% double coverage (Tiling 2). We let , since LSST will get approximately this number of visits in each band to each sky pixel. This yields the results in Table 5.
Strategy  

Random  —  7.1% 
Tiling 1 Fixed  167  33% 
Tiling 1 Rotated  167  2.6% 
Tiling 2 Fixed  200  45% 
Tiling 2 Rotated  200  3.2% 
table \hyper@makecurrenttable
Table 0. \Hy@raisedlink\hyper@@anchor\@currentHrefList of tiling strategies. is the number of times the tiling must be observed to reach an average of visits per sky pixel. is the standard deviation of the distribution of number of visits to a sky pixel.
Strategies where a fixed tiling is dithered are also of interest. However, these strategies are not as amenable to closedform analysis, since the results depend on the shape of the focal plane. However, we have found empirically that, although dithering yields improvements over a completely fixed tiling, using a randomly rotated nondithered tiling yields a lower than any dithering strategy we have tried.
As shown in Table 5, the randomly rotated tilings achieve the lowest standard deviation in number of visits. In this case, a tiling with double coverage but no gaps has a lower than one with some double coverage and some gaps, but the full relationship between the and is not monotonic. Changing and controls the tradeoff discussed in Section 4.2 between openshutter fraction and rate of sky area covered, since for higher , the individual tiles are closer together, reducing slew time. However, changing and also changes in a somewhat complicated way, as shown here. Note that only depends on the and , meaning that different tilings with the same will produce the same final .
6 Summary of Tunable Knobs
For a marching army scheduler, we have described several parameters that can be tuned to control the final schedule’s properties:

Exposure time (): longer exposure times increase openshutter fraction at the expense of reducing , the number of visits available to each sky pixel per unit time.

Maximum normalized airmass (): using a high allows the schedule to lengthen or shorten the observing season (thereby changing ) at the expense of SNR.

Rolling cadence parameters (, ): changing these affects the histogram of internight visit gaps as shown in figure 4.4.

Observing block length (): the observing block length determines the location of the peaks in the intranight visit gaps histogram.

Tiling parameters (, ): the spacing of the tiles controls the RMS fluctuation in final coadded depth, the openshutter fraction, and as described in the previous section.
Because a marching army scheduler maximizes SNR for a given observing season length under our simplifying assumptions, and because the scheduler’s parameters allow for direct control over the cadence properties, we conclude that a marching army scheduler allows the survey designers to efficiently explore the Pareto frontier of the schedule space.
7 Implementation
In practice, some of the assumptions we have made above do not hold: mainly, that there are no azimuth or banddependent sky brightness effects. In order to determine how a marching army scheduler performs under more realistic conditions, we implemented a deterministic marching army scheduler for LSST named ALTSched (Another LSST Telescope Scheduler). The values of the parameters for ALTSched are summarized in Table 7. Our rolling partitions are divided by declination, and the tiling we use is a solution to the Thomson chargedistribution problem for . We run our simulation for 10 years of survey operations, including realistic weather and downtime models from the LSST simulated observatory control system.
2  

1 day  
1  
30 sec  
13.3%  
85.4%  
1.2 % 
table \hyper@makecurrenttable
\hb@xt@Table 0. \Hy@raisedlink\hyper@@anchor\@currentHrefParameters used for ALTSched.
Our algorithm differs slightly from the marching army cadence described above in the following ways:

LSST will be on an alt/az mount, requiring a zenithavoidance region. Because we never stray far from the meridian, the region of sky that is affected by the zenith avoidance region consists of all RAs near a Dec equal to the telescope’s latitude. In order to avoid long slews in azimuth, we observe this region of sky to the East of the meridian in scans that go East to West and West to East.

In addition to carrying out a widefastdeep survey across most of the Southern sky, LSST plans to dedicate about 10% of its observing time to “special surveys”. Although the exact nature of these surveys is not fully decided, they will include time spent observing single “deep drilling fields” to high depth in many filters. We allow for special surveys by removing 6% of the total survey time in 1hour chunks on certain nights to demonstrate that our cadence can tolerate gaps in observing time.
Our implementation suffers from a few problems. One is that we ignore all azimuthdependent sky brightness terms, including the moon. Therefore, some observations are taken while pointing straight at or very near the moon, rendering them useless. Another problem is that our filter cadence is underdeveloped, causing our final coadded distributions in each filter to be somewhat nonuniform across the sky. We believe that neither of these problems are insurmountable, but they currently reduce our performance on some of the metrics that we introduce below.
8 The Merits of Observing Close to the Meridian
Observing a field on the meridian ensures that the data are obtained at the minimum achievable airmass. While the merits of meridian observations are well known to experienced classical astronomers, we pause here to point out the impact of hour angle on longterm, multiepoch surveys such as LSST. These merits include:

Observing fields at their minimum airmass provides the deepest images, overall. For the LSST passbands this is due more to the degradation of seeing with hour angle rather than atmospheric attenuation. Over the course of a ten year survey this has a substantial impact on overall performance.

With observations taken a common airmass, differential chromatic refraction and attenuation effects are minimized, and frame subtraction artifacts are consequently suppressed. Although the LSST metric analysis framework (MAF) does not currently include a characterization of this effect, our experience (alcock+1999) suggests that this will be an important factor for suppressing false alarms in the LSST alert system.

Slews in azimuth are expensive for LSST, due to the energy exchange needed to impart dome rotation. By keeping to the N or S meridian on alternate nights we keep azimuth slews to a minimum.

With the LSST requirement of dual visits per field per night separated by 3060 minutes, we can obtain these two visits at minimum airmass by in general taking the first on E of the meridian and the second one just W of the meridian. Our deterministic approach prevents the scheduler from having to chase setting fields as they sink into the West.
9 Results
We evaluate our scheduler using the LSST Metrics Analysis Framework (MAF), and we compare our results to those of the current LSST Operations Simulator (OpSim) v3 baseline cadence, codenamed “minion_1016”. We stress that we have used weather and hardware outages blackouts identical to the OpSim runs, as well as a telescope slew time calculation that matches the one used by the project. The LSST scheduler is undergoing continual development, and this comparison OpSim run has been superseded, but it was the baseline plan at the time this work was completed.
Because minion_1016 and ALTSched are single simulations, there are no error bars on any of the results below. However, it is important to keep in mind that differences on the order of 12% between the schedulers are insignificant because of differences in the LSST software stack between when minion_1016 was run and when ALTSched was run. For example, minion_1016 does not observe on 9 nights () even though those nights are not part of downtime, nor are they clouded out according to the current LSST stack. In addition, slew times in the minion_1016 tend to be slightly faster than the slew time calculated by the current version of OpSim, allowing minion_1016 to take about 1% more exposures than it would be able to with the current simulation software.
9.1 Basic Survey Properties
9.1.1 Survey Footprint
The minion_1016 survey has a complicated footprint with several regions. 85% of all visits are designated as “universal cadence” visits, and these lie in a range of declinations from degrees to +3 degrees. 5% of observations are dedicated to 5 specific deep drilling fields. 6% of visits lie in the “north ecliptic spur” region the follows the ecliptic as it rises above the maximum universal cadence declination of 3 degrees. 2% of observations cover the south celestial pole (from dec of to degrees), and the remaining 2% lie in the Galactic plane (the Galactic plane is undersampled in minion_1016).
ALTSched distinguishes between only two types of observations: universal cadence observations (94%) and deep drilling observations (6%). Deep drilling observations are taken in blocks of 1 hour, but ALTSched is agnostic as to how they are carried out (e.g. in what filters or with what rotation). Our universal cadence observations lie in a declination range of degrees to degrees and our deep drilling fields are the same as those used by minion_1016. Sky maps showing the total amount of survey time (including slew and readout) spent on each sky pixel are shown in Figure 9.1.1. All else being equal, one would expect a schedule that spends more survey time in a particular region to have more favorable cadence properties in that region.
Unless otherwise specified, the results below are calculated from all nondeepdrilling visits in minion_1016 and all universal cadence observations in ALTSched.
9.1.2 SingleVisit Properties
Both minion_1016 and ALTSched assume that for each pointing, two 15second exposures will be carried out backtoback. The shutter in the LSST camera takes 1 second to move across the focal plane, and the camera takes 2 seconds to read out the CCDs, for a total of 4 seconds of overhead time per 30 seconds of exposure time. In this respect the timing budget of each pointing is identical for both schedulers.
9.2 Static Survey
First, we demonstrate that our scheduler achieves similar performance on the static survey as minion_1016 despite its improvements in transient sampling.
The “effective time” of an observation is the effective duration of the exposure had it been taken at fiducial conditions. Let be the limiting depth achieved in the exposure, and let and be a fiducial depth and singleexposure time. Then
For LSST, the fiducial depths are listed in Table 9.2, and the fiducial exposure time is 30 seconds. So sec means that the fiducial singlevisit depth was exactly reached in that exposure.
u  g  r  i  z  y 
23.9  25.0  24.7  24.0  23.3  22.1 
table \hyper@makecurrenttable
Table 0. \Hy@raisedlink\hyper@@anchor\@currentHrefFiducial singlevisit limiting depths for LSST (in magnitudes).
The effective time is a measure of achieved coadded depth that can be added up across different passbands. The total effective time of a sequence of exposures is the sum of the effective times of each exposure. The total effective times of the entire minion_1016 and ALTSched surveys are listed in Table 9.2.
minion_1016  333 days 
ALTSched  329 days 
table \hyper@makecurrenttable
Table 0. \Hy@raisedlink\hyper@@anchor\@currentHrefTotal effective time of minion_1016 and ALTSched. ALTSched makes longer slews on average than minion_1016, but the effective observing time is about the same between the two schedulers: ALTSched observes along the meridian, so the effective time per observation is higher even if fewer total observations are taken.
The effective times of the two schedulers are remarkably similar, but this is only a coincidence: there are differing inefficiencies and design choices between the two schedulers whose effects on effective time happen to cancel out.
9.2.1 Inefficiencies
The main inefficiency in minion_1016 is that it observes at high airmass: on average 1.28 compared to ALTSched’s 1.11. The observedairmass difference between the schedulers is shown in Figure 9.2.1. There is no fundamental reason why a greedy algorithm will end up observing at high airmass, and we expect that continuing efforts on OpSim will lead to a scheduler that observes at lower airmass.
Two main inefficiencies in ALTSched are a lack of moon avoidance and nonoptimized slews. As mentioned above, ALTSched makes no attempt to avoid the moon, and therefore wastes observing time when pointing very close to the moon. In addition, slew times are significantly longer in ALTSched than in minion_1016: 11.1 seconds vs 7.4 seconds.^{5}^{5}5The average slew time reported elsewhere for minion_1016 is 6.8 seconds. However, the current version of the LSST software stack, which we use for ALTSched, produces a value of 7.4, which is the value that is comparable to the 11.1 seconds we report for ALTSched. This is because ALTSched uses a very simple algorithm to determine which field to image next: when scanning North (South), visit the fields in the current scan in strict ascending (descending) order of declination. A more intelligent partitioning of the sky into scans and a more intelligent choice of path through each scan should reduce the slew time closer to the value that minion_1016 attains.
9.2.2 Design Choices
A major design choice that reduces ALTSched’s effective time is the choice to execute many more filter changes than minion_1016: 11.4 per night vs 4.3 per night on average. As described in Section 4.5, the optimal cadence requires filter changes per night for ALTSched. When we run ALTSched with only two filter changes per night, we get large improvements in cadence metrics over minion_1016, but not as high as when we run ALTSched with the optimal number of changes. By adding 7 2minute filter changes per night, we lose about 2% of our total observing time.
In sum, we expect improved versions of OpSim and of ALTSched to achieve nearoptimal performance on the static survey. The main tradeoff to keep in mind between static and transient surveys that can’t be written off as a temporary inefficiency is the number of filter changes. However, even when we use a very large number of filter changes (11/night), the available observing time goes down by only about 2%.
9.3 Transient Science
Good performance on the static survey is relatively easy to accomplish simply by pointing up and not slewing too far. The main advantages that a marching army scheduler has over greedy algorithms is in the sampling of transients.
The average slew time in ALTSched is 11 seconds, the singleexposure time 30 seconds, the visit overhead time 4 seconds, and the area of the field of view is about 10 square degrees, so , the solid angle that can be imaged per second, is about square degrees per second. The survey footprint is about square degrees, the season length for is 152 days, the night length (dark time) is about 10 hours on average, and the rolling multiplicity in ALTSched is 2, so , the rate of visits to a given pixel, is about 2 per night. Most observable sky pixels are in fact visited exactly twice every night in ALTSched. Therefore, we would expect the median internight visit gap to a particular sky pixel to be 2 days for most of the sky, since the rolling multiplicity is 2 and the dwell time is only one day. As is shown in Figure 9.3, a median internight visit gap of 2 days is achieved over most of the sky.
Although minion_1016 is not a marching army schedule, it can be analyzed similarly because it mostly observes at an hour angle that is only a function of declination (specifically, it mostly observes at the hour angle that is at 1.3 airmasses for any given declination). If it observed exclusively at this hour angle and if it, like ALTSched, observed nearly all sky pixels exactly twice per night, minion_1016 would have the same median internight visit gap histogram as ALTSched. However, as can be seen in Figure 9.2.1, minion_1016 does sometimes stray from 1.3 airmasses, effectively increasing , and it sometimes observes fields more than twice in a night. These two effects cause minion_1016 to have longer median internight visit gaps, as is shown in Figure 9.3.
Just as important as achieving a low internight visit gap overall is achieving low internight visit gaps in each band separately, since many transients are chromatic, and constraining the light curve in each filter separately is desirable. This is much harder to do with a greedy algorithm, since without computationally expensive lookahead, a greedy scheduler cannot naturally arrange the visits so that it can cycle through filters at each sky pixel without a prohibitive number of filter changes. This is borne out in the actual results shown in Figure 9.3.
Although the median internight gaps discussed above are important, taking the median hides the regularity of the cadence. For example, a cadence could achieve a 1day median internight gap by observing 51% of all observations for a year on consecutive days, and then neglecting the field entirely for many months. Such a cadence would be ineffective at characterizing monthlong transients, but would achieve an excellent median internight gap. To compare cadences in a more hollistic way, Figure 9.3 shows the actual cadences for the two schedulers for an arbitrarily chosen field in its first year. ALTSched achieves a much more regular cadence for this field than minion_1016, and it goes without observing the field for long periods of time much less often.
Another advantage of ALTSched is that it achieves 30min separated color measurements by changing filters between visit and revisit observing blocks. Building this kind of functionality into a merit function is awkward, since the merit function would have to heavily prioritize changing filters when starting to revisit a block of fields while deprioritizing filter changes otherwise. minion_1016 gets very few simultaneous color measurements as a result. This is demonstrated in Figure 9.3.
Even when a greedy algorithm includes a component in the merit function that prioritizes a certain type of visit, the resulting schedule does not necessarily maximize the number of those visits. For example, OpSim’s merit function temporarily boosts the merit of fields that were recently visited in order to achieve asteroidlinkage revisits (revisits about 3060 minutes later used to track asteroids). In ALTSched, we explicitly instruct the scheduler to always revisit fields a short time later. As is shown in Figure 9.3, ALTSched achieves more asteroidlinkage revisits than minion_1016.
The result of the improved sampling is better science. Figure 9.3 shows the fraction of z=0.5 type Ia SN that are detected in at least 3 filters before peak and two times in every filter postpeak (considering only the griz filters). ALTSched will deliver several times more wellsampled SN Ia than minion_1016. Although we consider only one specific transient light curve here, the benefit of improved sampling applies to a broad range of transients with characteristic timescales ranging from hours to months. We expect that, for chromatic transients that last between a few hours and a few months, ALTSched will obtain significantly better sampling on several times as many of these transients as minion_1016. Other than ALTSched, we know of no other scheduler that has been proposed for LSST that achieves transient sampling superior to minion_1016.
One case where ALTSched might underperform is on the sampling of astronomical objects that change on very long timescales. To investigate this, we measure the parallax accuracy that will be achieved for a star with r magnitude of 24. Because ALTSched has a shorter observing season for each field, sampling a smaller fraction of the Earth’s orbit around the sun, we might worry that the uncertainty in parallax measurement would be high. However, as is shown in figure 9.3, we find that the parallax uncertainty is not significantly higher than it is for minion_1016, which observes fields for a larger fraction of the year. We suspect this is the case for two reasons: minion_1016 observes at higher airmass, yielding lower SNR on each visit; and minion_1016 mostly observes fields at a single hour angle, as shown in Figure 9.2.1, so the effective parallax baseline isn’t actually significantly longer than ALTSched’s.
10 Conclusions, and Future Directions
The LSST project decided early on to implement a greedy scheduling algorithm (delgado2006lsst; delgado2014lsst; delgado2016lsst), and the project team has been working to improve the performance of the survey scheduler ever since. One major step forward was the development of the Metrics Analysis Framework (jones2014lsst), which has allowed for the direct performance comparisons made above. As of the writing of this paper, the LSST project is working to reduce the typical airmass for survey observations. Altering the merit function or the logic of the scheduler to observe in repeated blocks of exposures along the meridian has also been proposed. In effect, these efforts are trying to force a pseudogreedy algorithm to reproduce a deterministic schedule. While this is no doubt possible, we advocate instead adopting a deterministic scheduler directly; our scheduler has easily interpretable parameters that allows survey designers to efficiently explore the Pareto frontier of schedule space. Because of ALTSched’s simplicity, we can simulate a 10year survey in under 4 minutes vs. OpSim’s 50 hours. Most importantly, as this paper attempts to demonstrate, determinisitic schedules admit a closedform analysis from scheduler parameters to global survey properties in a way that greedyoptimized schedules do not. This allows survey designers to be confident that the survey they implement maximally enables their scientific goals.
Our current implementation of a deterministic meridianscanning scheduler is not yet mature enough to be adopted for actual survey operations. The inclusion of deep drilling fields is one outstanding task, for example. But the illustration of performance gains, especially for type Ia supernova light curves, is so dramatic that we consider it well worth further exploration of this approach.
11 Acknowledgments
We are thankful to numerous members of the LSST project team for extensive conversations about scheduling choices and system characteristics. Stubbs and Rothchild acknowledge support from the US Department of Energy under grant DESC0007881, and from Harvard University. Yoachim acknowledges funding from the LSST Corporation.
altsched_arxiv0