Abstract
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (TRP), in which resource reasoning is seen as integrated with temporal reasoning. Two propagation techniques are introduced that reason about resource constraints in the TRP framework. The Profile Propagation technique, similar to time-tabling techniques, considers resource utilization in single instants of time (the time values) to synthesize necessary quantitative temporal constraints. The Order Propagation technique is more original. It observes single time points (the time variables) and their orderings to synthesize necessary qualitative temporal constraints.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3:149–156, 1991.
G. Ausiello, G.F. Italiliano, A. Marchetti, and U. Nanni. Incremental Algorithms for Minimal Length Paths. Journal of Algorithms, 12:615–638, 1991.
A. Cesta and C. Stella. Rappresentazione e gestione di vincoli su risorse in una architectura per la pianificazione (in Italian. In Proceedings of the Fifth AI * IA Symposium. Naples, Italy, 1996.
C. Cheng and S.F. Smith. Generating Feasible Schedules under Complex Metric Constraints. In Proceedings 12th National Conference on AI (AAAI-94), 1994.
R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61–95, 1991.
B. Drabble and A. Tate. The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner. In Proceedings of the 2nd Int. Conf. on Artificial Intelligence Planning Systems (RIPS-94), 1994.
A. El-Kholy and B. Richards. Temporal and Resource Reasoning in Planning: the parcPLAN Approach. In Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), 1996.
R.E. Frederking and N. Muscettola. Temporal Planning for Transportation Planning and Scheduling. In Proceedings of the IEEE International Conference on Robotics and Automation, 1992.
P. Laborie and M. Ghallab. Planning with Sharable Resource Constraints. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI95), 1995.
C. Le Pape. Three Mechanisms for Managing Resources Constraints in a Library for Constraint-Based Scheduling. In Proceedings of the INRIA/IEEE Conference on Emerging Technologies and Factory Automation, 1995. http://www.ilog.fr.
N. Lehrer. KRSL Reference Manual 2.0.2. ARPA/Rome Laboratory Planning and Scheduling Initiative. Technical report, ISX Corporation, 1993.
W.P.M. Nuijten and E.H.L. Aarts. Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling. In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94), 1994.
N. Sadeh.Look-ahead Techniques for Micro-opportunistic Job-shop Scheduling. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1991.
C. Stella. Trattazione di vincoli su tempo e risorse in una architectura per la pianificazione automatica (in Italian. Master's thesis, Department of Computer and System Science, University of Rome “La Sapienza”, February 1996.
D.E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Pub.Inc., 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cesta, A., Stella, C. (1997). A time and resource problem for planning architectures. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_80
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63912-1
Online ISBN: 978-3-540-69665-0
eBook Packages: Springer Book Archive