pith. sign in

arxiv: 2604.14151 · v1 · submitted 2026-04-15 · 🌌 astro-ph.IM

Visplot: A visibility plot and observation scheduling tool for astronomical observatories

Emanuel Gafton (1 , 2) , Illa R. Losada (1) ((1) Nordic Optical Telescope , La Palma , Spain , (2) Isaac Newton Group of Telescopes , Spain) This is my paper

Pith reviewed 2026-05-10 11:40 UTC · model grok-4.3

classification 🌌 astro-ph.IM
keywords visibility plotobservation schedulingastronomical observatoriesheuristic optimizationtime-domain astronomytelescope constraintsopen-source toolremote observing
0
0 comments X

The pith

Visplot computes visibility windows as unions of disjoint intervals by intersecting constraints and schedules observations via deterministic pre-allocation plus multi-objective heuristic optimization.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces Visplot as a web-based tool that calculates when astronomical targets can be observed under user-specified limits and then builds practical nightly schedules. Visibility is found by intersecting constraints on celestial factors such as airmass and moon distance with mechanical limits such as telescope altitude and hour angle, producing finite sets of disjoint time intervals. The scheduler first locks in mandatory targets and then optimizes the rest by weighing scientific priority, urgency, altitude, and slew overhead. Continuous use since 2016 at the Nordic Optical Telescope and other sites, together with a user survey, shows that the approach cuts planning effort while keeping every schedule inside hardware boundaries. The client-side design supports real-time adjustments for alerts and remote observing without installation.

Core claim

Visplot represents visibility windows as finite unions of disjoint intervals obtained by intersecting user-defined constraints that include celestial parameters, mechanical telescope boundaries, and custom temporal restrictions in UTC or LST. Its scheduling engine performs deterministic pre-allocation of mandatory targets followed by multi-objective heuristic optimization of the remaining pool that balances scientific priority, target urgency, altitude, and telescope slew overhead. Developed to meet an operational need at the Nordic Optical Telescope, the tool has operated continuously since 2016 and is used at multiple observatories, with survey data indicating reduced cognitive overhead in

What carries the argument

The visibility computation that forms disjoint time intervals by intersecting constraints on airmass, moon distance, twilight, altitude, hour angle, and custom UTC or LST limits, together with the scheduling engine that combines mandatory pre-allocation and multi-objective heuristic optimization.

If this is right

  • Generated schedules remain strictly inside the mechanical and operational limits of the telescope hardware.
  • Real-time schedule refinement is possible for time-domain triggers such as GRB or GW alerts.
  • Nightly planning cognitive overhead is reduced while schedules stay compliant, as reported in user surveys.
  • Geographically distributed remote observing is supported by the zero-installation client-side architecture.
  • Custom temporal restrictions defined in UTC or LST can be incorporated without altering the core interval-intersection method.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same interval-intersection approach could be reused at other telescopes simply by changing the numerical limits for altitude and hour angle.
  • Integration with automated alert streams would allow the heuristic to prioritize new targets inserted after initial schedule creation.
  • Because the tool is open-source and client-side, individual observatories could add site-specific constraints such as instrument availability without server changes.
  • Long operational history at multiple sites suggests the method scales to small PI-led facilities that cannot maintain large scheduling suites.

Load-bearing premise

The multi-objective heuristic produces schedules that experienced observers judge acceptable in practice and the listed constraints capture every operational limit without missing critical factors.

What would settle it

A documented instance in which a Visplot-generated schedule violates an unlisted operational limit or a side-by-side comparison in which experienced observers consistently prefer manual schedules over the heuristic output on the same target list.

Figures

