Sabato Manfredi
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
Sabato Manfredi has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
M. di Bernardo
Dipartimento di Informatica e Sistemistica, University of Naples FEDERICO II, Via Claudio, 21 - I80125 Napoli Italy
8 shared publications- David Angeli
Department of Electrical and Electronic Engineering, Imperial College London, London, U.K.
7 shared publications Edmondo Di Tucci
University of Naples Federico II
6 shared publicationsF. Garofalo
6 shared publicationsD. Angeli
Control and Power Group, Electrical and Electronic Engineering Department, Imperial College, London
4 shared publications- Mario Pagano
Department of Electrical Engineering and Information Technology, University of Naples Federico II, Naples, Italy
4 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 136-148
A Reproducible Low-Cost Three-Tank CPS Laboratory Setup for Networked Centralized and Distributed Consensus Strategies
- 2 September 2026
- Published by Springer Nature
- p. 136-148
A Reproducible Low-Cost Three-Tank CPS Laboratory Setup for Networked Centralized and Distributed Consensus Strategies
- Open Access
- 24 July 2026
- Published by Elsevier in European Journal of Control
An LMI approach to generalized finite-time stability and stabilizability of linear time-varying systems
- 24 July 2026
- Published by Elsevier in European Journal of Control
Open AccessAn LMI approach to generalized finite-time stability and stabilizability of linear time-varying systems
- 13 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 9827-9844
Socially Optimal Linear Quadratic Control With Resilience for Vehicle Platooning
The growing deployment of networked multi-vehicle systems for autonomous mobility and logistics underscores the need for robust and resilient control under adversarial and uncertain conditions. Vehicular platooning offers benefits in traffic efficiency, energy savings, and safety; yet, conventional equilibrium-based control schemes remain vulnerable to cyber-physical attacks such as jamming, spoofing, and denial-of-service (DoS), threatening reliable coordination. In this paper, we propose a socially optimal linear-quadratic (LQ) control framework that embeds collective performance objectives directly into the quadratic cost formulation. This approach targets operating configurations that reflect platoon-level social optimality, which may differ from the closed-loop equilibrium. This results in an extended LQ tracking formulation that steers the platoon toward the equilibrium closest, in a quadratic sense, to the socially optimal configuration. To counter adversarial conditions, we integrate resilience mechanisms against cyber-physical attacks—including false data injection (FDI), spoofing, and jamming—addressing attacks directed at the supervisory unit and individual vehicles. Simulation results demonstrate the effectiveness, robustness, and practical implementability of the proposed approach in both nominal and adversarial scenarios.
- 13 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 9827-9844
Socially Optimal Linear Quadratic Control With Resilience for Vehicle Platooning
The growing deployment of networked multi-vehicle systems for autonomous mobility and logistics underscores the need for robust and resilient control under adversarial and uncertain conditions. Vehicular platooning offers benefits in traffic efficiency, energy savings, and safety; yet, conventional equilibrium-based control schemes remain vulnerable to cyber-physical attacks such as jamming, spoofing, and denial-of-service (DoS), threatening reliable coordination. In this paper, we propose a socially optimal linear-quadratic (LQ) control framework that embeds collective performance objectives directly into the quadratic cost formulation. This approach targets operating configurations that reflect platoon-level social optimality, which may differ from the closed-loop equilibrium. This results in an extended LQ tracking formulation that steers the platoon toward the equilibrium closest, in a quadratic sense, to the socially optimal configuration. To counter adversarial conditions, we integrate resilience mechanisms against cyber-physical attacks—including false data injection (FDI), spoofing, and jamming—addressing attacks directed at the supervisory unit and individual vehicles. Simulation results demonstrate the effectiveness, robustness, and practical implementability of the proposed approach in both nominal and adversarial scenarios.
- Open Access
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
Balancing resilience and optimality in distributed optimization for cyber-physical systems
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
Open AccessBalancing resilience and optimality in distributed optimization for cyber-physical systems
- Open Access
- 19 February 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Resilient distributed Kalman filtering for cyber-physical systems via mean subsequence reduction
- 19 February 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Open AccessResilient distributed Kalman filtering for cyber-physical systems via mean subsequence reduction
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (6) , 4024-4030
Robust Dynamic Corrective Consensus Over Lossy Networks With Gilbert–Elliott Channels
In this article, we propose a distributed algorithm to track the average of time-varying reference signals at nodes (i.e., dynamic average consensus) over networks with heterogeneous, asymmetric Gilbert–Elliott (GE) type lossy channels. The algorithm is robust to GE type network disruptions, (re)-initialization errors and agents joining, faulty or leaving the network during time. Necessary and sufficient conditions are formulated to assess almost sure and mean bounded dynamic average consensus according to the characteristics of reference signals. The proposed conditions can be used for design purpose as they relate algorithm step size, network connectivity, and channel quality parameters (e.g., recovery and failure rate) to the algorithm convergence. Simulations confirm the effectiveness of the proposed algorithm and design conditions in two representative validation scenarios.
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (6) , 4024-4030
Robust Dynamic Corrective Consensus Over Lossy Networks With Gilbert–Elliott Channels
In this article, we propose a distributed algorithm to track the average of time-varying reference signals at nodes (i.e., dynamic average consensus) over networks with heterogeneous, asymmetric Gilbert–Elliott (GE) type lossy channels. The algorithm is robust to GE type network disruptions, (re)-initialization errors and agents joining, faulty or leaving the network during time. Necessary and sufficient conditions are formulated to assess almost sure and mean bounded dynamic average consensus according to the characteristics of reference signals. The proposed conditions can be used for design purpose as they relate algorithm step size, network connectivity, and channel quality parameters (e.g., recovery and failure rate) to the algorithm convergence. Simulations confirm the effectiveness of the proposed algorithm and design conditions in two representative validation scenarios.
- Open Access
- 21 November 2024
- Published by Elsevier in Control Engineering Practice
- Vol. 154
A resilient consensus algorithm with inputs for the distributed monitoringof cyber-physical systems
- 21 November 2024
- Published by Elsevier in Control Engineering Practice
- Vol. 154
Open AccessA resilient consensus algorithm with inputs for the distributed monitoringof cyber-physical systems
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1273-1280
Consensus Protocols in Networks With 1-to- Joint-Agent Interactions
In the scientific literature of the past two decades many conditions to assess consensus-ability in multiagent networks with 1-to-1 interactions have been proposed. More recently the framework has been extended to include the $m$-to-1 type-interactions, referred as joint-agent interactions. In this article, we consider a novel framework of networks with 1-to-$n$ interactions, potentially extendable to $m$-to-$n$ ones, and formulate sufficient and necessary analytical conditions for consensus-ability. The considered interactions may also well represent the heterophilous dynamics in opinion and social systems. Finally, shedding light on the scenario of 1-to-$n$ interactions could inspire the formulation of new distributed algorithms to be exploited in engineering applications.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1273-1280
Consensus Protocols in Networks With 1-to- Joint-Agent Interactions
In the scientific literature of the past two decades many conditions to assess consensus-ability in multiagent networks with 1-to-1 interactions have been proposed. More recently the framework has been extended to include the $m$-to-1 type-interactions, referred as joint-agent interactions. In this article, we consider a novel framework of networks with 1-to-$n$ interactions, potentially extendable to $m$-to-$n$ ones, and formulate sufficient and necessary analytical conditions for consensus-ability. The considered interactions may also well represent the heterophilous dynamics in opinion and social systems. Finally, shedding light on the scenario of 1-to-$n$ interactions could inspire the formulation of new distributed algorithms to be exploited in engineering applications.
- 4 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (10) , 11844-11853
Robust Consensus Design of Uncertain Multiagent Systems With Bounded Gains and Incremental Nonlinear Interactions
This article presents design conditions to address the robust leader–follower consensus problem in uncertain multiagent systems (MASs) with bounded gains and nonlinear interactions. The gains are restricted to an interval of values determined by either parameter uncertainties or the constraints of the agents, inherent in an industrial setting. In addition, we model the unavoidable nonlinear uncertainties in MAS and its communication architecture using incremental sector-bounded time-varying nonlinear functions, which are particularly well-suited for relative state information-based cooperative protocols. By leveraging Lyapunov stability theory and the linear matrix inequality (LMI) technique, we establish LMI conditions for the distributed design of control gains for both leader and followers. The proposed LMIs exhibit scalability, as they remain independent of the number of nodes and do not necessitate global information regarding the Laplacian eigenvalues, making them well-suited for the design of industrial large-scale MASs. Finally, we numerically and experimentally validate the proposed design approach for paradigmatic scenarios: industrial warehouse inventory management systems and leader–follower algorithm for smart grid and decision-making management applications.
- 4 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (10) , 11844-11853
Robust Consensus Design of Uncertain Multiagent Systems With Bounded Gains and Incremental Nonlinear Interactions
This article presents design conditions to address the robust leader–follower consensus problem in uncertain multiagent systems (MASs) with bounded gains and nonlinear interactions. The gains are restricted to an interval of values determined by either parameter uncertainties or the constraints of the agents, inherent in an industrial setting. In addition, we model the unavoidable nonlinear uncertainties in MAS and its communication architecture using incremental sector-bounded time-varying nonlinear functions, which are particularly well-suited for relative state information-based cooperative protocols. By leveraging Lyapunov stability theory and the linear matrix inequality (LMI) technique, we establish LMI conditions for the distributed design of control gains for both leader and followers. The proposed LMIs exhibit scalability, as they remain independent of the number of nodes and do not necessitate global information regarding the Laplacian eigenvalues, making them well-suited for the design of industrial large-scale MASs. Finally, we numerically and experimentally validate the proposed design approach for paradigmatic scenarios: industrial warehouse inventory management systems and leader–follower algorithm for smart grid and decision-making management applications.