Computer Science – Robotics
Scientific paper
Feb 1998
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1998taas....2..137t&link_type=abstract
NASA University Research Centers Technical Advances in Aeronautics, Space Sciences and Technology, Earth Systems Sciences, Globa
Computer Science
Robotics
Algorithms, Computer Programs, Dynamic Programming, Scheduling, Schedules, Decision Theory, Robotics, Telescopes, Set Theory
Scientific paper
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.
No associations
LandOfFree
Optimal Scheduling of a Multi-User, Multi-Tasking Automatic Robotic Telescope does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Scheduling of a Multi-User, Multi-Tasking Automatic Robotic Telescope, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Scheduling of a Multi-User, Multi-Tasking Automatic Robotic Telescope will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1648518