Kam Fai Elvis Tsang

Kam Fai Elvis Tsang

Auto-generated profile, based on publicly available information

Kam Fai Elvis Tsang

Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
25 June 2020 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
KTKam Fai Elvis Tsang
Kam Fai Elvis Tsang
MHMengyu Huang
Mengyu Huang
KJKarl Henrik Johansson
Karl Henrik Johansson
LSLing Shi
Ling Shi
This letter investigates the problem of false data injection attack on the communication channels in a multi-agent system executing a consensus protocol. We formulate a non-convex optimisation problem for an attack strategy with minimal one-step attack energy to guarantee instability of the consensus system. We propose an algorithm based on ADMM to solve the problem efficiently in case standard solvers are not available. Numerical simulations are provided to illustrate the effectiveness of the attack strategy.

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.

16 December 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
KTKam Fai Elvis Tsang
Kam Fai Elvis Tsang
MHMengyu Huang
Mengyu Huang
LSLing Shi
Ling Shi
KJKarl Henrik Johansson
Karl Henrik Johansson
This paper investigates the problem of distributed convex optimisation under constrained communication. A novel stochastic event-triggering algorithm is shown to solve the problem asymptotically to any arbitrarily small error without exhibiting Zeno behaviour. A systematic design of the stochastic event processes is then derived from the analysis on optimality and communication rate with the help of a meta-optimisation problem. Lastly, a numerical example on distributed classification is provided to visualise the performance of the proposed algorithm in terms of convergence in optimisation error and average communication rate with comparison to other algorithms in the literature. We show that the proposed algorithm is highly effective in reducing communication rates compared with algorithms proposed in the literature.

1 July 2019
Verified
Conference Paper
Closed access
KTKam Fai Elvis Tsang
Kam Fai Elvis Tsang
JWJunfeng Wu
Junfeng Wu
LSLing Shi
Ling Shi