Skip to main content

Planning and Execution in Dynamic Environments

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

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

Included in the following conference series:

Abstract

In this paper, we present an architecture for planning and executing in complex and dynamic environments. Such application domains are characterized by large amount of data, too wide and dynamic to be completely stored and maintained up-to-date. Planning and execution activities should deal with unpredictable action effects, unknown knowledge and dynamic information. We propose to use a planner and an executor based on the Interactive Constraint Satisfaction framework combining both search efficiency and data acquisition ability. Both planning and execution can be seen as search processes where constraint propagation, data acquisition and search are interleaved.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Barruffi, E. Lamma, P. Mello, and M. Milano. Least commitment on variable binding in presence of incomplete knowledge. In Proceedings of the European Conference on Planning (ECP99), 1999.

    Google Scholar 

  2. K. Golden. Planning and Knowledge Representation for Softbots. PhD thesis, University of Washington, 1997.

    Google Scholar 

  3. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

  4. E. Lamma, M. Milano, P. Mello, R. Cucchiara, M. Gavanelli, and M. Piccardi. Constraint propagation and value acquisition: why we should do it interactively. Proceedings of the IJCAI, 1999.

    Google Scholar 

  5. R. Montanari R. Barruffi, M. Milano. Planning in security management. IEEE Intelligent Systems, 16, 2001.

    Google Scholar 

  6. D.S. Weld. An introduction to least commitment planning. AI Magazine, 15:27–61, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barruffi, R., Milano, M. (2001). Planning and Execution in Dynamic Environments. In: Esposito, F. (eds) AI*IA 2001: Advances in Artificial Intelligence. AI*IA 2001. Lecture Notes in Computer Science(), vol 2175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45411-X_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-45411-X_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42601-1

  • Online ISBN: 978-3-540-45411-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics