2015/03/24 by Sotiria Lampoudi, Lampoudi, Sotiria, Eric Saunders +3 · 1 citation
Computer Science · Engineering · #Advanced Optical Network Technologies #Cloud Computing and Resource Management #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Instrumentation and Methods for Astrophysics (astro-ph.IM) #Satellite Communication Systems
paper · pdf · doi:10.48550/arxiv.1503.07170
openalex publication_date 2015/03/24 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
Telescope networks are gaining traction due to their promise of higher\nresource utilization than single telescopes and as enablers of novel\nastronomical observation modes. However, as telescope network sizes increase,\nthe possibility of scheduling them completely or even semi-manually disappears.\nIn an earlier paper, a step towards software telescope scheduling was made with\nthe specification of the Reservation formalism, through the use of which\nastronomers can express their complex observation needs and preferences. In\nthis paper we build on that work. We present a solution to the discretized\nversion of the problem of scheduling a telescope network. We derive a solvable\ninteger linear programming (ILP) model based on the Reservation formalism. We\nshow computational results verifying its correctness, and confirm that our\nGurobi-based implementation can address problems of realistic size. Finally, we\nextend the ILP model to also handle the novel observation requests that can be\nspecified using the more advanced Compound Reservation formalism.\n