IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v54y2023i3p565-582.html
   My bibliography  Save this article

Optimal decision strategy for discrete-time Markovian jump linear systems

Author

Listed:
  • Jin Zhu
  • Qingkun Zhang

Abstract

This paper investigates the discrete-time Markovian jump linear systems (MJLSs) whose mode transition probability matrix (MTPM) can be adjusted by decisions. Motivated by switching law design in switched systems, the optimal decision strategy is proposed for stabilisation and optimisation of such MJLSs where decision cost is taken into account. First, aiming at system stability, the feasible domain of decision is given for stable and unstable MJLSs with initial MTPM. Second, a generalised performance index is put forward which contains both state cost and decision cost, and we obtain the quantitative relationship between the index and decision via stochastic dynamic programming. Finally, for the optimisation of the performance index, a value iteration algorithm is proposed with its convergence proof. This algorithm, searching for the optimal decision within the feasible domain, achieves superior performance on the basis of ensuring stability. Simulation results illustrate the effectiveness of the proposed optimal decision strategy.

Suggested Citation

  • Jin Zhu & Qingkun Zhang, 2023. "Optimal decision strategy for discrete-time Markovian jump linear systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(3), pages 565-582, February.
    • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:3:p:565-582
    DOI: 10.1080/00207721.2022.2135417
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2135417
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2022.2135417?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:54:y:2023:i:3:p:565-582. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.