زمان بندی و شبیه سازی مشاهده در یک شبکه تلسکوپ سراسری
Abstract
1. Introduction
2. GLORIA overview
3. Network model
4. Probabilistic algorithm
5. Results
6. Discussion
7. Conclusion
Acknowledgments
References
Abstract
The GLObal Robotic-telescope Array is an e-infrastructure composed of a network of telescopes with the aim of providing citizen science capabilities. To allow it, the network is managed by a scheduler that receives observation requests from users, and decides the best telescope to execute them. The objective is to maximize the number of accepted observations and minimize the elapsed time between the user request and its execution. This issue arises as a multi-objective optimization problem that can be solved by means of different methods. Therefore, the aim of this work is to develop a new probabilistic algorithm that decides the best telescopes to execute a requested observation, taking into consideration the optimization problem. To perform a comparison of the new algorithm with others, a model of the telescope network has also been created and validated through information obtained from the real network. Finally, a comparative of the new algorithm with previously developed ones has been carried out to demonstrate their performance in the model.