Michelle S. Chong
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
Research Subjects
Michelle S. Chong has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Romain Postoyan
Université de Lorraine CNRS CRAN F-54000 Nancy France
10 shared publications - Levin Kuhlmann
Monash University
7 shared publications - Dragan Nesic
Department of Electrical and Electronic Engineering University of Melbourne 3010 Parkville VIC Australia
6 shared publications Andrea Varsavsky
3 shared publicationsHenrik Sandberg
3 shared publications- Henrik Sandberg
KTH Royal Institute of Technology
3 shared publications
Latest Publications
- Open Access
- 4 September 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 218
Unimodal self-oscillations and their sign-symmetry for discrete-time relay feedback systems with dead zone
- 4 September 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 218
Open AccessUnimodal self-oscillations and their sign-symmetry for discrete-time relay feedback systems with dead zone
- Open Access
- 3 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
Secure Set-based State Estimation for Safety-Critical Applications under Adversarial Attacks on Sensors
Set-based state estimation provides guaranteed state inclusion certificates that are crucial for the safety verification of dynamical systems. However, when system sensors are subject to cyberattacks, maintaining both safety and security guarantees becomes a fundamental challenge. Existing point-based secure state estimation methods cannot adequately address this challenge because they cannot provide state inclusion certificates. This paper introduces a novel approach that simultaneously ensures safety guarantees through guaranteed state inclusion and security guarantees against sensor attacks, without imposing conservative restrictions on system operation. We propose a Secure Set-based State Estimation (S3E) algorithm that maintains the true system state within the estimated set under sensor attacks, provided the initialization set contains the initial state and the system remains observable from the uncompromised sensor subset. The algorithm provides the estimated set as a collection of constrained zonotopes (agreement sets), which can be used as robust certificates to verify whether the system adheres to safety constraints. Furthermore, we demonstrate that the estimated set remains unaffected by attack signals of sufficiently large magnitude and also establish sufficient conditions for attack detection, identification, and filtering. This compels the attacker to inject only signals of small magnitudes to evade detection, thus preserving the accuracy of the estimated set. To address the computational complexity of the algorithm, we offer several strategies for complexity-performance tradeoffs. The efficacy of the proposed algorithm is illustrated through several examples, including its application to a three-story building model.
- 3 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
Open AccessSecure Set-based State Estimation for Safety-Critical Applications under Adversarial Attacks on Sensors
Set-based state estimation provides guaranteed state inclusion certificates that are crucial for the safety verification of dynamical systems. However, when system sensors are subject to cyberattacks, maintaining both safety and security guarantees becomes a fundamental challenge. Existing point-based secure state estimation methods cannot adequately address this challenge because they cannot provide state inclusion certificates. This paper introduces a novel approach that simultaneously ensures safety guarantees through guaranteed state inclusion and security guarantees against sensor attacks, without imposing conservative restrictions on system operation. We propose a Secure Set-based State Estimation (S3E) algorithm that maintains the true system state within the estimated set under sensor attacks, provided the initialization set contains the initial state and the system remains observable from the uncompromised sensor subset. The algorithm provides the estimated set as a collection of constrained zonotopes (agreement sets), which can be used as robust certificates to verify whether the system adheres to safety constraints. Furthermore, we demonstrate that the estimated set remains unaffected by attack signals of sufficiently large magnitude and also establish sufficient conditions for attack detection, identification, and filtering. This compels the attacker to inject only signals of small magnitudes to evade detection, thus preserving the accuracy of the estimated set. To address the computational complexity of the algorithm, we offer several strategies for complexity-performance tradeoffs. The efficacy of the proposed algorithm is illustrated through several examples, including its application to a three-story building model.
- Open Access
Secondary Safety Control for Systems with Sector Bounded Nonlinearities [Extended Version]
We consider the problem of safety verification and safety-aware controller synthesis for systems with sector bounded nonlinearities. We aim to keep the states of the system within a given safe set under potential actuator and sensor attacks. Specifically, we adopt the setup that a controller has already been designed to stabilize the plant. Using invariant sets and barrier certificate theory, we first give sufficient conditions to verify the safety of the closed-loop system under attacks. Furthermore, by using a subset of sensors that are assumed to be free of attacks, we provide a synthesis method for a secondary controller that enhances the safety of the system. The sufficient conditions to verify safety are derived using Lyapunov-based tools and the S-procedure. Using the projection lemma, the conditions are then formulated as linear matrix inequality (LMI) problems which can be solved efficiently. Lastly, our theoretical results are illustrated through numerical simulations.
Open AccessSecondary Safety Control for Systems with Sector Bounded Nonlinearities [Extended Version]
We consider the problem of safety verification and safety-aware controller synthesis for systems with sector bounded nonlinearities. We aim to keep the states of the system within a given safe set under potential actuator and sensor attacks. Specifically, we adopt the setup that a controller has already been designed to stabilize the plant. Using invariant sets and barrier certificate theory, we first give sufficient conditions to verify the safety of the closed-loop system under attacks. Furthermore, by using a subset of sensors that are assumed to be free of attacks, we provide a synthesis method for a secondary controller that enhances the safety of the system. The sufficient conditions to verify safety are derived using Lyapunov-based tools and the S-procedure. Using the projection lemma, the conditions are then formulated as linear matrix inequality (LMI) problems which can be solved efficiently. Lastly, our theoretical results are illustrated through numerical simulations.
- 15 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 463-470
Time- and Event-Triggered Communication for Multi-Agent Systems—Part II: Digital Implementation and Resilience
We consider the design of event-triggered distributed controllers for multi-agent systems that are digitally implemented on local computation platforms and communicate over a packet-based network. Each agent is equipped with a local triggering mechanism that is only evaluated at the local sampling instants, thereby taking a periodic event-triggered approach in which the sampling intervals are allowed to vary (jitter). Moreover, the locally triggered transmissions are subject to unknown, bounded delays, and a destination protocol is locally implemented to only send the packet to a selection of the neighboring agents at each triggering instant. Building upon the framework of Part I, we present an emulation-based design of the local periodic event-triggering rules, including the maximum allowable sampling period (MASP), so that, under appropriate conditions, a general dissipativity property holds for the overall system. Interestingly, the presented digital implementation requires only minor modifications to the conditions presented in Part I. Additionally, we show how to exploit the destination protocols to ensure resilience to information loss issues such as packet losses and denial-of-service. We conclude this paper with case studies on the consensus of single integrator agents and a nonlinear stabilization problem.
- 15 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 463-470
Time- and Event-Triggered Communication for Multi-Agent Systems—Part II: Digital Implementation and Resilience
We consider the design of event-triggered distributed controllers for multi-agent systems that are digitally implemented on local computation platforms and communicate over a packet-based network. Each agent is equipped with a local triggering mechanism that is only evaluated at the local sampling instants, thereby taking a periodic event-triggered approach in which the sampling intervals are allowed to vary (jitter). Moreover, the locally triggered transmissions are subject to unknown, bounded delays, and a destination protocol is locally implemented to only send the packet to a selection of the neighboring agents at each triggering instant. Building upon the framework of Part I, we present an emulation-based design of the local periodic event-triggering rules, including the maximum allowable sampling period (MASP), so that, under appropriate conditions, a general dissipativity property holds for the overall system. Interestingly, the presented digital implementation requires only minor modifications to the conditions presented in Part I. Additionally, we show how to exploit the destination protocols to ensure resilience to information loss issues such as packet losses and denial-of-service. We conclude this paper with case studies on the consensus of single integrator agents and a nonlinear stabilization problem.
- Open Access
Reachable set-based dynamic quantization for the remote state estimation of linear systems
We employ reachability analysis in designing dynamic quantization schemes for the remote state estimation of linear systems over a finite date rate communication channel. The quantization region is dynamically updated at each transmission instant, with an approximated reachable set of the linear system. We propose a set-based method using zonotopes and compare it to a norm-based method in dynamically updating the quantization region. For both methods, we guarantee that the quantization error is bounded and consequently, the remote state reconstruction error is also bounded. To the best of our knowledge, the set-based method using zonotopes has no precedent in the literature and admits a larger class of linear systems and communication channels, where the set-based method allows for a longer inter-transmission time and lower bit rate. Finally, we corroborate our theoretical guarantees with a numerical example.
Open AccessReachable set-based dynamic quantization for the remote state estimation of linear systems
We employ reachability analysis in designing dynamic quantization schemes for the remote state estimation of linear systems over a finite date rate communication channel. The quantization region is dynamically updated at each transmission instant, with an approximated reachable set of the linear system. We propose a set-based method using zonotopes and compare it to a norm-based method in dynamically updating the quantization region. For both methods, we guarantee that the quantization error is bounded and consequently, the remote state reconstruction error is also bounded. To the best of our knowledge, the set-based method using zonotopes has no precedent in the literature and admits a larger class of linear systems and communication channels, where the set-based method allows for a longer inter-transmission time and lower bit rate. Finally, we corroborate our theoretical guarantees with a numerical example.
- Open Access
Safety monitoring under stealthy sensor injection attacks using reachable sets
Stealthy sensor injection attacks are serious threats for industrial plants as they can compromise the plant's integrity without being detected by traditional fault detectors. In this manuscript, we study the possibility of revealing the presence of such attacks by monitoring only the control input. This approach consists in computing an ellipsoidal bound of the input reachable set. When the control input does not belong to this set, this means that a stealthy sensor injection attack is driving the plant to critical states. The problem of finding this ellipsoidal bound is posed as a convex optimization problem (convex cost with Linear Matrix Inequalities constraints). Our monitoring approach is tested in simulation.
Open AccessSafety monitoring under stealthy sensor injection attacks using reachable sets
Stealthy sensor injection attacks are serious threats for industrial plants as they can compromise the plant's integrity without being detected by traditional fault detectors. In this manuscript, we study the possibility of revealing the presence of such attacks by monitoring only the control input. This approach consists in computing an ellipsoidal bound of the input reachable set. When the control input does not belong to this set, this means that a stealthy sensor injection attack is driving the plant to critical states. The problem of finding this ellipsoidal bound is posed as a convex optimization problem (convex cost with Linear Matrix Inequalities constraints). Our monitoring approach is tested in simulation.
- 25 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 1772-1777
Memory Saving State-Sharing Multi-Observer for a Class of Multi-Observer-Based Algorithms
A multi-observer is a bank of observers which is used for state estimation in various applications. However, it has an implementation bottleneck when a large number of observers are required for the desired estimation performance. To overcome this problem, we propose the design method of a state-sharing multi-observer for a class of nonlinear systems. The state-sharing multi-observer is a single observer that integrates a bank of observers, and its state size is independent of the number of observers. We analyze the error of the state obtained from the state-sharing multi-observer, and then show its applicability to multi-observer based algorithms such as supervisory observers and in secure state estimation.
- 25 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 1772-1777
Memory Saving State-Sharing Multi-Observer for a Class of Multi-Observer-Based Algorithms
A multi-observer is a bank of observers which is used for state estimation in various applications. However, it has an implementation bottleneck when a large number of observers are required for the desired estimation performance. To overcome this problem, we propose the design method of a state-sharing multi-observer for a class of nonlinear systems. The state-sharing multi-observer is a single observer that integrates a bank of observers, and its state size is independent of the number of observers. We analyze the error of the state obtained from the state-sharing multi-observer, and then show its applicability to multi-observer based algorithms such as supervisory observers and in secure state estimation.
- Open Access
Resilient Set-based State Estimation for Linear Time-Invariant Systems Using Zonotopes
This paper considers the problem of set-based state estimation for linear time-invariant (LTI) systems under time-varying sensor attacks. Provided that the LTI system is stable and observable via every single sensor and that at least one sensor is uncompromised, we guarantee that the true state is always contained in the estimated set. We use zonotopes to represent these sets for computational efficiency. However, we show that intelligently designed stealthy attacks may cause exponential growth in the algorithm's worst-case complexity. We present several strategies to handle this complexity issue and illustrate our resilient zonotope-based state estimation algorithm on a rotating target system.
Open AccessResilient Set-based State Estimation for Linear Time-Invariant Systems Using Zonotopes
This paper considers the problem of set-based state estimation for linear time-invariant (LTI) systems under time-varying sensor attacks. Provided that the LTI system is stable and observable via every single sensor and that at least one sensor is uncompromised, we guarantee that the true state is always contained in the estimated set. We use zonotopes to represent these sets for computational efficiency. However, we show that intelligently designed stealthy attacks may cause exponential growth in the algorithm's worst-case complexity. We present several strategies to handle this complexity issue and illustrate our resilient zonotope-based state estimation algorithm on a rotating target system.
- Open Access
Event-Triggered State Estimation with Multiple Noisy Sensor Nodes
General nonlinear continuous-time systems are considered for which its state is estimated via a packet-based communication network. We assume that the system has multiple sensor nodes, affected by measurement noise, which can transmit at discrete (non-equidistant) points in time. Moreover, each node can transmit asynchronously. For this setup, we develop a state estimation framework, where the transmission instances of the individual sensor nodes can be generated in either time-triggered or event-triggered fashions. In the latter case, we guarantee the absence of Zeno behavior by construction. It is shown that, under the provided design conditions, an input-to-state stability property is obtained for the estimation error with respect to the measurement noise and process disturbances and that the state is thus reconstructed asymptotically in the absence of noise. A numerical case study shows the strengths of the developed framework.
Open AccessEvent-Triggered State Estimation with Multiple Noisy Sensor Nodes
General nonlinear continuous-time systems are considered for which its state is estimated via a packet-based communication network. We assume that the system has multiple sensor nodes, affected by measurement noise, which can transmit at discrete (non-equidistant) points in time. Moreover, each node can transmit asynchronously. For this setup, we develop a state estimation framework, where the transmission instances of the individual sensor nodes can be generated in either time-triggered or event-triggered fashions. In the latter case, we guarantee the absence of Zeno behavior by construction. It is shown that, under the provided design conditions, an input-to-state stability property is obtained for the estimation error with respect to the measurement noise and process disturbances and that the state is thus reconstructed asymptotically in the absence of noise. A numerical case study shows the strengths of the developed framework.
- Open Access
Adaptive voltage regulation of an inverter-based power distribution network with a class of droop controllers
The voltage received by each customer connected to a power distribution line with local controllers (inverters) is regulated to be within a desired margin through a class of slope-restricted controllers, known conventionally as \emph{droop} controllers. We adapt the design of the droop controllers according to the known bounds of the net power consumption of each customer in each observation time window. A sufficient condition for voltage regulation is provided for each time window, which guides the design of the droop controllers, depending on the properties of the distribution line (line impedances) and the upper bound of all the customers' power consumption during each time window. The resulting adaptive scheme is verified on a benchmark model of a European low-voltage network by the CIGRE task force.
Open AccessAdaptive voltage regulation of an inverter-based power distribution network with a class of droop controllers
The voltage received by each customer connected to a power distribution line with local controllers (inverters) is regulated to be within a desired margin through a class of slope-restricted controllers, known conventionally as \emph{droop} controllers. We adapt the design of the droop controllers according to the known bounds of the net power consumption of each customer in each observation time window. A sufficient condition for voltage regulation is provided for each time window, which guides the design of the droop controllers, depending on the properties of the distribution line (line impedances) and the upper bound of all the customers' power consumption during each time window. The resulting adaptive scheme is verified on a benchmark model of a European low-voltage network by the CIGRE task force.