Semi-tensor product (STP) of matrices has attracted more and more attention from both control theory and engineering in the last two decades. This paper presents a comprehensive survey on the applications of STP method in engineering. Firstly, some preliminary results on STP method are recalled. Secondly, some applications of STP method in engineering, including gene regulation, power system, wireless communication, smart grid, information security, combustion engine and vehicle control, are reviewed. Finally, some potential applications of STP method are predicted.

This paper studies the leader-follower consensus of multiagent systems with time delays and switching topology over finite fields. First, an equivalent algebraic form is established for leader-follower multiagent systems with time delays over finite fields. Second, based on the algebraic form, a necessary and sufficient condition is presented for the finite-field leader-follower consensus with time delays. Third, the switching topology case is considered, and a new criterion is presented for the finite-field leader-follower consensus with time delays and switching topology. Finally, an example is worked out to illustrate the obtained results.

No abstract

No abstract

This paper investigates the evolutionary dynamic and control problem for a kind of networked evolutionary games with bankruptcy mechanism by using semi‐tensor product of matrices, and presents a number of new results. First, this kind of games are expressed as logical dynamic networks and converted into their algebraic forms, based on which, the evolutionary dynamics of the given games can be discussed. Second, the control problem is considered, and a control sequence is designed to guarantee that none of players goes bankrupt as the control target requires. Finally, an illustrative example is given to show the effectiveness of our main results.

No abstract

No abstract

This paper studies the structural monostability and structural cycle‐stability of Boolean networks (BNs). Firstly, the structural‐equivalent Boolean networks are converted to the algebraic forms by using the semitensor product of matrices. Secondly, the concepts of structural monostability and structural cycle‐stability for Boolean networks are proposed. On the basis of the algebraic forms of structural‐equivalent Boolean networks, some necessary and sufficient conditions are presented for the structural monostability and structural cycle‐stability of Boolean networks. Finally, an illustrative example is worked out to show the effectiveness of the obtained results.