Jinhuan Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jinhuan Wang has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoming Hu
Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden
6 shared publications Han Wu
Institute of Mathematics, School of Science, Hebei University of Technology, Tianjin, China
4 shared publicationsYong Xu
School of Science, Hebei Province Key Laboratory of Big Data Calculation, Hebei University of Technology Tianjin 300401 People's Republic of China
4 shared publications- Zhixin Liu
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
4 shared publications - Daizhan Cheng
Key Laboratory of Systems and Control, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, China
3 shared publications - Guoguang Wen
Beijing Jiaotong University
3 shared publications
Latest Publications
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
State-Based Quasi-Potential Game
This paper expands the quasi-potential game framework to state-based spaces, focusing on the synchronous dynamics between state-based games. Two novel concepts, state-based quasi-potential game (SQPG) and strongly state-based quasi-potential game (SSQPG), are proposed. A formal definition of synchronization in state-based games is first established, along with its necessary and sufficient conditions. The concept of strong synchronization is then introduced as an extension, together with its criteria. A representative example demonstrates the proposed theoretical results. This research enriches the theoretical framework of state-based games and increased the flexibility in game design as well.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
State-Based Quasi-Potential Game
This paper expands the quasi-potential game framework to state-based spaces, focusing on the synchronous dynamics between state-based games. Two novel concepts, state-based quasi-potential game (SQPG) and strongly state-based quasi-potential game (SSQPG), are proposed. A formal definition of synchronization in state-based games is first established, along with its necessary and sufficient conditions. The concept of strong synchronization is then introduced as an extension, together with its criteria. A representative example demonstrates the proposed theoretical results. This research enriches the theoretical framework of state-based games and increased the flexibility in game design as well.
- Open Access
- 30 March 2025
- Published by Elsevier in Franklin Open
- Vol. 11
Security control of Boolean control networks against periodic DoS attacks
- 30 March 2025
- Published by Elsevier in Franklin Open
- Vol. 11
Open AccessSecurity control of Boolean control networks against periodic DoS attacks
- 9 January 2025
- Published by Wiley in Asian Journal of Control
- Vol. 27 (4) , 1889-1901
Network congestion games with player failures for charging problem of EVs via matrix approach
With the increasing popularity of electric vehicles (EVs), the congestion problem encountered during EV charging has become a new challenge that needs to be addressed. In this paper, the congestion problem of EV charging is investigated within the framework of network congestion games. It takes into account congestion during both travelling and charging stages. Initially, for the scenario where no player fails, the EV charging problem is modeled as a network congestion game, which is proven to be a potential game. Secondly, two types of games with player failures are considered. The game with player failures on roads is verified a weighted potential game, drawing support from the semi‐tensor product (STP) of matrices. The game in which players only fail at charging stations, rather than on roads, is not a (weighted) potential game but admits at least one Nash equilibrium (NE). Thirdly, the effect of player failures on NEs is discussed, and the condition that keeps the NE of the original game unchanged is provided. Finally, the theoretical results are validated through examples.
- 9 January 2025
- Published by Wiley in Asian Journal of Control
- Vol. 27 (4) , 1889-1901
Network congestion games with player failures for charging problem of EVs via matrix approach
With the increasing popularity of electric vehicles (EVs), the congestion problem encountered during EV charging has become a new challenge that needs to be addressed. In this paper, the congestion problem of EV charging is investigated within the framework of network congestion games. It takes into account congestion during both travelling and charging stages. Initially, for the scenario where no player fails, the EV charging problem is modeled as a network congestion game, which is proven to be a potential game. Secondly, two types of games with player failures are considered. The game with player failures on roads is verified a weighted potential game, drawing support from the semi‐tensor product (STP) of matrices. The game in which players only fail at charging stations, rather than on roads, is not a (weighted) potential game but admits at least one Nash equilibrium (NE). Thirdly, the effect of player failures on NEs is discussed, and the condition that keeps the NE of the original game unchanged is provided. Finally, the theoretical results are validated through examples.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (1) , 609-619
Stability and Stabilization of State-Based Games
In this article, the convergence of state-based games (SBGs) with recurrent state equilibria is considered by the semi-tensor product of matrices. First, the state-action profile distribution is obtained by the proposed whole evolution equation of the state and the action profile. Second, two necessary and sufficient conditions are given to ensure the convergence of the SBGs, one of which is the matrix iteration condition and the other is a set of linear matrix inequalities. Then, the finite-time stabilization with probability one of the SBGs can be implemented by designing state feedback control. Finally, numerical simulations are given to verify the correctness of the theoretical results.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (1) , 609-619
Stability and Stabilization of State-Based Games
In this article, the convergence of state-based games (SBGs) with recurrent state equilibria is considered by the semi-tensor product of matrices. First, the state-action profile distribution is obtained by the proposed whole evolution equation of the state and the action profile. Second, two necessary and sufficient conditions are given to ensure the convergence of the SBGs, one of which is the matrix iteration condition and the other is a set of linear matrix inequalities. Then, the finite-time stabilization with probability one of the SBGs can be implemented by designing state feedback control. Finally, numerical simulations are given to verify the correctness of the theoretical results.
- 15 May 2024
- Published by Springer Nature in Science China Information Sciences
- Vol. 67 (6) , 1-15
On equivalence of state-based potential games
- 15 May 2024
- Published by Springer Nature in Science China Information Sciences
- Vol. 67 (6) , 1-15
On equivalence of state-based potential games
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (9) , 12426-12437
Security Analysis for Autonomous Ground Vehicle Under Stealthy Sensor Attacks
Lateral stability is a remarkably critical metric for the autonomous ground vehicle (AGV), and its loss is probable to cause a fatal accident. Various vehicular sensors, which play a key role in the lateral stability system, are coordinated to monitor the AGV's driving states. However, sensor attacks will inevitably push the AGV's lateral stability system into a insecure situation. In this paper, therefore, we investigate the security and insecurity conditions of the AGV under sensor attacks. Firstly, the dynamics output control protocol and the anomaly detector are developed in the lateral stability system. Then, we analyze the stealthiness of sensor attacks from the given detector's viewpoint. To describe how much the AGV is influenced by sensor attacks, we propose an equivalence condition associated with state variations. Besides, it is shown that internal states of the dynamics lateral controller are immune to stealthy sensor attacks. Secondly, we give a necessary and sufficient condition about the insecurity of AGV, which also motivates us how to design parameters to ensure cyber-security. Finally, we give a simulation to demonstrate the feasibility of the presented methodology. Specifically, we design a self-generated stealthy attack sequence, in which this sequence does not involve utilizing the system data in real-time.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (9) , 12426-12437
Security Analysis for Autonomous Ground Vehicle Under Stealthy Sensor Attacks
Lateral stability is a remarkably critical metric for the autonomous ground vehicle (AGV), and its loss is probable to cause a fatal accident. Various vehicular sensors, which play a key role in the lateral stability system, are coordinated to monitor the AGV's driving states. However, sensor attacks will inevitably push the AGV's lateral stability system into a insecure situation. In this paper, therefore, we investigate the security and insecurity conditions of the AGV under sensor attacks. Firstly, the dynamics output control protocol and the anomaly detector are developed in the lateral stability system. Then, we analyze the stealthiness of sensor attacks from the given detector's viewpoint. To describe how much the AGV is influenced by sensor attacks, we propose an equivalence condition associated with state variations. Besides, it is shown that internal states of the dynamics lateral controller are immune to stealthy sensor attacks. Secondly, we give a necessary and sufficient condition about the insecurity of AGV, which also motivates us how to design parameters to ensure cyber-security. Finally, we give a simulation to demonstrate the feasibility of the presented methodology. Specifically, we design a self-generated stealthy attack sequence, in which this sequence does not involve utilizing the system data in real-time.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 43-52
The Demand-Side Management and Control of Smart Grids Based on Weighted Network Congestion Games
Based on the semi-tensor product of matrices, this article considers the demand-side management and state-flipped control of smart grids. Firstly, the smart grids with single-layer and multi-layer power companies can be modelled by a potential game under some specific conditions. Secondly, in the evolutionary process with single-layer power companies, a state-flipped control is proposed such that the evolutionary game converges to the optimal Nash equilibrium. An algorithm is constructed to reduce the control cost and the flipped node set will be found. Then, the corresponding flipped node subsets can be obtained to make as few evolution steps as possible. Finally, the correctness of the theoretical results is verified by numerical simulations. Note to Practitioners —This paper has great practical applications in the demand-side management of smart grids. Considering different loads of each player, we use a weighted network congestion game to model the smart grids. The weights in the game are specific to each player and represent their congestion impact, which is more practical in engineering problems. Then we search for the conditions that this kind of game is a potential game and hence has Nash equilibria. This starting point is different from the existing works. Furthermore, we propose a novel state-flipped control to intervene the game process and make it converge to the optimal objective. Compared with the existing theoretical results, the calculation is more convenient and the Nash equilibrium can be easily found. This paper shows an effective method to solve the demand-side management of smart grids in practice and also provides ideas for other engineering problems in such as resource allocation.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 43-52
The Demand-Side Management and Control of Smart Grids Based on Weighted Network Congestion Games
Based on the semi-tensor product of matrices, this article considers the demand-side management and state-flipped control of smart grids. Firstly, the smart grids with single-layer and multi-layer power companies can be modelled by a potential game under some specific conditions. Secondly, in the evolutionary process with single-layer power companies, a state-flipped control is proposed such that the evolutionary game converges to the optimal Nash equilibrium. An algorithm is constructed to reduce the control cost and the flipped node set will be found. Then, the corresponding flipped node subsets can be obtained to make as few evolution steps as possible. Finally, the correctness of the theoretical results is verified by numerical simulations. Note to Practitioners —This paper has great practical applications in the demand-side management of smart grids. Considering different loads of each player, we use a weighted network congestion game to model the smart grids. The weights in the game are specific to each player and represent their congestion impact, which is more practical in engineering problems. Then we search for the conditions that this kind of game is a potential game and hence has Nash equilibria. This starting point is different from the existing works. Furthermore, we propose a novel state-flipped control to intervene the game process and make it converge to the optimal objective. Compared with the existing theoretical results, the calculation is more convenient and the Nash equilibrium can be easily found. This paper shows an effective method to solve the demand-side management of smart grids in practice and also provides ideas for other engineering problems in such as resource allocation.
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (1) , 445-456
Optimal Stealthy Linear Man-in-the-Middle Attacks With Resource Constraints on Remote State Estimation
This article studies the impact of constrained optimal stealthy attacks on the state estimator, where MITM attacks with a linear form can compromise innovations transmitted through a wireless network. First, a novel resource-constrained attack model is proposed, in which there are only a finite number of attack instants within a fixed interval. Second, the evolution of the estimation error covariance under attacks is obtained, and the covariance at the ultimate instant of the attack interval is regarded as the attacker’s cost function. Moreover, a relaxed condition of the strict stealthiness, named KL divergence, is employed to describe the attacker’s the stealthiness metric. Third, the one-time and holistic optimization problems of stealthy attacks are solved by exploiting the Lagrange multiplier method. Then the constrained optimal attack strategies are obtained to produce the largest ultimate estimation error covariance. Finally, two simulation cases are provided to confirm the correctness of the designed attack strategies.
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (1) , 445-456
Optimal Stealthy Linear Man-in-the-Middle Attacks With Resource Constraints on Remote State Estimation
This article studies the impact of constrained optimal stealthy attacks on the state estimator, where MITM attacks with a linear form can compromise innovations transmitted through a wireless network. First, a novel resource-constrained attack model is proposed, in which there are only a finite number of attack instants within a fixed interval. Second, the evolution of the estimation error covariance under attacks is obtained, and the covariance at the ultimate instant of the attack interval is regarded as the attacker’s cost function. Moreover, a relaxed condition of the strict stealthiness, named KL divergence, is employed to describe the attacker’s the stealthiness metric. Third, the one-time and holistic optimization problems of stealthy attacks are solved by exploiting the Lagrange multiplier method. Then the constrained optimal attack strategies are obtained to produce the largest ultimate estimation error covariance. Finally, two simulation cases are provided to confirm the correctness of the designed attack strategies.
- Open Access
- 27 April 2023
- Published by Wiley
On Equivalence of State Based Potential Games
By the method of semi-tensor product of matrices, state based potential games are investigated. Firstly, using the potential equation, a necessary and sufficient condition and a sufficient condition are proposed, respectively, to verify whether a state based game is potential. Then two static equivalence conditions of state based potential games are presented. Furthermore, the dynamic equivalence is given such that the state based games dynamically equivalent to the state based potential games have similar dynamic properties. Lastly, the concept of state based networked evolutionary games is proposed. A necessary and sufficient condition is given to assure a state based networked evolutionary game is potential.
- 27 April 2023
- Published by Wiley
Open AccessOn Equivalence of State Based Potential Games
By the method of semi-tensor product of matrices, state based potential games are investigated. Firstly, using the potential equation, a necessary and sufficient condition and a sufficient condition are proposed, respectively, to verify whether a state based game is potential. Then two static equivalence conditions of state based potential games are presented. Furthermore, the dynamic equivalence is given such that the state based games dynamically equivalent to the state based potential games have similar dynamic properties. Lastly, the concept of state based networked evolutionary games is proposed. A necessary and sufficient condition is given to assure a state based networked evolutionary game is potential.
- 28 December 2022
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 35 (6) , 2208-2222
Orthogonal Decomposition of Incomplete-Profile Finite Game Space
- 28 December 2022
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 35 (6) , 2208-2222
Orthogonal Decomposition of Incomplete-Profile Finite Game Space