In this paper,observability is studied for periodically switched Boolean control networks(PSBCNs),which are managed with periodic switching signal and consist of some Boolean control networks.Firstly,via semi-tensor p...In this paper,observability is studied for periodically switched Boolean control networks(PSBCNs),which are managed with periodic switching signal and consist of some Boolean control networks.Firstly,via semi-tensor product of matrices,PSBCNs are expressed as algebraic forms.Secondly,a parallel system is constructed by combining two same PSBCNs,based on which,the observability problem of the original PSBCN can be transformed into the set reachability problem of this parallel system.Then,two necessary and sufficient conditions are obtained to detect reachability of parallel systems and observability of PSBCNs.In addition,the proposed conditions are extended to the case of state constraints.Finally,a practical example and a numerical example are provided to illustrate the results.展开更多
Nowadays the semi-tensor product(STP)approach to finite games has become a promising new direction.This paper provides a comprehensive survey on this prosperous field.After a brief introduction for STP and finite(netw...Nowadays the semi-tensor product(STP)approach to finite games has become a promising new direction.This paper provides a comprehensive survey on this prosperous field.After a brief introduction for STP and finite(networked)games,a description for the principle and fundamental technique of STP approach to finite games is presented.Then several problems and recent results about theory and applications of finite games via STP are presented.A brief comment about the potential use of STP to artificial intelligence is also proposed.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.12101366, 62103176 and 72134004the Natural Science Foundation of Shandong Province under Grant Nos. ZR2020QF117 and ZR2019BF023
文摘In this paper,observability is studied for periodically switched Boolean control networks(PSBCNs),which are managed with periodic switching signal and consist of some Boolean control networks.Firstly,via semi-tensor product of matrices,PSBCNs are expressed as algebraic forms.Secondly,a parallel system is constructed by combining two same PSBCNs,based on which,the observability problem of the original PSBCN can be transformed into the set reachability problem of this parallel system.Then,two necessary and sufficient conditions are obtained to detect reachability of parallel systems and observability of PSBCNs.In addition,the proposed conditions are extended to the case of state constraints.Finally,a practical example and a numerical example are provided to illustrate the results.
基金the National Natural Science Foundation of China(NSFC)under Grant Nos.62073315,61074114,and 61273013。
文摘Nowadays the semi-tensor product(STP)approach to finite games has become a promising new direction.This paper provides a comprehensive survey on this prosperous field.After a brief introduction for STP and finite(networked)games,a description for the principle and fundamental technique of STP approach to finite games is presented.Then several problems and recent results about theory and applications of finite games via STP are presented.A brief comment about the potential use of STP to artificial intelligence is also proposed.