Skip to main content

Brownian Snake Measure-Valued Markov Decision Process

  • Conference paper
Advances in Swarm Intelligence (ICSI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7929))

Included in the following conference series:

  • 2792 Accesses

Abstract

This paper presents a model called Brownian snake measure-valued Markov decision process (BSMMDP) that can simulate an important characteristic of human thought, that is, when people think problems, sometimes they can suddenly connect events that are remote in space-time so as to solve problems. We also discuss how to find an (approximate) optimal policy within this framework. If Artificial Intelligence can simulate human thought, then maybe it is beneficial for its progress. BSMMDP is just following this idea, and trying to describe the talent of human mind.

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. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn., pp. 626–627. Pearson Education Asia Limited, Tsinghua University Press (2006)

    Google Scholar 

  2. Zhao, X.L.: An Introduction of Measure-Valued Branching Processes, vol. 70, pp. 43–58. Science Press, Beijing (2000) (in Chinese)

    Google Scholar 

  3. Lovejoy, S.: A Survey of Algorithmic Methods for Partially Observed Markov Decision Processes. Annals of Operations Research 28, 47–66 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Sondik, J.: The Optimal Control of Partially Observable Markov Processes. PhD Thesis, Stanford University (1971)

    Google Scholar 

  5. Roy, N., Gordon, G.: Finding Approximate POMDP Solutions Through Belief Compression. Journal of Artificial Intelligence Research 23, 1–40 (2005)

    Article  MATH  Google Scholar 

  6. Chatterjee, K., Doyen, L., Henzinger, T.A.: Qualitative Analysis of Partially-Observable Markov Decision Processes. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 258–269. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Z., Xing, H. (2013). Brownian Snake Measure-Valued Markov Decision Process. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38715-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38714-2

  • Online ISBN: 978-3-642-38715-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics