Skip to main content

The Problem of Planning with Three Sources of Uncertainty

  • Chapter
  • 186 Accesses

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 472))

Abstract

Planning under uncertainty is one of the most significant and challenging problems in Artificial Intelligence and Computer Science. In this paper, we focus on the following sources of uncertainty: nondeterminism, partial observability, and extended goals. We discuss how the “Planning as Model Checking” approach can deal with these three forms of uncertainty.

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.

Bibliography

  • F. Bacchus and F. Kabanza. Using temporal logic to control search in a forward chaining planner. In: M. Ghallab and A. Milani, (Eds), New Directions in AI Planning pages 141–156. IOS Press (Amsterdam), 1996a. ISBN 90–5199–237–8.

    Google Scholar 

  • Fahiem Bacchus and Froduald Kabanza. Planning for temporally extended goals. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference pages 1215–1222, Menlo Park, August4–8 1996b. AAAI Press/MIT Press. ISBN 0–262–51091–X.

    Google Scholar 

  • P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso. Planning in nondeterministic domains under partial observability via symbolic model checking. In: B. Nebel, (Eds), Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, pages 473–478. Morgan Kaufmann Publishers, August 2001.

    Google Scholar 

  • R. E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Transactions on Computers, 40 (2): 205–213, 1991.

    Article  MATH  Google Scholar 

  • J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond. Information and Computation, 98 (2): 142–170, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  • A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso. Planning via Model Checking: A Decision Procedure for AR. In: S. Steel and R. Alami, (Eds), Proceeding of the Fourth European Conference on Planning, number 1348 in Lecture Notes in Artificial Intelligence, pages 130–142, Toulouse, France, September 1997. Springer-Verlag.

    Google Scholar 

  • A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence.

    Google Scholar 

  • A. Cimatti, M. Roveri, and P. Traverso. Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains. In Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) Madison, Wisconsin, 1998a. AAAI-Press. Also IRST-Technical Report 9801–10, Trento, Italy.

    Google Scholar 

  • A. Cimatti, M. Roveri, and P. Traverso. Strong Planning in Non-Deterministic Domains via Model Checking. In Proceeding of the Fourth International Conference on Artificial Intelligence Planning Systems (ALPS-98) Carnegie Mellon University, Pittsburgh, USA, June 1998b. AAAI-Press.

    Google Scholar 

  • E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999. ISBN 0262032708.

    Google Scholar 

  • M. Daniele, P. Traverso, and M. Y. Vardi. Strong cyclic planning revisited. In: S. Biundo, (Eds), Proceeding of the Fifth European Conference on Planning, volume 1809 of LNAI, Durham, United Kingdom, September 1999. Springer-Verlag.

    Google Scholar 

  • G. De Giacomo and M. Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In: S. Biundo, (Eds), Proceeding of the Fifth European Conference on Planning, volume 1809 of LNAI, pages 226–238, Durham, United Kingdom, September 1999. Springer-Verlag.

    Google Scholar 

  • S. Edelkamp and M. Helmert. Exhibiting knowledge in planning problems to minimize state encoding length. In S. Biundo and M. Fox, editors, Proceedings of the Fifth European Conference on Planning (ECP’99), volume 1809 of LNAI, pages 135–147. Springer-Verlag, 1999.

    Google Scholar 

  • S. Edelkamp and M. Helmert. On the implementation of mips. In ALPS-Workshop on Model-Theoretic Approaches to Planning, pages 18–25, 2000.

    Google Scholar 

  • A. Emerson. Temporal and modal logic. In: J. van Leeuwen, (Eds), Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 16, pages 995–1072. Elsevier, 1990.

    Google Scholar 

  • Giunchiglia and P. Traverso. Planning as model checking. In: S. Biundo, (Eds), Proceeding of the Fifth European Conference on Planning, volume 1809 of LNAI, pages 1–20, Durham, United Kingdom, September 1999. Springer-Verlag.

    Google Scholar 

  • R. P. Goldman, D. J. Musliner, K. D. Krebsbach, and M. S. Boddy. Dynamic abstraction planning. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference (AAAI 97), (IRAI 97), pages 680–686. AAAI Press, 1997.

    Google Scholar 

  • R. P. Goldman, D. J. Musliner, and M. J. Pelican. Using Model Checking to Plan Hard Real-Time Controllers. In: Proceeding of the AIPS2k Workshop on Model-Theoretic Approaches to Planning, Breckeridge, Colorado, April 2000.

    Google Scholar 

  • R.P. Goldman, M. Pelican, and D.J. Musliner. Hard Real-time Mode Logic Synthesis for Hybrid Control: A CIRCA-based approach, mar 1999. Working notes of the 1999 AAAI Spring Symposium on Hybrid Control.

    Google Scholar 

  • R. Jensen and M. Veloso. OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains. Journal of Artificial Intelligence Research, 13: 189–226, 2000.

    MathSciNet  MATH  Google Scholar 

  • R. M. Jensen, M. M. Veloso, and M. H. Bowling. OBDD-based optimistic and strong cyclic adversarial planning. In Proceedings of the Sixth European Conference on Planning (ECP’01), 2001.

    Google Scholar 

  • U. Dal Lago, M. Pistore, and P. Traverso. Planning with a language for extended goals. In In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), 2002.

    Google Scholar 

  • M. Pistore and P. Traverso. Planning as model checking for extended goals in non-deterministic domains. In: B. Nebel, (Eds), Proceedings of the Seventh International Joint Conference on Artificial Intelligence (IJCAI-01), pages 479–486. Morgan Kaufmann Publisher, August 2001.

    Google Scholar 

  • J. Rintanen. Backward plan construction for planning as search in belief space. In In Proceedings of the Sixth International Conference on AI Planning and Scheduling (AIPS’02), 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 Wien

About this chapter

Cite this chapter

Traverso, P. (2003). The Problem of Planning with Three Sources of Uncertainty. In: Della Riccia, G., Dubois, D., Kruse, R., Lenz, HJ. (eds) Planning Based on Decision Theory. International Centre for Mechanical Sciences, vol 472. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2530-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2530-4_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-40756-1

  • Online ISBN: 978-3-7091-2530-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics