Yuqing NI

Prof. Yuqing NI

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
2 May 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YNYuqing NI
Yuqing NI
ZGZiyang Guo
Ziyang Guo
YMYilin Mo
Yilin Mo
LSLing Shi
Ling Shi
We investigate the impact of reset attacks in cyber-physical systems. Two types of attack models, basic and advanced reset attacks, are considered in this paper. For the basic attack, which only injects a constant to the state estimate without knowing the system parameters, we provide a sufficient and necessary condition under which the adversary cannot destabilize the systems. On the other hand, advanced reset attacks, which can inject a predesigned sequence with full knowledge of system parameters, can be more devastating to cyber-physical systems. Depending on the goals of the adversary, we further categorize advanced reset attacks into Type-I advanced reset attack, where the adversary aims to drive the system estimation error to infinity, and Type-II advanced reset attack, where the goal of the adversary is to drive the system state to some other target states. A sufficient and necessary condition is presented for the existence of Type-I advanced reset attack. A closed-form optimal Type-II advanced reset attack is obtained by dynamic programing. Simulation results are provided to illustrate the effectiveness of both advanced reset attacks.

13 January 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YNYuqing NI
Yuqing NI
JWJunfeng Wu
Junfeng Wu
LLLi Li
Li Li
LSLing Shi
Ling Shi
In this paper we focus on the dynamic state estimation which harnesses a vast amount of sensing data harvested by multiple parties and recognize that in many applications, to improve collaborations between parties, the estimation procedure must be designed with the awareness of protecting participants' data and model privacy, where the latter refers to the privacy of key parameters of observation models. We develop a state estimation paradigm for the scenario where multiple parties with data and model privacy concerns are involved. Multiple parties monitor a physical dynamic process by deploying their own sensor networks and update the state estimate according to the average state estimate of all the parties calculated by a cloud server and security module. The paradigm taps additively homomorphic encryption which enables the cloud server and security module to jointly fuse parties' data while preserving the data privacy. Meanwhile, all the parties collaboratively develop a stable (or optimal) fusion rule without divulging sensitive model information. For the proposed filtering paradigm, we analyze the stabilization and the optimality. First, to stabilize the multi-party state estimator while preserving observation model privacy, two stabilization design methods are proposed. For special scenarios, the parties directly design their estimator gains by the matrix norm relaxation. For general scenarios, after transforming the original design problem into a convex semi-definite programming problem, the parties collaboratively derive suitable estimator gains based on the alternating direction method of multipliers (ADMM). Second, an optimal collaborative gain design method with model privacy guarantees is provided, which results in the asymptotic minimum mean square error (MMSE) state estimation. Finally, numerical examples are presented to illustrate our design and theoretical findings.

1 November 2018
Verified
Conference Paper
Closed access
KTKam Fai Elvis Tsang
Kam Fai Elvis Tsang
YNYuqing NI
Yuqing NI
CWCheuk Fung Raphael Wong
Cheuk Fung Raphael Wong
LSLing Shi
Ling Shi
We consider the problem of warehouse multi-robot automation system in discrete-time and discrete-space configuration with focus on the task allocation and conflict-free path planning. We present a system design where a centralized server handles the task allocation and each robot performs local path planning distributively. A genetic-based task allocation algorithm is firstly presented, with modification to enable heuristic learning. A semi-complete potential field based local path planning algorithm is then proposed, named the recursive excitation/relaxation artificial potential field (RERAPF). A mathematical proof is also presented to show the semi-completeness of the RERAPF algorithm. The main contribution of this paper is the modification of conventional artificial potential field (APF) to be semi-complete while computationally efficient, resolving the traditional issue of incompleteness. Simulation results are also presented for performance evaluation of the proposed path planning algorithm and the overall system.

5 May 2021 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
YNYuqing NI
Yuqing NI
XRXiaoqiang Ren
Xiaoqiang Ren
SDSubhrakanti Dey
Subhrakanti Dey
LSLing Shi
Ling Shi
This article studies how to design the encoder and decoder in the context of dynamic remote state estimation with a strategic sensor. The cost of the remote estimator is the estimation error covariance, whereas the cost of the self-interested strategic sensor includes an additional term related to its private information. A Stackelberg game is employed to model the interaction between the strategic sensor and the remote estimator, where the leader (strategic sensor) first designs the encoder, and the follower (remote estimator) then determines the decoder. We derive the optimal encoder and decoder based on the mismatched cost functions, and characterize the equilibrium for some special cases. One interesting result is that the equilibrium can be achieved by transmitting nothing under certain conditions. The main results are illustrated by numerical examples.

2 August 2019 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
YNYuqing NI
Yuqing NI
ALAlex Leong
Alex Leong
DQDaniel E. Quevedo
Daniel E. Quevedo
LSLing Shi
Ling Shi
We consider the communication channel pricing and selection problem in a networked control system. To encompass the sequentialized nature of the decision-making process, we use game theory and formulate a Stackelberg game framework, where the server first determines the channel pricing strategy, and the clients then make channel selection decisions. Both single-server-single-client (SSSC) scenario and single-server-multi-client (SSMC) scenario are discussed. The existence of an optimal stationary and deterministic policy for the clients is proved. We show that for the SSSC scenario, the server's optimal pricing strategy in terms of maximizing revenue is to ensure that the client uses the good channel all the time. For the SSMC scenario, it is assumed that the channel price remains invariant. As a consequence, each client has an optimal policy with threshold structure. Some properties of the optimal policy pair for both scenarios are obtained. Simulation results confirm the structure and properties of both the server and clients' optimal strategies.

25 May 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ZGZiyang Guo
Ziyang Guo
YNYuqing NI
Yuqing NI
WWWing Shing Wong
Wing Shing Wong
LSLing Shi
Ling Shi
We consider time synchronization attack against multi-system scheduling in a remote state estimation scenario where a number of sensors monitor different linear dynamical processes and schedule their transmissions through a shared collision channel. We show that by randomly injecting relative time offsets on the sensors, the malicious attacker is able to make the expected estimation error covariance of the overall system diverge without any system knowledge. For the case that the attacker has full system information, we propose an efficient algorithm to calculate the optimal attack, which spoofs the least number of sensors and leads to unbounded average estimation error covariance. To mitigate the attack consequence, we further propose a countermeasure by constructing shift invariant transmission policies and characterize the lower and upper bounds for system estimation performance. Simulation examples are provided to illustrate the obtained results.