Xingkang He

Xingkang He

Auto-generated profile, based on publicly available information

Xingkang He

School of Electrical Engineering and Computer Science Division of Decision and Control Systems KTH Royal Institute of Technology, and Digital Futures Stockholm Sweden

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
27 March 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XHXingkang He
Xingkang He
CHChen Hu
Chen Hu
Yiguang HongYiguang Hong
Yiguang Hong
LSLing Shi
Ling Shi
HFHai-Tao Fang
Hai-Tao Fang
In this paper, we investigate a distributed estimation problem for multi-agent systems with state equality constraints (SEC). First, under a time-based consensus communication protocol, applying a modified projection operator and the covariance intersection fusion method, we propose a distributed Kalman filter with guaranteed consistency and satisfied SEC. Furthermore, we establish the relationship between consensus step, SEC and estimation error covariance in dynamic and steady processes, respectively. Employing a space decomposition method, we show that the error covariance in the constraint set can be arbitrarily small by setting a sufficiently large consensus step. Besides, we propose an extended collective observability (ECO) condition based on SEC, which is milder than existing observability conditions. Under the ECO condition, through utilizing a technique of matrix approximation, we prove the boundedness of error covariance and the exponentially asymptotic unbiasedness of state estimate, respectively. Moreover, under the ECO condition for linear time-invariant systems with SEC, we provide a novel eventtriggered communication protocol by employing the consistency, and give an offline design principle of triggering thresholds with guaranteed boundedness of error covariance. More importantly, we quantify and analyze the communication rate for the proposed event-triggered distributed Kalman filter, and provide optimization based methods to obtain the minimal (maximal) successive non-triggering (triggering) times. Two simulations are provided to demonstrate the developed theoretical results and the effectiveness of the filters

25 June 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XHXingkang He
Xingkang He
XRXiaoqiang Ren
Xiaoqiang Ren
HSHenrik Sandberg
Henrik Sandberg
KJKarl Henrik Johansson
Karl Henrik Johansson
In this article, we study how to secure distributed filters for linear time-invariant systems with bounded noise under false-data injection attacks. A malicious attacker is able to arbitrarily manipulate the observations for a time-varying and unknown subset of the sensors. We first propose a recursive distributed filter consisting of two steps at each update. The first step employs a saturation-like scheme, which gives a small gain if the innovation is large corresponding to a potential attack. The second step is a consensus operation of state estimates among neighboring sensors. We prove the estimation error is upper bounded if the filter parameters satisfy a condition. We further analyze the feasibility of the condition and connect it to sparse observability in the centralized case. When the attacked sensor set is known to be time-invariant, the secured filter is modified by adding an online local attack detector. The detector is able to identify the attacked sensors whose observation innovations are larger than the detection thresholds. Also, with more attacked sensors being detected, the thresholds will adaptively adjust to reduce the space of the stealthy attack signals. The resilience of the secured filter with detection is verified by an explicit relationship between the upper bound of the estimation error and the number of detected attacked sensors. Moreover, for the noise-free case, we prove that the state estimate of each sensor asymptotically converges to the system state under certain conditions. Numerical simulations are provided to illustrate the developed results.

19 April 2022 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
XHXingkang He
Xingkang He
YXYu Xing
Yu Xing
JWJunfeng Wu
Junfeng Wu
KJKarl H. Johansson
Karl H. Johansson
We study distributed estimation of a high-dimensional static parameter vector through a group of sensors whose communication network is modeled by a fixed directed graph. Different from existing ti...

24 February 2023 in European Journal of Control
Verified
Journal Article
Closed access
AAAmr Alanwar
Amr Alanwar
VGVictor Gaßmann
Victor Gaßmann
XHXingkang He
Xingkang He
HSHazem Said
Hazem Said
HSHenrik Sandberg
Henrik Sandberg
MAMatthias Althoff
Matthias Althoff

5 April 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XHXingkang He
Xingkang He
KJKarl Henrik Johansson
Karl Henrik Johansson
HFHaitao Fang
Haitao Fang
We study distributed filtering for a class of uncertain systems over corrupted communication channels. We propose a distributed robust Kalman filter with stochastic gains, through which upper bounds of the conditional mean square estimation errors are calculated online. We present a robust collective observability condition, under which the mean square error of the distributed filter is proved to be uniformly upper bounded if the network is strongly connected. For better performance, we modify the filer by introducing a switching fusion scheme based on a sliding window. It provides a smaller upper bound of the conditional mean square error. Numerical simulations are provided to validate the theoretical results and show that the filter scales to large networks.

18 July 2023 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XHXingkang He
Xingkang He
XYXinlei Yi
Xinlei Yi
YZYanlong Zhao
Yanlong Zhao
KJKarl Henrik Johansson
Karl Henrik Johansson
VGVijay Gupta
Vijay Gupta
Federated learning (FL) is a collaborative machine learning (ML) paradigm based on persistent communication between a central server and multiple edge devices. However, frequent communication of large ML models can incur considerable communication resources, especially costly for wireless network nodes. In this paper, we develop a communication-efficient protocol to reduce the number of communication instances in each round while maintaining convergence rate and asymptotic distribution properties. First, we propose a novel communication-efficient FL algorithm that utilizes an event-triggered communication mechanism, where each edge device updates the model by using stochastic gradient descent with local sampling data and the central server aggregates all local models from the devices by using model averaging. Communication can be reduced since each edge device and the central server transmits its updated model only when the difference between the current model and the last communicated model is larger than a threshold. Thresholds of the devices and server are not necessarily coordinated, and the thresholds and step sizes are not constrained to be of specific forms. Under mild conditions on loss functions, step sizes and thresholds, for the proposed algorithm, we establish asymptotic analysis results in three ways, respectively: convergence in expectation, almost-sure convergence, and asymptotic distribution of the estimation error. In addition, we show that by fine-tunning the parameters, the proposed event-triggered FL algorithm can reach the same convergence rate as state-of-the-art results from existing time-driven FL. We also establish asymptotic efficiency in the sense of Central Limit Theorem of the estimation error. Numerical simulations for linear regression and image classification problems in the literature are provided to show the effectiveness of the developed results.