IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v457y2023ics0096300323003806.html
   My bibliography  Save this article

Design of reduced-order and pinning controllers for probabilistic Boolean networks using reinforcement learning

Author

Listed:
  • Takizawa, Michiaki
  • Kobayashi, Koichi
  • Yamashita, Yuh

Abstract

In this paper, we study a stabilization method for probabilistic Boolean networks (PBNs) using Q-learning, which is one of the typical methods in reinforcement learning. A PBN is a class of discrete-time stochastic logical systems in which update functions are randomly chosen from the set of the candidates of Boolean functions. In the existing methods using reinforcement learning, a design method of structured controllers has not been studied. In this paper, we propose reward design methods to derive reduced-order controllers and pinning controllers. The key idea is to adjust the structure of controllers by the reward for the structure of the Q-table. The advantage of the proposed method is that implementation is easy, because the proposed method can be embedded in the existing Q-learning-based stabilization algorithm. In design of pinning controllers, we can calculate not only controllers but also pinning nodes in which the control input is assigned. We demonstrate through numerical examples that the controller obtained from our proposed method is simpler than that from the existing method.

Suggested Citation

  • Takizawa, Michiaki & Kobayashi, Koichi & Yamashita, Yuh, 2023. "Design of reduced-order and pinning controllers for probabilistic Boolean networks using reinforcement learning," Applied Mathematics and Computation, Elsevier, vol. 457(C).
  • Handle: RePEc:eee:apmaco:v:457:y:2023:i:c:s0096300323003806
    DOI: 10.1016/j.amc.2023.128211
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323003806
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2023.128211?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.

    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:apmaco:v:457:y:2023:i:c:s0096300323003806. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.