Asymptotical feedback controllability of continuous-time probabilistic logic control networks

Abstract

In this article, we study the controllability of continuous-time probabilistic logic control networks (CT-PLCNs) under sampled-data feedback controls (SDFCs). First, we demonstrate that the concept of finite-time controllability with probability one for discrete-time probabilistic logic control networks cannot be generalized to CT-PLCNs. Then, we propose the concepts of asymptotical feedback reachability and asymptotical feedback controllability for CT-PLCNs. Based on the invariant subsets, we prove that a target state is asymptotically feedback reachable if and only if the target state is a control equilibrium point and any initial state has an admissible path to the target state. Moreover, we introduce the concept of reachability matrix and propose an easily verifiable criterion for asymptotical feedback reachability expressed in terms of the reachability matrix. Based on these, we prove that a CT-PLCN is asymptotically feedback controllable if and only if every state is a control equilibrium point and there is an admissible path between any pair of initial and target states. The relation between controllability and stabilizability is also discussed. We prove that a CT-PLCN is asymptotically feedback controllable if and only if every state is asymptotically feedback stabilizable. For a controllable CT-PLCN, we propose an algorithm of designing a stabilizing SDFC for any given target state. Additionally, we discuss the asymptotical feedback controllability of CT-PLCNs under time-varying nonuniform SDFCs. Finally, an illustrative example is presented to explain the proposed methods and verify the controllability criteria.