Abstract
A satisficing solution to a problem is one that is “good enough” or satisfactory in a particular situation. Because of the lack of task predictability, and interdependences among tasks it is desirable to use both approximate solutions for tasks and approximate scheduling algorithms for scheduling task execution. Iterative refinement and the use of multiple methods are two approaches that achieve satisficing behavior. This paper examines these approaches including their effects on task monitoring and on sharing intermediate results among tasks. The design-to-time approach to scheduling satisficing tasks is then discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Paul R. Cohen, Marc S. Atkin and Eric Hansen. The interval reduction strategy for monitoring cupcake problems. CS Technical Report 94-09, University of Massachusetts, 1994.
Bruce D’Ambrosio. Resource bounded-agents in an uncertain world. In Proceedings of the Workshop on Real-Time Artificial Intelligence Problems, IJCAI-89, Detroit, August 1989.
T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 49–54, St. Paul, Minnesota, August 1988.
Keith S. Decker, Alan J. Garvey, Marty A. Humphrey, and Victor R. Lesser. A real-time control architecture for an approximate processing blackboard system. International Journal of Pattern Recognition and Artificial Intelligence, 7(2):265–284, 1993.
Keith S. Decker, Alan J. Garvey, Victor R. Lesser, and Marty A. Humphrey. An approach to modeling environment and task characteristics for coordination. In Charles J. Petrie, Jr., editor, Enterprise Integration Modeling: Proceedings of the First International Conference, pages 379–388. MIT Press, 1992.
Keith S. Decker, Victor R. Lesser, and Robert C. Whitehair. Extending a blackboard architecture for approximate processing. The Journal of Real-Time Systems, 2(1/2):47–79, 1990.
Alan Garvey, Marty Humphrey, and Victor Lesser. Task interdependences in design-to-time real-time scheduling. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 580–585, Washington, D.C., July 1993.
Alan Garvey and Victor Lesser. Design-to-time real-time scheduling. IEEE Transactions on Systems, Man and Cybernetics, 23(6):1491–1502, 1993.
Alan Garvey, Keith Decker, and Victor Lesser. A negotiation-based interface between a real-time scheduler and a decision-maker. CS Technical Report 94-08, University of Massachusetts, 1994.
D. M. Hart, S. D. Anderson, and P. R. Cohen. Envelopes as a vehicle for improving the efficiency of plan execution. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control, pages 71–76, November 1990.
Victor R. Lesser, Jasmina Pavlin, and Edmund Durfee. Approximate processing in real-time problem solving. AI Magazine, 9(1):49–61, Spring 1988.
J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58–68, May 1991.
Stuart J. Russell and Shlomo Zilberstein. Composing real-time systems. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 212–217, Sydney, Australia, August 1991.
Jay K. Strosnider and C. J. Paul. A structured view of real-time problem solving. Technical report, Carnegie Mellon University, Department of Electrical and Computer Engineering, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Garvey, A., Lesser, V. (1995). Representing and Scheduling Satisficing Tasks. In: Natarajan, S. (eds) Imprecise and Approximate Computation. The Springer International Series in Engineering and Computer Science, vol 318. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26870-5_2
Download citation
DOI: https://doi.org/10.1007/978-0-585-26870-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9579-9
Online ISBN: 978-0-585-26870-5
eBook Packages: Springer Book Archive