Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Johnston, G. Miller (1994)
S PIKE : Intelligent Scheduling of Hubble Space Telescope Observations
(2017)
Chinese virtual observatory system
G. Grueff, G. Alvito, R. Ambrosini, P. Bolli, N. Damico, A. Maccaferri, G. Maccaferri, M. Morsiani, L. Mureddu, V. Natale, L. Olmi, A. Orfei, Claudio Pernechele, Angelo Poma, I. Porceddu, L. Rossi, G. Zacchiroli (2004)
The Sardinia Radio Telescope, 5
R. Karp (1972)
Reducibility Among Combinatorial Problems
F. Nasir, C. Castiglia, F. Buffa, G. Deiana, A. Delitala, A. Tarchi (2013)
Weather forecasting and dynamic scheduling for a modern cm/mm wave radiotelescopeExperimental Astronomy, 36
L. Valiant (1979)
The Complexity of Enumeration and Reliability ProblemsSIAM J. Comput., 8
G. Tinetti, J. Beaulieu, T. Henning, M. Meyer, G. Micela, I. Ribas, D. Stam, M. Swain, O. Krause, M. Ollivier, E. Pace, B. Swinyard, A. Aylward, R. Boekel, A. Coradini, T. Encrenaz, I. Snellen, M. Zapatero-Osorio, J. Bouwman, J. Y.K., T. Guillot, M. López-Morales, I. Mueller-Wodarg, E. Pallé, F. Selsis, A. Sozzetti, P. Ade, N. Achilleos, A. Adriani, C. Agnor, C. Afonso, C. Prieto, G. Bakos, R. Barber, M. Barlow, V. Batista, P. Bernath, L. Brown, A. Cassan, C. Cavarroc, A. Ciaravella, C. Cockell, A. Coustenis, C. Danielski, L. Decin, R. Kok, O. Demangeon, P. Deroo, P. Doel, P. Drossart, L. Fletcher, M. Focardi, F. Forget, S. Fossey, P. Fouqué, J. Frith, M. Galand, P. Gaulme, J. Hernández, O. Grasset, D. Grassi, J. Grenfell, M. Griffin, C. Griffith, U. Grözinger, M. Guedel, Patrick Guio, O. Hainaut, R. Hargreaves, P. Hauschildt, K. Heng, D. Heyrovský, R. Hueso, P. Irwin, L. Kaltenegger, P. Kervella, D. Kipping, T. Koskinen, G. Kovacs, A. Barbera, H. Lammer, E. Lellouch, G. Leto, M. Lopez, M. López‐Puertas, C. Lovis, A. Maggio, J. Maillard, J. Prado, J. Marquette, F. Martín-Torres, P. Maxted, S. Miller, S. Molinari, D. Montes, A. Moro-Martin, J. Moses, O. Mousis, N. Tuong, R. Nelson, G. Orton, E. Pantin, E. Pascale, S. Pezzuto, D. Pinfield, E. Poretti, R. Prinja, L. Prisinzano, J. Rees, A. Reiners, B. Samuel, A. Sánchez‐Lavega, J. Forcada, D. Sasselov, G. Savini, B. Sicardy, Alan Smith, L. Stixrude, G. Strazzulla, J. Tennyson, M. Tessenyi, G. Vasisht, S. Vinatier, S. Viti, I. Waldmann, G. White, T. Widemann, R. Wordsworth, R. Yelle, Y. Yung, S. Yurchenko (2012)
Exoplanet characterisation observatory
J. Colomé, Pau Colomer, J. Guàrdia, I. Ribas, J. Campreciós, Thierry Coiffard, L. Gesa, Frances Martínez, F. Rodler (2012)
Research on schedulers for astronomical observatories, 8448
R. Nan, Di Li (2011)
The five-hundred-meter aperture spherical radio telescope (FAST) projectIOP Conference Series: Materials Science and Engineering, 44
M. Johnston (1990)
Spike: AI scheduling for NASA's Hubble Space TelescopeSixth Conference on Artificial Intelligence for Applications
Tamir Tassa (2012)
Finding all maximally-matchable edges in a bipartite graphTheor. Comput. Sci., 423
J. Leeuwen (1991)
Graph Algorithms
Laiping Zhao, Liangfu Lu, Zhou Jin, Ce Yu (2017)
Online Virtual Machine Placement for Increasing Cloud Provider’s RevenueIEEE Transactions on Services Computing, 10
D. Marcus (2008)
Graph Theory: A Problem Oriented Approach
D. Bovet, P. Crescenzi (1994)
Introduction to the theory of complexity
R. Ahuja, T. Magnanti, J. Orlin (1993)
Network Flows: Theory, Algorithms, and Applications
R. Tarjan (1972)
Depth-First Search and Linear Graph AlgorithmsSIAM J. Comput., 1
J. Orlin (1996)
A polynomial time primal network simplex algorithm for minimum cost flowsMathematical Programming, 78
Anderson Pc (1990)
Hubble Space Telescope.Missouri medicine, 87 5
J. Edmonds, R. Karp (1972)
Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM (JACM), 19
T. Sasaki, G. Kosugi, Jun Kawai, Toyoaki Kusumoto, Norikazu Koura, R. Hawkins, Laurence Kramer, A. Krueger, G. Miller (2000)
Observation scheduling scheme for the Subaru telescope, 4009
(1996)
Data Structures and Algorithm Analysis in C, 2Nd Edn
M. Giuliano, M. Johnston (2008)
Multi-Objective Evolutionary Algorithms for Scheduling the James Webb Space Telescope
(1996)
Nanshan 25 m radio telescope Lijiang 2 . 4m telescope
S. Pemmaraju, S. Skiena (2003)
Computational Discrete Mathematics: Algorithmic Graph Theory
W. Gellert (1977)
The VNR concise encyclopedia of mathematics
J. McDowell (2004)
James Webb Space Telescope
G. Giannone, A. Chavan, D. Silva, A. Krueger, G. Miller (2000)
Long and Short Term Scheduling Tools in ESO
D. Normile (2016)
The biggest ear.Science, 353 6307
D. Thomsen (1988)
Very Large TelescopeScience News, 133
A. Garcia-Piquer, I. Ribas, J. Colomé (2015)
Artificial intelligence for the EChO mission planning toolExperimental Astronomy, 40
M. Klein (1966)
A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 14
R Nan, D Li, C Jin, Q Wang, L Zhu, W Zhu, H Zhang, Y Yue, L Qian (2011)
The five-hundred-meter aperture spherical radio telescope (fast) projectInt. J. Mod. Phys. D, 20
A Gibbons (1985)
Algorithmic Graph Theory
(2007)
Scheduling Algorithms, 5th edn
N. Kaifu (1998)
Subaru Telescope, 3352
A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.
Experimental Astronomy – Springer Journals
Published: Feb 16, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.