Optimal Scheduling of a Multi-User, Multi-Tasking Automatic Robotic Telescope

An algorithm is introduced to generate the optimal schedule of observations for a multi-user, multi-tasking automatic robotic telescope. The schedule is optimal m that it will take the highest possible quality data, perform the largest number of tasks, and fairly serve multiple users in terms of data quality, allocated telescope time, and observation priorities. In addition, the algorithm addresses problems due to overloading and underloading the telescope. The algorithm, which employs dynamic-programming-based decision theory, is analytically proven to produce the optimal schedule using set theory. Simulations conducted using actual astronomical data are presented which show significant improvement over existing scheduling techniques. Once completed the new scheduling algorithm will be tested on the Tennessee State University/Harvard-Smithsonian Center for Astrophysics 32-inch automatic Photoelectric Telescope at Fairborn Observatory, Arizona.