IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v61y2005i2p311-328.html
   My bibliography  Save this article

Markov decision processes under observability constraints

Author

Listed:
  • Yasemin Serin
  • Vidyadhar Kulkarni

Abstract

We develop an algorithm to compute optimal policies for Markov decision processes subject to constraints that result from some observability restrictions on the process. We assume that the state of the Markov process is unobservable. There is an observable process related to the unobservable state. So, we want to find a decision rule depending only on this observable process. The objective is to minimize the expected average cost over an infinite horizon. We also analyze the possibility of performing observations in more detail to obtain improved policies. Copyright Springer-Verlag 2005

Suggested Citation

  • Yasemin Serin & Vidyadhar Kulkarni, 2005. "Markov decision processes under observability constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(2), pages 311-328, June.
    • Handle: RePEc:spr:mathme:v:61:y:2005:i:2:p:311-328
    DOI: 10.1007/s001860400402
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400402
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400402?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lanlan Zhang & Xianping Guo, 2008. "Constrained continuous-time Markov decision processes with average criteria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 323-340, April.
    2. Lauren B. Davis & Thom J. Hodgson & Russell E. King & Wenbin Wei, 2009. "Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(1), pages 86-92, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:61:y:2005:i:2:p:311-328. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.