Skip to main content

Transfer Learning Action Models by Measuring the Similarity of Different Domains

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2009)

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

Included in the following conference series:

Abstract

AI planning requires action models to be given in advance. However, it is both time consuming and tedious for a human to encode the action models by hand using a formal language such as PDDL, as a result, learning action models is important for AI planning. On the other hand, the data being used to learn action models are often limited in planning domains, which makes the learning task very difficult. In this paper, we present a new algorithm to learn action models from plan traces by transferring useful information from other domains whose action models are already known. We present a method of building a metric to measure the shared information and transfer this information according to this metric. The larger the metric is, the bigger the information is transferred. In the experiment result, we show that our proposed algorithm is effective.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Blythe, J., Kim, J., Ramachandran, S., Gil, Y.: An integrated environment for knowledge acquisition. IUI, 13–20 (2001)

    Google Scholar 

  2. Yang, Q., Wu, K., Jiang, Y.: Learning action models from plan examples using weighted MAX-SAT. Artif. Intell. 171(2-3), 107–143 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Benson, S.: Inductive Learning of Reactive Action Models. In: ICML, pp. 47–54 (1995)

    Google Scholar 

  4. Richardson, M., Domingos, P.: Markov Logic Networks. Machine Learning 62(1-2), 107–136 (2006)

    Article  Google Scholar 

  5. Fikes, R., Nilsson, N.J.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artif. Intell. 2(3/4), 189–208 (1971)

    Article  MATH  Google Scholar 

  6. Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. J. Artif. Intell. Res. (JAIR) 20, 61–124 (2003)

    MATH  Google Scholar 

  7. Mihalkova, L., Huynh, T., Mooney, R.J.: Mapping and Revising Markov Logic Networks for Transfer Learning. In: AAAI (2007)

    Google Scholar 

  8. Kok, S., Singla, P., Richardson, M., Domingos, P.: The Alchemy system for statistical relational AI, University of Washington, Seattle (2005)

    Google Scholar 

  9. Zhuo, H., Yang, Q., Hu, D.H., Li, L.: Transferring Knowledge from Another Domain for Learning Action Models. In: PRICAI (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhuo, H., Yang, Q., Li, L. (2009). Transfer Learning Action Models by Measuring the Similarity of Different Domains. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01307-2_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01306-5

  • Online ISBN: 978-3-642-01307-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics