2017
DOI: 10.1007/s11432-017-9265-2
|View full text |Cite
|
Sign up to set email alerts
|

From STP to game-based control

Abstract: This paper provides a comprehensive survey on semi-tensor product (STP) of matrices and its applications to different disciplines. First of all, the STP and its basic properties are introduced. Meanwhile, its inside physical meaning is explained. Second, its application to conventional dynamic systems is presented. As an example, the region of attraction of stable equilibriums is discussed. Third, its application to logical systems is presented. Particularly, the algebraic state space representation of logical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 40 publications
(10 citation statements)
references
References 70 publications
0
9
0
Order By: Relevance
“…Utilising x false( t false) = i = 1 n x i false( t false) Δ 2 n, u false( t false) = i = 1 m u i false( t false) Δ 2 m and y false( t false) = i = 1 p y i false( t false) Δ 2 p, according to the technique proposed in [42], one can find unique structure matrices of f 1 i thinmathspacefalse( i = 1 , , l false), f 2 j thinmathspacefalse( j = 1 , , s false), h and g , denoted by L 1 i L 2 n × 2 m + n thinmathspacefalse( i = 1 , , l false), L 2 j L 2 n × 2 n thinmathspacefalse( j = 1 , , s false), H L 2 p × 2 n, and G L 2 m × 2 n, respectively. Then, we obtain the following algebraic forms of (1) and (3), respectively: right left right left right left right left right left right left0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em3ptleft left1em4ptx ( t + 1…”
Section: Problem Formulationmentioning
confidence: 99%
“…Utilising x false( t false) = i = 1 n x i false( t false) Δ 2 n, u false( t false) = i = 1 m u i false( t false) Δ 2 m and y false( t false) = i = 1 p y i false( t false) Δ 2 p, according to the technique proposed in [42], one can find unique structure matrices of f 1 i thinmathspacefalse( i = 1 , , l false), f 2 j thinmathspacefalse( j = 1 , , s false), h and g , denoted by L 1 i L 2 n × 2 m + n thinmathspacefalse( i = 1 , , l false), L 2 j L 2 n × 2 n thinmathspacefalse( j = 1 , , s false), H L 2 p × 2 n, and G L 2 m × 2 n, respectively. Then, we obtain the following algebraic forms of (1) and (3), respectively: right left right left right left right left right left right left0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em3ptleft left1em4ptx ( t + 1…”
Section: Problem Formulationmentioning
confidence: 99%
“…This technique was firstly proposed in [4], and it has been successfully applied to investigate Boolean networks and logical systems subsequently [5]. For more details about STP and its applications in games and logical systems, please see [6][7][8].…”
Section: Dear Editormentioning
confidence: 99%
“…In some recent works, a semitensor product (STP) approach [21] has been introduced to the reachability and stabilizability of finite automata [1,2,22]. For other applications of STP in Boolean networks [23][24][25] and game theory [26][27][28], please refer to [29][30][31][32][33][34][35]. Xu et al [1] developed an STPbased method for the reachability of DFA.…”
Section: Introductionmentioning
confidence: 99%