Skip to main content

Concurrent Temporal Planning Using Timed Petri Nets - Policy Evaluation

  • Conference paper
AI 2007: Advances in Artificial Intelligence (AI 2007)

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

Included in the following conference series:

Abstract

This paper is the first in a series which address the development of a temporal planner using timed Petri net (TPN) models of concurrent temporal plans. Unlike previous work which uses Petri net unfoldings to develop partially ordered plans (in the untimed case), the approach presented here is purely algebraic, and is based on a (min,max,+) discrete event dynamical system description of a TPN. This paper focuses primarily on policy evaluation, with subsequent work detailing how to use this approach for efficient optimal temporal planning.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  2. McMillan, K.L.: Symbolic Model Checking. PhD thesis, School of Computer Science, Carnegie Mellon University (1993)

    Google Scholar 

  3. Hickmott, S.L.: Optimal deterministic and probabilistic concurrent planning using petri net unfoldings. In: Proc. Int. Conference on Automated Planning and Scheduling - Doctoral Consortium (2006)

    Google Scholar 

  4. Hickmott, S.L., Rintanen, J., Thiébaux, S., White, L.B.: Planning using petri net unfoldings. In: Proc. Int. Joint Conference on Artificial Intelligence, pp. 1904–1911 (2007)

    Google Scholar 

  5. Hickmott, S.L.: Directed Unfolding - Reachability Analysis of Concurrent Systems and Applications in Automated Planning. PhD thesis, School of Electrical and Electronic Engineering, The University of Adelaide (2007)

    Google Scholar 

  6. Janczura, C., Gallasch, G., Billington, J., Zhang, L., Kristensen, L.M.: A coloured petri net based tool for course of action analysis and development. In: Workshop on Formal Methods applied to Defence Systems, Conferences in Research and Practice of Information Technology, vol. 12 (2002)

    Google Scholar 

  7. McMillan, K.L.: A technique of state space search based on unfolding. Formal Methods in System Design 6 (1995)

    Google Scholar 

  8. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity - An Algebra for Discrete Event Systems. Wiley, Chichester (1992)

    MATH  Google Scholar 

  9. Liew, M., White, L.B.: Temporal planning using timed petri nets (in preparation, 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mehmet A. Orgun John Thornton

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liew, M., White, L.B. (2007). Concurrent Temporal Planning Using Timed Petri Nets - Policy Evaluation. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76928-6_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76926-2

  • Online ISBN: 978-3-540-76928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics