Skip to main content
SpringerLink
Log in

Maintaining consistency in quantitative temporal constraint networks for planning and scheduling

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (AI*IA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 728))

Included in the following conference series:

Abstract

A module for quantitative constraint propagation forms the core of any problem solving architecture devoted to planning and scheduling in realistic applications. This paper deals with temporal constraint propagation in quantitative networks. We are interested in developing a module that efficiently checks the consistency of an incrementally built temporalized solution. The paper presents a clean definition of the consistency checking problem in temporal networks and describes an algorithm that is correct and complete with respect to such a definition. A sufficient condition for inconsistency is also presented which is useful for improving the algorithm, and the computational complexity of the approach as a whole is discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J.F., Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 1983, 832–853.

    Google Scholar 

  2. Cervoni, R., Cesta, A., Oddi, A., Maintaining Consistency in Quantitative Temporal Constraint Networks for Planning and Scheduling. Technical Report IP-CNR, Rome, June 1993.

    Google Scholar 

  3. Cormen, T.H., Leierson, C.E., Rivest, R.L., Introduction to Algorithms, MIT Press, 1990.

    Google Scholar 

  4. Davis, E., Constraint Propagation with Interval Labels, Artificial Intelligence, 1987.

    Google Scholar 

  5. Dean, T.L., McDermott, D.V., Temporal Data Base Management. Artificial Intelligence, 32, 1987. 1–55.

    Google Scholar 

  6. Dean, T.L., Firby, R.J., Miller, D., Hierarchical planning involving deadlines, travel time, and resources. Computational Intelligence, 4, 1988, 381–398.

    Google Scholar 

  7. Dechter, R., Meiri, I., Pearl, J., Temporal constraint networks. Artificial Intelligence, 49, 1991, 61–95.

    Google Scholar 

  8. Le Pape, C., Smith, S.F., Management of Temporal Constraints for Factory Scheduling. Technical Report CMU-RI-TR-87-13, Carnegie Mellon University, June 1987.

    Google Scholar 

  9. Mackworth, A. K., Freuder, E. C., The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence, 25, 1985, 65–74.

    Google Scholar 

  10. Materne, S., Herzberg, J., MTMM — Correcting and Extending Time Map Management. In: Hertzberg, J., (ed.), European Workshop on Planning (EWSP-91). LNAI 522, Springer-Verlag, 1991, 88–99.

    Google Scholar 

  11. Muscettola, N., Smith, S.F., Cesta, A., D'Aloisi, D., Coordinating Space Telescope Operations in an Integrated Planning and Scheduling Architecture. IEEE Control Systems Magazine, Vol.12, N.1, February 1992.

    Google Scholar 

  12. Muscettola, N., Scheduling by Iterative Partition of Bottleneck Conflicts. Proc. 9th IEEE Conference on AI Applications, Orlando, FL, 1993.

    Google Scholar 

  13. Rit, J.F., Propagating Temporal Constraints for Scheduling. Proceedings of AAAI-86, Philadelphia, PA, 1986.

    Google Scholar 

  14. Schrag, R., Boddy, M., Carciofini, J., Managing Disjunction for Practical Temporal Reasoning. Proceedings of KR'92. Morgan Kaufmann, 1992.

    Google Scholar 

  15. Smith, S.F., Cheng, C., Slack-Based Heuristics for Constraint Satisfaction Scheduling, Proceedings of AAAI-93, Washington, DC, 1993.

    Google Scholar 

  16. van Beek, P., Reasoning About Qualitative Temporal Information, Artificial Intelligence, 58, 1992, 297–326.

    Google Scholar 

  17. Vere, S.A., Planning in Time: Windows and Durations for Activities and Goals. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-5, No.3, May 1983, 246–276.

    Google Scholar 

  18. Waltz, D., Understanding Line Drawings of Scenes with Shadows. In: Winston, P.H., (ed.), The Psychology of Computer Vision. McGraw-Hill, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Consiglio Nazionale delle Ricerche, IP-CNR, Viale Marx 15, I-00137, Roma

    Roberto Cervoni, Amedeo Cesta & Angelo Oddi

  2. Via Tiburtina 147, I-03100, Frosinone

    Roberto Cervoni

  3. Via Tiburtina 171, I-03100, Frosinone

    Angelo Oddi

Authors
  1. Roberto Cervoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amedeo Cesta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Angelo Oddi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pietro Torasso

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cervoni, R., Cesta, A., Oddi, A. (1993). Maintaining consistency in quantitative temporal constraint networks for planning and scheduling. In: Torasso, P. (eds) Advances in Artificial Intelligence. AI*IA 1993. Lecture Notes in Computer Science, vol 728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57292-9_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-57292-9_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57292-3

  • Online ISBN: 978-3-540-48038-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation