IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v224y2013i2p333-339.html
   My bibliography  Save this article

A basic formula for performance gradient estimation of semi-Markov decision processes

Author

Listed:
  • Li, Yanjie
  • Cao, Fang

Abstract

This paper presents a basic formula for performance gradient estimation of semi-Markov decision processes (SMDPs) under average-reward criterion. This formula directly follows from a sensitivity equation in perturbation analysis. With this formula, we develop three sample-path-based gradient estimation algorithms by using a single sample path. These algorithms naturally extend many gradient estimation algorithms for discrete-time Markov systems to continuous time semi-Markov models. In particular, they require less storage than the algorithm in the literature.

Suggested Citation

  • Li, Yanjie & Cao, Fang, 2013. "A basic formula for performance gradient estimation of semi-Markov decision processes," European Journal of Operational Research, Elsevier, vol. 224(2), pages 333-339.
    • Handle: RePEc:eee:ejores:v:224:y:2013:i:2:p:333-339
    DOI: 10.1016/j.ejor.2012.08.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712006108
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.08.010?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.

    References listed on IDEAS

    as
    1. Singh, Sumeetpal S. & Tadic, Vladislav B. & Doucet, Arnaud, 2007. "A policy gradient method for semi-Markov decision processes with application to call admission control," European Journal of Operational Research, Elsevier, vol. 178(3), pages 808-818, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Xiaonong Lu & Baoqun Yin & Haipeng Zhang, 2016. "A reinforcement-learning approach for admission control in distributed network service systems," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1241-1268, April.
    2. Tang, Hao & Xu, Lingling & Sun, Jing & Chen, Yingjun & Zhou, Lei, 2015. "Modeling and optimization control of a demand-driven, conveyor-serviced production station," European Journal of Operational Research, Elsevier, vol. 243(3), pages 839-851.
    3. Xia, Li & Shihada, Basem, 2015. "A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 778-787.
    4. Haji Hosseinloo, Ashkan & Ryzhov, Alexander & Bischi, Aldo & Ouerdane, Henni & Turitsyn, Konstantin & Dahleh, Munther A., 2020. "Data-driven control of micro-climate in buildings: An event-triggered reinforcement learning approach," Applied Energy, Elsevier, vol. 277(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yonghui Huang & Xianping Guo & Xinyuan Song, 2011. "Performance Analysis for Controlled Semi-Markov Systems with Application to Maintenance," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 395-415, August.
    2. Abhijit Gosavi & Vy K. Le, 2024. "Maintenance optimization in a digital twin for Industry 4.0," Annals of Operations Research, Springer, vol. 340(1), pages 245-269, September.
    3. Huang, Yonghui & Guo, Xianping, 2011. "Finite horizon semi-Markov decision processes with application to maintenance systems," European Journal of Operational Research, Elsevier, vol. 212(1), pages 131-140, July.
    4. Zhang, Zhicong & Zheng, Li & Hou, Forest & Li, Na, 2011. "Semiconductor final test scheduling with Sarsa([lambda], k) algorithm," European Journal of Operational Research, Elsevier, vol. 215(2), pages 446-458, December.
    5. Schütz, Hans-Jörg & Kolisch, Rainer, 2012. "Approximate dynamic programming for capacity allocation in the service industry," European Journal of Operational Research, Elsevier, vol. 218(1), pages 239-250.
    6. Hao-Xiang Wang & Hong-Sen Yan, 2016. "An interoperable adaptive scheduling strategy for knowledgeable manufacturing based on SMGWQ-learning," Journal of Intelligent Manufacturing, Springer, vol. 27(5), pages 1085-1095, October.
    7. Abhijit Gosavi, 2009. "Reinforcement Learning: A Tutorial Survey and Recent Advances," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 178-192, May.

    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:eee:ejores:v:224:y:2013:i:2:p:333-339. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.