Figures reproduced from arXiv: 2604.14151 by 2), (2) Isaac Newton Group of Telescopes, Emanuel Gafton (1, Illa R. Losada (1) ((1) Nordic Optical Telescope, La Palma, Spain, Spain).

Figure 1
Figure 1. Figure 1: Example of a full-night schedule produced by Visplot for a heterogeneous set of targets. The interface is organized into two main areas: a configuration panel on the left (A, red) and a main canvas on the right (B, blue), as discussed in Sect. 3.1. The core output of the software are the visibility curves as a function of time, with dark segments indicating intervals where all constraints are satisfied and… view at source ↗
Figure 3
Figure 3. Figure 3: Finding chart generated by Visplot, accessible by selecting a target index directly from the visibility plot. The interactive chart is accompanied by object metadata, including celestial coordinates, angu￾lar distance from the Moon, and the user-defined duration of observa￾tion. When a nightly schedule has been generated, the scheduling panel also displays the suggested observing interval and provides a Ma… view at source ↗
read the original abstract

We present Visplot, a free, open-source, web-based tool for hardware-aware visibility analysis and heuristic scheduling of both sidereal and non-sidereal astronomical observations. Visplot computes visibility windows as finite unions of disjoint intervals by intersecting user-defined constraints. This framework natively incorporates celestial parameters (airmass, moon distance, twilight), mechanical telescope boundaries (altitude and hour-angle limits), and custom temporal restrictions defined in UTC or Local Sidereal Time, allowing for a high degree of scheduling flexibility. The scheduling engine combines deterministic pre-allocation for mandatory targets with a multi-objective heuristic optimization of the remaining target pool, balancing scientific priority, target urgency, altitude, and telescope slew overhead. Originally developed to address an operational need for flexible and lightweight scheduling support at the Nordic Optical Telescope (NOT) in La Palma, Visplot has been in continuous use since 2016. Its nearly decade-long operational history, together with routine use by astronomers at multiple observatories worldwide, demonstrates its practical value in real-world observational workflows. Its client-side, zero-installation architecture facilitates real-time schedule refinement, making it particularly suited for time-domain triggers (e.g., GRB/GW alerts) and geographically distributed remote observing. A user survey indicates that the tool significantly reduces the cognitive overhead of nightly planning while ensuring that generated schedules remain strictly within the mechanical and operational limits of the telescope hardware. Visplot provides a robust, lightweight alternative to monolithic scheduling suites, supporting the practical needs of modern PI-led observatories.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 3 minor

Summary. The paper presents Visplot, a free open-source web-based tool for astronomical observatories that computes target visibility windows as finite unions of disjoint intervals via intersection of user-specified constraints (airmass, moon distance, twilight, altitude/hour-angle limits, custom UTC/LST restrictions) and generates schedules by deterministically pre-allocating mandatory targets followed by multi-objective heuristic optimization of the remaining pool (balancing priority, urgency, altitude, and slew overhead). It reports continuous operational use at the Nordic Optical Telescope since 2016, adoption at multiple sites worldwide, and a user survey indicating reduced cognitive overhead for nightly planning while respecting hardware limits, positioning the tool as a lightweight client-side alternative to monolithic schedulers especially for time-domain and remote observing.

Significance. If the heuristic produces acceptable schedules and the survey evidence is robust, Visplot would provide meaningful practical value by lowering the barrier to hardware-aware scheduling for PI-led and distributed observatories. The nearly decade-long real-world deployment and zero-installation architecture are concrete strengths that demonstrate utility for transient alerts and geographically separated teams; the open-source release further enables community extension.

major comments (3)
  1. [Abstract] Abstract (scheduling engine description): the multi-objective heuristic is asserted to produce schedules that remain strictly within mechanical and operational limits, yet the manuscript supplies neither pseudocode, weighting scheme for the objectives (priority/urgency/altitude/slew), search strategy, nor any quantitative performance metrics (e.g., mean slew time, fraction of targets scheduled, comparison against greedy or optimal baselines). This information is load-bearing for the central claim of demonstrated practical value.
  2. [Abstract] Abstract (user survey): the statement that a user survey shows the tool 'significantly reduces the cognitive overhead' is presented without sample size, response rate, question wording, or statistical results, rendering the evidence for impact qualitative and difficult to evaluate. This directly affects the strength of the practical-value assertion.
  3. [Abstract] Abstract and operational history section: no quantitative benchmarks, error analysis of the visibility-interval computation, or head-to-head comparisons against other schedulers (e.g., those used at similar 2–4 m telescopes) are provided, despite the paper's emphasis on real-world acceptability.
minor comments (3)
  1. The manuscript would benefit from a short dedicated section or table listing the exact constraint types supported and their default values, to aid reproducibility for new users.
  2. A brief description of the client-side technology stack (e.g., JavaScript libraries) and any server-side components would clarify the zero-installation claim.
  3. Consider adding a reference to at least one comparable visibility or scheduling tool in the literature for context.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their constructive and detailed review of our manuscript on Visplot. We address each major comment point by point below, indicating where we will revise the manuscript to improve clarity and transparency while maintaining the paper's focus on practical deployment and operational use.

read point-by-point responses

  1. Referee: [Abstract] Abstract (scheduling engine description): the multi-objective heuristic is asserted to produce schedules that remain strictly within mechanical and operational limits, yet the manuscript supplies neither pseudocode, weighting scheme for the objectives (priority/urgency/altitude/slew), search strategy, nor any quantitative performance metrics (e.g., mean slew time, fraction of targets scheduled, comparison against greedy or optimal baselines). This information is load-bearing for the central claim of demonstrated practical value.

    Authors: We agree that the current high-level description of the scheduling engine leaves key implementation details implicit. In the revised manuscript we will add a dedicated subsection (likely in Methods) that includes pseudocode for the deterministic pre-allocation step followed by the multi-objective heuristic, explicitly states the weighting order (scientific priority as primary, urgency as secondary, altitude optimization as tertiary, slew-time minimization as quaternary), and describes the search strategy as iterative greedy selection with limited backtracking for constraint conflicts. We will also report typical operational statistics drawn from NOT logs (e.g., average slew overhead and fraction of targets successfully scheduled under normal conditions). Controlled benchmark comparisons against optimal solvers or other observatory schedulers are not available and would constitute a separate study; we will therefore qualify the claim to reflect that the heuristic demonstrably respects hardware limits in sustained real-world use rather than claiming optimality. revision: partial

  2. Referee: [Abstract] Abstract (user survey): the statement that a user survey shows the tool 'significantly reduces the cognitive overhead' is presented without sample size, response rate, question wording, or statistical results, rendering the evidence for impact qualitative and difficult to evaluate. This directly affects the strength of the practical-value assertion.

    Authors: The user feedback referenced in the abstract derives from an informal poll conducted among NOT staff and a small number of external collaborators. In revision we will qualify the abstract statement and insert a short paragraph in the operational-history section that reports the approximate sample size (around 15 respondents), the main questions posed, and the summarized outcomes (e.g., reported reduction in planning time). This will make the evidence more transparent while correctly characterizing it as qualitative user feedback rather than a formal statistical survey. revision: yes

  3. Referee: [Abstract] Abstract and operational history section: no quantitative benchmarks, error analysis of the visibility-interval computation, or head-to-head comparisons against other schedulers (e.g., those used at similar 2–4 m telescopes) are provided, despite the paper's emphasis on real-world acceptability.

    Authors: We will add a concise error analysis of the visibility-interval computation in the Methods section, noting that interval arithmetic is performed with astropy coordinate routines whose numerical precision is well documented. Quantitative benchmarks and direct head-to-head comparisons with other schedulers are not present because the manuscript's emphasis is on accessibility, zero-install deployment, and nearly a decade of operational adoption rather than algorithmic performance optimization. We will expand the discussion to clarify this scope and to note that the tool's value lies in enabling hardware-aware scheduling for PI-led and remote programs where monolithic systems are impractical. revision: partial

Circularity Check

0 steps flagged

No circularity; purely descriptive software documentation

full rationale

The paper presents Visplot as a web-based tool that computes visibility windows via standard interval intersection and applies a heuristic scheduler. No equations, derivations, fitted parameters, or self-referential definitions appear. Claims of practical value rest on operational history since 2016 and a qualitative user survey; these are external assertions, not reductions of any result to its own inputs. No self-citation chains, uniqueness theorems, or ansatzes are invoked. The absence of any mathematical or predictive framework precludes the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper introduces no new physical constants, fitted parameters, or postulated entities; it relies on standard astronomical coordinate transformations and telescope mechanical limits that are treated as given inputs.

axioms (2)
  • domain assumption Celestial visibility can be represented exactly as the intersection of independent constraints on airmass, lunar separation, twilight, altitude, hour angle and custom time windows.
    Stated in the description of visibility window computation.
  • domain assumption A multi-objective heuristic can produce operationally acceptable schedules when balancing priority, urgency, altitude and slew overhead.
    Implicit in the scheduling engine description.

pith-pipeline@v0.9.0 · 5602 in / 1530 out tokens · 30420 ms · 2026-05-10T11:40:59.601946+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    C., Kulkarni, S

    Bellm, E. C., Kulkarni, S. R., Barlow, T., et al. 2019, Publ. Astron. Soc. Pac., 131, 068003

    work page 2019

  2. [2]

    2010, Proc

    Bierwirth, T., Szeifert, T., Dorigo, D., et al. 2010, Proc. SPIE, 7737, 77370W

    work page 2010

  3. [3]

    2000, Astron

    Bonnarel, F., Fernique, P., Bienaymé, O., et al. 2000, Astron. Astrophys. Suppl. Ser., 143, 33

    work page 2000

  4. [4]

    & Berthier, J

    Carry, B. & Berthier, J. 2018, Planet. Space Sci., 164, 79

    work page 2018

  5. [5]

    H., Leiserson, C

    Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. 2009, Introduction to Algorithms, 3rd edn. (New York: MIT Press)

    work page 2009

  6. [6]

    2003, Constraint Processing (San Francisco: Morgan Kaufmann)

    Dechter, R. 2003, Constraint Processing (San Francisco: Morgan Kaufmann)

    work page 2003

  7. [7]

    Denny, R. B. 2004, Soc. Astron. Sci. Annu. Symp., 23, 35

    work page 2004

  8. [8]

    Fraser, S. N. 2012, PhD thesis, Liverpool John Moores University

    work page 2012

  9. [9]

    Giorgini, J. D. 2015, in IAU General Assembly, V ol. 29, 2256293

    work page 2015

  10. [10]

    & Kubanek, P

    Girdwood, L. & Kubanek, P. 2015, libnova: Celestial mechanics, astrome- try and astrodynamics library, Astrophysics Source Code Library, record ascl:1502.016 Gómez de Castro, A. I. & Yáñez, J. 2003, Astron. Astrophys., 403, 357

    work page 2015

  11. [11]

    & Berry, D

    Jenness, T. & Berry, D. S. 2013, in Astron. Soc. Pac. Conf. Ser., V ol. 475, Astro- nomical Data Analysis Software and Systems XXII, ed. D. N. Friedel, 307 Jiménez Esteban, F. M., Cabrera Lavers, A., Cardiel, N., et al. 2012, Mon. Not. R. Astron. Soc., 427, 679

    work page 2013

  12. [12]

    1998, Astronomical Algorithms, 2nd edn

    Meeus, J. 1998, Astronomical Algorithms, 2nd edn. (Richmond: Willmann-Bell)

    work page 1998

  13. [13]

    & Solar, M

    Mora, M. & Solar, M. 2010, in Artificial Intelligence in Theory and Practice III, ed. M. Bramer (Berlin, Heidelberg: Springer Berlin Heidelberg), 111–120

    work page 2010

  14. [14]

    M., Tollerud, E., Sip˝ocz, B., et al

    Morris, B. M., Tollerud, E., Sip˝ocz, B., et al. 2018, Astron. J., 155, 128

    work page 2018

  15. [15]

    J., et al

    Naghib, E., Yoachim, P., Vanderbei, R. J., et al. 2019, Astron. J., 157, 151

    work page 2019

  16. [16]

    M., Lim, P

    Price-Whelan, A. M., Lim, P. L., Earl, N., et al. 2022, Astrophys. J., 935, 167

    work page 2022

  17. [17]

    Rhodes, B. C. 2011, PyEphem: Astronomical Ephemeris for Python, Astro- physics Source Code Library, record ascl:1112.014

    work page 2011

  18. [18]

    & Norvig, P

    Russell, S. & Norvig, P. 2010, Artificial Intelligence: A Modern Approach, 3rd edn. (Upper Saddle River: Prentice-Hall)

    work page 2010

  19. [19]

    2009, in Astron

    Sessoms, E., Clark, M., Marganian, P., McCarty, M., & Shelton, A. 2009, in Astron. Soc. Pac. Conf. Ser., V ol. 411, Astronomical Data Analysis Software and Systems XVIII, ed. D. A. Bohlender, D. Durand, & P. Dowler, 351

    work page 2009

  20. [20]

    2016, Astron

    Solar, M., Michelon, P., Avarias, J., & Garces, M. 2016, Astron. Comput., 15, 90

    work page 2016

  21. [21]

    Steele, I. A. & Carter, D. 1997, Proc. SPIE, 3112, 222

    work page 1997

  22. [22]

    L., Denneau, L., Heinze, A

    Tonry, J. L., Denneau, L., Heinze, A. N., et al. 2018, Publ. Astron. Soc. Pac., 130, 064505 van Kerkwijk, M., Valentino, A., Tollerud, E., et al. 2024, liberfa/pyerfa: v2.0.1.5 Article number, page 11 A&A proofs:manuscript no. visplot V ossen, T. W. M., Ball, M. O., Lotem, A., & Nau, D. S. 2000, Knowledge Eng. Rev., 15, 85

    work page 2018

  23. [23]

    Wallace, P. T. 2009, in Journées Systèmes de Référence Spatio-temporels 2008, ed. M. Soffel & N. Capitaine, 50–53

    work page 2009

  24. [24]

    Wallace, P. T. 2014, SLALIB: A Positional Astronomy Library, Astrophysics Source Code Library, record 1403.025

    work page 2014

  25. [25]

    2000, Astron

    Wenger, M., Ochsenbein, F., Egret, D., et al. 2000, Astron. Astrophys. Suppl. Ser., 143, 9

    work page 2000

  26. [26]

    2024, Astron

    Xie, H., Kang, Z., & Jiang, X. 2024, Astron. Comput., 47, 100806 Article number, page 12

    work page 2024