Searcharxiv⌕ Search

arXiv subjects

Chengcheng Zhao

Publications and source records attributed to Chengcheng Zhao.

21 records · Page 2Linked to original sources

System Identification with Variance Minimization via Input Design

The subspace method is one of the mainstream system identification method of linear systems, and its basic idea is to estimate the system parameter matrices by projecting them into a subspace related to input and output. However, most of the existing subspace methods cannot have the statistic performance guaranteed since the lack of closed-form expression of the estimation. Meanwhile, traditional subspace methods cannot deal with the uncertainty of the noise, and thus stable identification results cannot be obtained. In this paper, we propose a novel improved subspace method from the perspective of input design, which guarantees the consistent and stable identification results with the minimum variance. Specifically, we first obtain a closed-form estimation of the system matrix, then analyze the statistic performance by deriving the maximum identification deviation. This identification deviation maximization problem is non-convex, and is solved by splitting it into two sub-problems with the optimal solution guaranteed. Next, an input design method is proposed to deal with the uncertainty and obtain stable identification results by minimizing the variance. This problem is formulated as a constrained min-max optimization problem. The optimal solution is obtained from transforming the cost function into a convex function while ensuring the safety constraints through the method of predictive control. We prove the consistency and the convergence of the proposed method. Simulation demonstrates the effectiveness of our method.

eess.SY↗

False Data Injection Attacks and the Distributed Countermeasure in DC Microgrids

In this paper, we consider a hierarchical control based DC microgrid (DCmG) equipped with unknown input observer (UIO) based detectors, where the potential false data injection (FDI) attacks and the distributed countermeasure are investigated. First, we find that the vulnerability of the UIO-based detector originates from the lacked knowledge of true unknown inputs. Zero trace stealthy (ZTS) attacks can be launched by secretly faking the unknown inputs, under which the detection residual will not be altered, and the impact on the DCmG in terms of voltage balancing and current sharing is theoretically analyzed. Then, to mitigate the ZTS attack, we propose an automatic and timely countermeasure based on the average point of common coupling (PCC) voltage obtained from the dynamic average consensus (DAC) estimator. The integrity of the communicated data utilized in DAC estimators is guaranteed via UIO-based detectors, where the DAC parameters are perturbed in a fixed period to be concealed from attackers. Finally, the detection and mitigation performance of the proposed countermeasure is rigorously investigated, and extensive simulations are conducted in Simulink/PLECS to validate the theoretical results.

eess.SY↗

Privacy-preserving Average Consensus: Privacy Analysis and Optimal Algorithm Design

Privacy-preserving average consensus aims to guarantee the privacy of initial states and asymptotic consensus on the exact average of the initial value. In existing work, it is achieved by adding and subtracting variance decaying and zero-sum random noises to the consensus process. However, there is lack of theoretical analysis to quantify the degree of the privacy protection. In this paper, we introduce the maximum disclosure probability that the other nodes can infer one node's initial state within a given small interval to quantify the privacy. We develop a novel privacy definition, named $(ε, δ)$-data-privacy, to depict the relationship between maximum disclosure probability and estimation accuracy. Then, we prove that the general privacy-preserving average consensus (GPAC) provides $(ε, δ)$-data-privacy, and provide the closed-form expression of the relationship between $ε$ and $δ$. Meanwhile, it is shown that the added noise with uniform distribution is optimal in terms of achieving the highest $(ε, δ)$-data-privacy. We also prove that when all information used in the consensus process is available, the privacy will be compromised. Finally, an optimal privacy-preserving average consensus (OPAC) algorithm is proposed to achieve the highest $(ε, δ)$-data-privacy and avoid the privacy compromission. Simulations are conducted to verify the results.

eess.SY↗