Abstract
Satellites represent scarce resources that must be carefully scheduled to maximize their value to service consumers. Near-optimal satellite task scheduling is so computationally difficult that it typically takes several hours to schedule one day’s activities for a set of satellites and tasks. Thus, often a requestor will not know if a task will be scheduled until it is too late to accommodate scheduling failures. This paper presents our experiences creating a fast Analogical Reasoning (AR) system and an even faster Case-Based Reasoner (CBR) that can predict, in less than a millisecond, whether a hypothetical task will be scheduled successfully. Requestors can use the system to refine tasks for maximum schedulability. We report on three increasingly narrow approaches that use domain knowledge to constrain the problem space. We show results that indicate the method can achieve >80% accuracy on the given problem.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hummel, J.E., Holyoak, K.J.: A symbolic-connectionist theory of relational inference and generalization. Psychological Reviews 110(2), 220–264 (2003)
Sweeney, J., Li, H.L., Grupen, R., Ramamritham, K.: Scalability and Schedulability in Large, Coordinated, Distributed Robot Systems. In: International Conference on Robotics and Automation (September 2003)
Heidmann, P.S.: A Statistical Model for Designers of Rate Monotonic Systems. In: Proceedings of the Second Annual Rate Monotonic User’s Forum (hosted by the SEI) (November 1993)
Martí-Campoy, A., Sáez, S., Perles, A., Busquets, J.V.: Schedulability analisys in EDF scheduler with cache memories. In: 9th International Conference on Real-Time and Embedded Computing Systems and Applications (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tinker, P., Fox, J., Green, C., Rome, D., Casey, K., Furmanski, C. (2005). Analogical and Case-Based Reasoning for Predicting Satellite Task Schedulability. In: Muñoz-Ávila, H., Ricci, F. (eds) Case-Based Reasoning Research and Development. ICCBR 2005. Lecture Notes in Computer Science(), vol 3620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536406_43
Download citation
DOI: https://doi.org/10.1007/11536406_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28174-0
Online ISBN: 978-3-540-31855-2
eBook Packages: Computer ScienceComputer Science (R0)