Amr Alanwar
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
Amr Alanwar has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Karl Henrik Johansson
KTH Royal Institute of Technology
14 shared publications - Mani Srivastava
University of California, Los Angeles, Los Angeles, CA, USA
9 shared publications Hassan Bedour
5 shared publicationsM. Watheq El-Kharashi
5 shared publicationsYousra Alkabani
5 shared publications- Muhammad Umar B. Niazi
Department of Decision and Control Systems, KTH Royal Institute of Technology, Sweden
4 shared publications
Latest Publications
- 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
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Data-Driven Reachability Analysis Using Matrix Perturbation Theory
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessData-Driven Reachability Analysis Using Matrix Perturbation Theory
- Open Access
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Informed Hybrid Zonotope-based Motion Planning Algorithm
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessInformed Hybrid Zonotope-based Motion Planning Algorithm
- Open Access
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Orthogonal Transformations for Efficient Data-Driven Reachability Analysis
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessOrthogonal Transformations for Efficient Data-Driven Reachability Analysis
- Open Access
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Set-Based Estimation Using Probabilistic Zonotopes to Ensure the Safety of Occluded Pedestrians
- 11 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessSet-Based Estimation Using Probabilistic Zonotopes to Ensure the Safety of Occluded Pedestrians
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (7) , 8495-8510
Data-Driven Predictive Control With Functional Safety Guarantees for Autonomous Vehicles
Navigation algorithms are responsible for decision-making in autonomous vehicles, generating safe trajectories based on post-processed sensor data to prevent collisions. However, failures in sensors or software modules can cause deviations from nominal behavior, potentially leading to unsafe situations. To comply with the ISO 26262 functional safety standard, road vehicles must perform a transition to a safe state when a failure is detected, until the corresponding safety goal is reached. This paper presents a novel control framework for navigation in autonomous vehicles, integrating data-driven reachability analysis and zonotopic predictive control to ensure functional safety (FuSa) under nominal conditions and potential system-level anomalies. The proposed framework explicitly accounts for interactions between vehicles, surrounding traffic participants, and infrastructure by incorporating traffic and infrastructure constraints into the control formulation. The proposed approach uses signal temporal logic specifications to formally define safe states and safety goals, guiding the zonotopic predictive control in executing safe maneuvers when they are required. The controller also enforces constraints on obstacle avoidance and infrastructure conditions, all represented as intervals or zonotopes for a unified formulation. The complete control framework is validated using data extracted from a real-world autonomous Renault Mégane (SAE Level 3), demonstrating its effectiveness in executing safe recovery maneuvers while ensuring compliance with the functional safety standard in real-world scenarios.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (7) , 8495-8510
Data-Driven Predictive Control With Functional Safety Guarantees for Autonomous Vehicles
Navigation algorithms are responsible for decision-making in autonomous vehicles, generating safe trajectories based on post-processed sensor data to prevent collisions. However, failures in sensors or software modules can cause deviations from nominal behavior, potentially leading to unsafe situations. To comply with the ISO 26262 functional safety standard, road vehicles must perform a transition to a safe state when a failure is detected, until the corresponding safety goal is reached. This paper presents a novel control framework for navigation in autonomous vehicles, integrating data-driven reachability analysis and zonotopic predictive control to ensure functional safety (FuSa) under nominal conditions and potential system-level anomalies. The proposed framework explicitly accounts for interactions between vehicles, surrounding traffic participants, and infrastructure by incorporating traffic and infrastructure constraints into the control formulation. The proposed approach uses signal temporal logic specifications to formally define safe states and safety goals, guiding the zonotopic predictive control in executing safe maneuvers when they are required. The controller also enforces constraints on obstacle avoidance and infrastructure conditions, all represented as intervals or zonotopes for a unified formulation. The complete control framework is validated using data extracted from a real-world autonomous Renault Mégane (SAE Level 3), demonstrating its effectiveness in executing safe recovery maneuvers while ensuring compliance with the functional safety standard in real-world scenarios.
- 10 January 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 156
Event-triggered consensus for multi-agent systems under output mask-based privacy preservation
- 10 January 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 156
Event-triggered consensus for multi-agent systems under output mask-based privacy preservation
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 149288-149310
Safe Multi-Robot Coordination via VLM–LLM Reasoning and Reachability Analysis
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 149288-149310
Open AccessSafe Multi-Robot Coordination via VLM–LLM Reasoning and Reachability Analysis
- 22 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2435-2440
An Affine Transformation Method to Privacy-Preserving Consensus for Multi-Agent Systems
This letter investigates the privacy-preserving consensus for multi-agent systems under affine transformation. To avoid privacy exposure, the true system state is reformulated into a new auxiliary state by adopting an affine transformation. By employing the consensus compensator under the analysis framework of output consensus, the original privacy-preserving consensus of homogeneous multi-agent systems (MASs) is reformulated into the equivalent non-privacy-preserving output consensus of heterogeneous MASs. Resorting to the Lyapunov function method, the design parameters are obtained such that the exact consensus value, instead of mean-square consensus, is achieved over both finite and infinite time domains. A simulation is utilized to validate the supplied method.
- 22 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2435-2440
An Affine Transformation Method to Privacy-Preserving Consensus for Multi-Agent Systems
This letter investigates the privacy-preserving consensus for multi-agent systems under affine transformation. To avoid privacy exposure, the true system state is reformulated into a new auxiliary state by adopting an affine transformation. By employing the consensus compensator under the analysis framework of output consensus, the original privacy-preserving consensus of homogeneous multi-agent systems (MASs) is reformulated into the equivalent non-privacy-preserving output consensus of heterogeneous MASs. Resorting to the Lyapunov function method, the design parameters are obtained such that the exact consensus value, instead of mean-square consensus, is achieved over both finite and infinite time domains. A simulation is utilized to validate the supplied method.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52110-52122
Privacy-Preserving Set-Based Estimation Using Differential Privacy and Zonotopes
For large-scale cyber-physical systems, the collaboration of spatially distributed sensors is often needed to perform the state estimation process. Privacy concerns arise from disclosing sensitive measurements to a cloud estimator. To solve this issue, we propose a differentially private set-based estimation protocol that guarantees true state containment in the estimated set and differential privacy (DP) for the sensitive measurements throughout the set-based state estimation process within the central DP (CDP) and local DP (LDP) models. Zonotopes are employed in the proposed differentially private set-based estimator, offering computational advantages in set operations. We consider a plant of a nonlinear discrete-time dynamical system with bounded modeling uncertainties, sensors that provide sensitive measurements with bounded measurement uncertainties, and a cloud estimator that predicts the system’s state. The privacy-preserving noise perturbs the centers of measurement zonotopes, thereby concealing the precise position of these zonotopes, i.e., ensuring privacy preservation for the sets containing sensitive measurements. Compared to existing research, our approach achieves less privacy loss and utility loss through the CDP and LDP models by leveraging a numerically optimized truncated noise distribution. The proposed estimator is perturbed by weaker noise than the analytical approaches in the literature to guarantee the same level of privacy, therefore improving the estimation utility. Numerical and comparison experiments with truncated Laplace noise are presented to support our approach.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52110-52122
Privacy-Preserving Set-Based Estimation Using Differential Privacy and Zonotopes
For large-scale cyber-physical systems, the collaboration of spatially distributed sensors is often needed to perform the state estimation process. Privacy concerns arise from disclosing sensitive measurements to a cloud estimator. To solve this issue, we propose a differentially private set-based estimation protocol that guarantees true state containment in the estimated set and differential privacy (DP) for the sensitive measurements throughout the set-based state estimation process within the central DP (CDP) and local DP (LDP) models. Zonotopes are employed in the proposed differentially private set-based estimator, offering computational advantages in set operations. We consider a plant of a nonlinear discrete-time dynamical system with bounded modeling uncertainties, sensors that provide sensitive measurements with bounded measurement uncertainties, and a cloud estimator that predicts the system’s state. The privacy-preserving noise perturbs the centers of measurement zonotopes, thereby concealing the precise position of these zonotopes, i.e., ensuring privacy preservation for the sets containing sensitive measurements. Compared to existing research, our approach achieves less privacy loss and utility loss through the CDP and LDP models by leveraging a numerically optimized truncated noise distribution. The proposed estimator is perturbed by weaker noise than the analytical approaches in the literature to guarantee the same level of privacy, therefore improving the estimation utility. Numerical and comparison experiments with truncated Laplace noise are presented to support our approach.