Finite horizon tracking control of probabilistic Boolean control networks

• Published in: Journal of the Franklin Institute Vol. 358; no. 18; pp. 9909 - 9928
• Main Authors: Zhang, Qingle, Feng, Jun-e, Jiao, Ticao
• Format: Journal Article
• Language: English
• Published: Elmsford Elsevier Ltd 01.12.2021; Elsevier Science Ltd
• Subjects: Algorithms; Boolean algebra; Dynamic programming; Horizon; Optimal control; Probability; Statistical analysis; Tensors; Tracking control; Tracking control systems; Tracking errors; Trajectory control
• ISSN: 0016-0032; 1879-2693; 0016-0032
• DOI: 10.1016/j.jfranklin.2021.10.003

In this paper, the finite horizon tracking control problem of probabilistic Boolean control networks (PBCNs) is studied. For a given reference output trajectory, two trackability definitions are introduced according to whether the tracking probability is 1. Under the framework of the semi-tensor product, some necessary and sufficient conditions are obtained to determine whether the reference output trajectory is trackable with probability (probability one) by a PBCN starting from a given initial state. Based on this, two algorithms are proposed to determine the maximum tracking probability and the corresponding optimal control policy sequence. By determining the tracking error of the reference output trajectory, two related optimal control problems are considered: one is to minimize the expected value of the total tracking error, and the other is to minimize the maximum tracking error. Inspired by dynamic programming, corresponding algorithms are given to solve these two problems. Finally, two examples are given to verify the validity and correctness of the results.