Skip to main content

The Role of Different Solvers in Planning and Scheduling Integration

  • Conference paper

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

Abstract

This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the two realms of problem solving. In fact, the exchange of each solver’s point of view on the problem to be solved allows for a synergetic effort in the process of searching the space of states. In this work, we show how different solving strategies cooperate in this process by varying the degree of integration of the combined procedure. In particular, the analysis exposes the advantage of propagating sets of partial plans rather than reasoning on sequential state space representations. Also, we show how this is beneficial both to a component-based approach (in which information sharing occurs only once) and to more interleaved forms of integration.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäckström, C.: Computational Aspects of Reordering Plans. Journal of Artificial Intelligence Research 9, 99–137 (1998)

    MathSciNet  Google Scholar 

  2. Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annals of Operations Research 16, 201–240 (1988)

    Article  MathSciNet  Google Scholar 

  3. Blum, A., Furst, M.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence, 281–300 (1997)

    Google Scholar 

  4. Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1–2), 5–33 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operations Research (1998)

    Google Scholar 

  6. Cesta, A., Oddi, A., Smith, S.: A Constrained-Based Method for Project Scheduling with Time Windows. Journal of Heuristics 8(1), 109–135 (2002)

    Article  MATH  Google Scholar 

  7. Cesta, A., Oddi, A., Susi, A., Oscar, O.: A Flexible Object-Oriented Architecture for Schedule Management in Space Applications. In: Proceedings of the 5th International Symposium on Artificial Intelligence, Robotics and Automation in Space (i-SAIRAS-1999) (1999)

    Google Scholar 

  8. Currie, K., Tate, A.: O-Plan: The Open Planning Architecture. Artificial Intelligence 52(1), 49–86 (1991)

    Article  Google Scholar 

  9. Ghallab, M., Laruelle, H.: Representation and Control in IxTeT, a Temporal Planner. In: Proceedings of the 2nd International Conference on AI Planning Systems (AIPS 1994) (1994)

    Google Scholar 

  10. Hoffmann, J., Nebel, B.: The F.F. Planning System: Fast Plan Generation Through Heuristic Search (2001)

    Google Scholar 

  11. Jonsson, A., Morris, P., Muscettola, N., Rajan, K., Smith, B.: Planning in Interplanetary Space: Theory and Practice. In: Proceedings of the 5th Int. Conf. on Artificial Intelligence Planning and Scheduling (AIPS 2000) (2000)

    Google Scholar 

  12. Kambhampati, S., Parker, E., Lambrecht, E.: Understanding and Extending Graphplan. In: Proceedings of ECP 1997, pp. 260–272 (1997)

    Google Scholar 

  13. Kautz, H., Selman, B.: Unifying SAT-Based and Graph-Based Planning. In: Minker, J. (ed.) Workshop on Logic-Based Artificial Intelligence, Washington, DC, College Park, Maryland, June 14–16. Computer Science Department, University of Maryland (1999)

    Google Scholar 

  14. Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending Planning Graphs to an ADL Subset. In: Proceedings of ECP 1997, pp. 273–285 (1997)

    Google Scholar 

  15. Mcallester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 321–326. Providence, Rhode Island (1997)

    Google Scholar 

  16. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)

    Google Scholar 

  17. Muscettola, N., Smith, S., Cesta, A., D’Aloisi, D.: Coordinating Space Telescope Operations in an Integrated Planning and Scheduling Architecture. IEEE Control Systems 12(1), 28–37 (1992)

    Article  Google Scholar 

  18. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1984)

    Google Scholar 

  19. Pecora, F., Cesta, A.: Planning and Scheduling Ingredients for a Multi- Agent System. In: Proceedings of UK PLANSIG02 Workshop. Delft, The Netherlands (2002)

    Google Scholar 

  20. R-Moreno, M., Oddi, A., Borrajo, D., Cesta, A., Meziat, D.: Integrating Hybrid Reasoners for Planning & Scheduling. In: Proceedings of UK PLANSIG02 Workshop. Delft, The Netherlands (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pecora, F., Cesta, A. (2003). The Role of Different Solvers in Planning and Scheduling Integration. In: Cappelli, A., Turini, F. (eds) AI*IA 2003: Advances in Artificial Intelligence. AI*IA 2003. Lecture Notes in Computer Science(), vol 2829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39853-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39853-0_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20119-9

  • Online ISBN: 978-3-540-39853-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics