Wei Wang

Wei Wang

Auto-generated profile, based on publicly available information

Wei Wang

College of Data Science, Taiyuan University of Technology, Taiyuan, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 February 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CHChi Huang
Chi Huang
WWWei Wang
Wei Wang
Jianquan LuJianquan Lu
Jianquan Lu
JKJürgen Kurths
Jürgen Kurths
In actual network transmission, data loss due to network congestion and power shortage is unavoidable. However, this phenomenon has not been considered in Boolean networks (BNs) analysis so far. The loss of data is usually random, so BNs with missing data are modeled by introducing Bernoulli distribution sequences. A novel augmented system is constructed to deal with the randomly missing data. The initial states of the BNs are supposed to be chosen from the whole space or only part of it, which leads to the global and local stable problems. Some necessary and sufficient conditions are proposed for both problems. Two algorithms are developed to check the asymptotic stability of BNs. An illustrative example is also given to show the effectiveness of the derived results.


4 June 2021 in IEEE Access
Verified
Journal Article
Open access
WWWei Wang
Wei Wang
LWLi Wang
Li Wang
CHChi Huang
Chi Huang
This paper is concerned with event-triggered guaranteed-cost bipartite formation control of multi-agent systems with antagonistic interactions. In order to save the limited network communication bandwidth of multi-agent systems, event-triggered sampled-data transmission strategy is adopted. Event conditions are designed for both leader and followers to reduce the frequency of state transmission more effectively. According to the event-triggered sampled-data of the leader and followers, bipartite formation controllers are designed for followers. By using the event conditions and the Lyapunov method, the sufficient conditions for the realization of bipartite formation and guaranteed-cost bipartite formation are obtained in terms of linear matrix inequality, respectively. Finally, the effectiveness of the theoretical results is demonstrated by numerical examples.

1 January 2021 in Complexity
Verified
Journal Article
Open access
PDF file
CHChi Huang
Chi Huang
YXYuning Xiong
Yuning Xiong
WWWei Wang
Wei Wang
We study the synchronization of complex networks by using event‐sampling information. The nodes of the network are connected with event‐triggered communication via multiple couplings. The couplings are split into several channels. Not all the channels are connected. Only a part of the states of each node can be communicated by the channels. An event detector is designed for each channel to independently determine the sampling moments. The couplings of the network are partial and event‐triggered. Both features make that less information can be used for synchronization. The pinning controllers are also designed based on the sampled information. By establishing a time‐dependent Lyapunov functional and utilizing an efficient event condition, we derive less conservative criteria for the synchronization of complex networks. Finally, the effectiveness of our main results is verified by an illustrative example, and comparisons are also presented to show how much conservatism can be reduced.