Controllability and Optimal Control of Higher-Order Incomplete Boolean Control Networks With Impulsive Effects

Deng, Lei; Fu, Shihua; Li, Ying; Zhu, Ping; Liu, Hongyan

doi:10.1109/access.2018.2876300

Cited by 6 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…discussed the output controllability of temporal BCNs. Furthermore, the controllability of high‐order BCNs were displayed in References 43,52‐54.…”

Section: Resultsmentioning

confidence: 99%

A survey on applications of the semi‐tensor product method in Boolean control networks with time delays

Mu,

Feng

2023

Engineering Reports

View full text Add to dashboard Cite

SummaryAs regulatory networks that simulate and establish gene interactions, Boolean networks (BNs) exhibit significant delays in state updates or trajectory tracking due to environmental factors in practical applications. This paper provides a comprehensive knowledge overview of Boolean control networks with time delays (TBCNs) via the semi‐tensor product theory (STP), which includes the history of BNs, the property of STP, several issues of TBCNs and future prospects. The related problems contain controllability and reachability, observability and detectability, stability and stabilization, synchronization, output tracking and regulation, and other issues. Finally, it also points out that some areas still need further research and promotion, such as disturbance decoupling, system decomposition, identification, deep reinforcement learning, and so forth.

show abstract

“…discussed the output controllability of temporal BCNs. Furthermore, the controllability of high‐order BCNs were displayed in References 43,52‐54.…”

Section: Resultsmentioning

confidence: 99%

A survey on applications of the semi‐tensor product method in Boolean control networks with time delays

Mu,

Feng

2023

Engineering Reports

View full text Add to dashboard Cite

show abstract

“…Thus, we omit it. (Sufficiency): Assume that (7) and (19) hold, and we need to prove that all the states in R w (x * ) can coverage to x * while avoiding u(t)x(t) / ∈ W by constructing an appropriate state feedback controller. From Remark 2, we can get…”

Section: Remarkmentioning

confidence: 99%

Optimal Control of Networked Evolutionary Games With Bankruptcy Risk

2020

Self Cite

View full text Add to dashboard Cite

This paper studies the optimal control problem for a class of networked evolutionary games (NEGs) with bankruptcy risk. Firstly, an algebraic expression is formulated for the given NEGs via the semitensor product. Then, the optimal control problem is discussed, and a state feedback controller is designed to maximize the long-run average payoff of the game. Finally, an illustrative example is presented to show the effectiveness of the obtained new results. INDEX TERMS Bankruptcy risk, state feedback control, networked evolutionary games, semi-tensor product, optimal control.

show abstract

“…To design and maintain a networked system under control, two structural properties of the dynamical systems have been well established as observability and controllability. However, the focus on substantial complex systems and networks as the environment for these concepts has renewed the researchers' interest recently [6]- [8].…”

Section: Introductionmentioning

confidence: 99%

Simulating Robustness of Structural Controllability for Directed Networks Under Multi-Round Edge Strategies

Alwasel

2021

IEEE Access

View full text Add to dashboard Cite

The study of structural controllability of control systems is a crucial property in the design and analysis of complex networks as well as networks which require a control relationship between nodes. The fundamental aim of attack vulnerability research is to safeguard electric power networks along-with their control systems as part of critical infrastructure systems. Such a system may have its structural control undermined or co-opted to hinder or hijack control if the entire network system is already known and understood by an attacker. A significant focus on the graph-theoretical interpretation of Kalman controllability has emerged as a concept linked to structural controllability that offers a powerful abstraction for understanding the structural properties of a control network and its critical elements. The determination of driver node sets that can monitor the whole network is therefore enabled, although it is a W [2]hard problem identifying these nodes. Indeed, problematic computational complexity is a feature of the various extant driver node identification techniques. Accordingly, this paper is highly motivated to adopt the power dominating set approach to explore how directed Erdős-Rényi networks are influenced by targeted iterative multiple-edge removal, in addition to the assessment of its effects on the robustness of network controllability from multiple structural vulnerabilities.

show abstract

Controllability and Optimal Control of Higher-Order Incomplete Boolean Control Networks With Impulsive Effects

Cited by 6 publications

References 31 publications

A survey on applications of the semi‐tensor product method in Boolean control networks with time delays

A survey on applications of the semi‐tensor product method in Boolean control networks with time delays

Optimal Control of Networked Evolutionary Games With Bankruptcy Risk

Simulating Robustness of Structural Controllability for Directed Networks Under Multi-Round Edge Strategies

Contact Info

Product

Resources

About