Haris E. Psillakis
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
Haris E. Psillakis has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Qingling Wang
School of Automation, Southeast University, Nanjing, China
7 shared publications A.T. Alexandridis
6 shared publications- Athanasios K. Gkesoulis
Athena Research Center, Robotics Institute, Marousi, Greece
5 shared publications - Changyin Sun
Southeast University, Nanjing, China
4 shared publications - Athanasios-Rafail Lagos
School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece
3 shared publications Thomas Giotis
Technical University of Crete
3 shared publications
Latest Publications
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 835-840
Distributed Adaptive Control for Constrained Nash Equilibrium Seeking With Delays
This letter addresses distributed Nash equilibrium (NE) seeking for a class of nonlinear Euler–Lagrange multi-agent systems subject to separable coupling constraints and constant communication delays. Each agent aims to regulate its output to the NE of a virtual static game while exchanging delayed information and operating under unknown dynamics and bounded disturbances. To this end, we introduce a set of delay-aware error variables embedding the gradients of the local cost and constraint functions. A distributed adaptive control law, combined with primal–dual projected dynamics, is designed to drive these errors to zero despite communication delays. Sufficient conditions on the controller gains and the delay magnitude are derived to guarantee asymptotic convergence to the unique NE. The effectiveness of the proposed framework is illustrated through simulations involving a network of nonholonomic mobile robots.
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 835-840
Distributed Adaptive Control for Constrained Nash Equilibrium Seeking With Delays
This letter addresses distributed Nash equilibrium (NE) seeking for a class of nonlinear Euler–Lagrange multi-agent systems subject to separable coupling constraints and constant communication delays. Each agent aims to regulate its output to the NE of a virtual static game while exchanging delayed information and operating under unknown dynamics and bounded disturbances. To this end, we introduce a set of delay-aware error variables embedding the gradients of the local cost and constraint functions. A distributed adaptive control law, combined with primal–dual projected dynamics, is designed to drive these errors to zero despite communication delays. Sufficient conditions on the controller gains and the delay magnitude are derived to guarantee asymptotic convergence to the unique NE. The effectiveness of the proposed framework is illustrated through simulations involving a network of nonholonomic mobile robots.
- 18 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 97-102
Prescribed Performance Control of Uncertain MIMO Nonlinear Systems With Coupled and Constrained Inputs
This letter addresses prescribed performance control (PPC) for uncertain multi-input multi-output (MIMO) nonlinear systems subject to saturated and coupled inputs. The proposed controller requires no model parameter knowledge and is of low implementation complexity, i.e., no regressors, observers, or approximation structures are utilized. We derive explicit feasibility conditions linking saturation levels to performance envelopes, system parameters, gains as well as disturbances, and effectively extend the low-complexity results on prescribed performance control with input saturation to the case of input coupling. Boundedness of all closed-loop signals and prescribed-performance tracking are established. A planar two-link manipulator simulation validates the approach.
- 18 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 97-102
Prescribed Performance Control of Uncertain MIMO Nonlinear Systems With Coupled and Constrained Inputs
This letter addresses prescribed performance control (PPC) for uncertain multi-input multi-output (MIMO) nonlinear systems subject to saturated and coupled inputs. The proposed controller requires no model parameter knowledge and is of low implementation complexity, i.e., no regressors, observers, or approximation structures are utilized. We derive explicit feasibility conditions linking saturation levels to performance envelopes, system parameters, gains as well as disturbances, and effectively extend the low-complexity results on prescribed performance control with input saturation to the case of input coupling. Boundedness of all closed-loop signals and prescribed-performance tracking are established. A planar two-link manipulator simulation validates the approach.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 567-579
Resilient Consensus of State-Delayed Uncertain Lagrangian Agents Using Sampled and Delayed Neighbor Information
In this paper, we develop a robust methodology for resilient consensus in complex nonlinear multi-agent systems (MASs). While substantial work has been done on resilient consensus using the mean-subsequent reduced (MSR) algorithm, challenges remain, particularly when considering communication time-delays and bounded disturbances in linear and nonlinear systems. To address these issues, we introduce a novel variable transformation that reformulates the resilient output consensus problem with delayed and sampled output data, into a continuous-time regulation problem. This transformation enables the extension of the weighted-MSR (W-MSR) algorithm to settings with bounded disturbances and variable time-delays. A key innovation is the incorporation of a drift term in the W-MSR update ensuring bounded system evolution under persistent disturbances. Using this transformation, a distributed controller is then proposed for agents in Euler-Lagrange form with unknown nonlinearities, disturbances and state delays that achieves consensus under adversarial attacks, utilizing only delayed and sampled measurements of neighbor outputs. We demonstrate the effectiveness of the proposed methodology through simulations of a group of underactuated robotic vehicles.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 567-579
Resilient Consensus of State-Delayed Uncertain Lagrangian Agents Using Sampled and Delayed Neighbor Information
In this paper, we develop a robust methodology for resilient consensus in complex nonlinear multi-agent systems (MASs). While substantial work has been done on resilient consensus using the mean-subsequent reduced (MSR) algorithm, challenges remain, particularly when considering communication time-delays and bounded disturbances in linear and nonlinear systems. To address these issues, we introduce a novel variable transformation that reformulates the resilient output consensus problem with delayed and sampled output data, into a continuous-time regulation problem. This transformation enables the extension of the weighted-MSR (W-MSR) algorithm to settings with bounded disturbances and variable time-delays. A key innovation is the incorporation of a drift term in the W-MSR update ensuring bounded system evolution under persistent disturbances. Using this transformation, a distributed controller is then proposed for agents in Euler-Lagrange form with unknown nonlinearities, disturbances and state delays that achieves consensus under adversarial attacks, utilizing only delayed and sampled measurements of neighbor outputs. We demonstrate the effectiveness of the proposed methodology through simulations of a group of underactuated robotic vehicles.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 210-223
Distributed Approximate Aggregative Optimization of Unknown Pure-Feedback Systems With Sampled Neighbor Information
This article addresses the distributed aggregative optimization (DAO) problem for high-order nonlinear systems with unknown pure-feedback dynamics over directed unbalanced networks, with the key contribution being the extension of DAO methods to high-order nonlinear systems. To achieve this, we first introduce auxiliary aggregative variables that integrate agent output and sampled neighbor information, progressively updated through a smoothing function. Using these variables and drawing inspiration from the dynamic average consensus-based approach, a pivotal theorem is introduced to facilitate the transformation of the DAO problem into a regulation problem, enabling the application of classical control methods to manage complex high-order dynamics. Furthermore, we present a control law based on prescribed performance functions and aggregative variables to solve the approximate aggregative optimization problem for high-order nonlinear agents with bounded disturbances. Finally, numerical examples are provided to validate the effectiveness of the proposed control scheme.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 210-223
Distributed Approximate Aggregative Optimization of Unknown Pure-Feedback Systems With Sampled Neighbor Information
This article addresses the distributed aggregative optimization (DAO) problem for high-order nonlinear systems with unknown pure-feedback dynamics over directed unbalanced networks, with the key contribution being the extension of DAO methods to high-order nonlinear systems. To achieve this, we first introduce auxiliary aggregative variables that integrate agent output and sampled neighbor information, progressively updated through a smoothing function. Using these variables and drawing inspiration from the dynamic average consensus-based approach, a pivotal theorem is introduced to facilitate the transformation of the DAO problem into a regulation problem, enabling the application of classical control methods to manage complex high-order dynamics. Furthermore, we present a control law based on prescribed performance functions and aggregative variables to solve the approximate aggregative optimization problem for high-order nonlinear agents with bounded disturbances. Finally, numerical examples are provided to validate the effectiveness of the proposed control scheme.
- 18 May 2024
- Published by Elsevier in Automatica
- Vol. 166
Distributed control of a mobile robot multi-agent system for Nash equilibrium seeking with sampled neighbor information
- 18 May 2024
- Published by Elsevier in Automatica
- Vol. 166
Distributed control of a mobile robot multi-agent system for Nash equilibrium seeking with sampled neighbor information
- 16 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 31 (11) , 4064-4074
Adaptive Fuzzy Approximate Optimal Consensus of Lagrangian Agents: An EXTRA-Based Smoothing Approach
In this work, we propose a new framework for solving the optimal consensus problem of agents with continuous dynamics. Motivated by the EXTRA algorithm, we introduce novel auxiliary continuous variables that utilize only sampled measurements of the neighbor outputs. The use of suitable smoothing functions, which allow us to gradually incorporate the samples in the new variables within a sampling period, guarantees the continuity of these variables. It is shown that the regulation of these EXTRA-based Smoothed Optimal Consensus (EXTRA-SOC) variables to a neighborhood of zero ensures approximate optimal consensus of the agent outputs. Taking this property into account, adaptive fuzzy distributed controllers are then designed for fully actuated Lagrangian agents that approximate the unknown system nonlinearities and guarantee approximate optimal consensus of all agent outputs. Moreover, all closed-loop signals are proven to remain bounded. Simulations on a swarm of wheeled robots validate the effectiveness of the proposed approach.
- 16 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 31 (11) , 4064-4074
Adaptive Fuzzy Approximate Optimal Consensus of Lagrangian Agents: An EXTRA-Based Smoothing Approach
In this work, we propose a new framework for solving the optimal consensus problem of agents with continuous dynamics. Motivated by the EXTRA algorithm, we introduce novel auxiliary continuous variables that utilize only sampled measurements of the neighbor outputs. The use of suitable smoothing functions, which allow us to gradually incorporate the samples in the new variables within a sampling period, guarantees the continuity of these variables. It is shown that the regulation of these EXTRA-based Smoothed Optimal Consensus (EXTRA-SOC) variables to a neighborhood of zero ensures approximate optimal consensus of the agent outputs. Taking this property into account, adaptive fuzzy distributed controllers are then designed for fully actuated Lagrangian agents that approximate the unknown system nonlinearities and guarantee approximate optimal consensus of all agent outputs. Moreover, all closed-loop signals are proven to remain bounded. Simulations on a swarm of wheeled robots validate the effectiveness of the proposed approach.
- 7 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 70 (9) , 3509-3513
Almost-Sure Finite-Time Stochastic Min-Max Consensus
In this brief, a novel stochastic minimum-maximum finite-time consensus protocol is proposed. The stochastic consensus protocol is then applied to a system of agents with continuous high-order dynamics. Based on this protocol, new continuous auxiliary variables are defined, which use only samples of the neighbors’ outputs. If those variables are regulated to zero in finite time, it is proven that finite-time output consensus is achieved. This regulation problem is then solved using a standard finite-time control law. Simulations are provided that illustrate the efficiency of this distributed finite-time control scheme.
- 7 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 70 (9) , 3509-3513
Almost-Sure Finite-Time Stochastic Min-Max Consensus
In this brief, a novel stochastic minimum-maximum finite-time consensus protocol is proposed. The stochastic consensus protocol is then applied to a system of agents with continuous high-order dynamics. Based on this protocol, new continuous auxiliary variables are defined, which use only samples of the neighbors’ outputs. If those variables are regulated to zero in finite time, it is proven that finite-time output consensus is achieved. This regulation problem is then solved using a standard finite-time control law. Simulations are provided that illustrate the efficiency of this distributed finite-time control scheme.
- 31 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (8) , 4338-4345
Optimal Consensus via OCPI Regulation for Unknown Pure-Feedback Agents With Disturbances and State Delays
In this article, we present a novel methodology to address the optimal output consensus problem for multiagent systems. We propose a distributed variable transformation that recasts the aforementioned problem into a simpler regulation problem of the new variables. The transformation requires only relative output measurements and is independent of any underlying agent dynamics and therefore applicable to a general class of systems. Classical control techniques, which take into account the agent dynamics and only need the relative outputs to be shared between neighbors, can then be employed to regulate the new variables. We utilize the methodology to address, for the first time, the problem of optimal output consensus for unknown pure-feedback agents with disturbances and state delays. Simulation studies on a group of continuous stirred tank reactors illustrate the validity of the theoretical analysis.
- 31 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (8) , 4338-4345
Optimal Consensus via OCPI Regulation for Unknown Pure-Feedback Agents With Disturbances and State Delays
In this article, we present a novel methodology to address the optimal output consensus problem for multiagent systems. We propose a distributed variable transformation that recasts the aforementioned problem into a simpler regulation problem of the new variables. The transformation requires only relative output measurements and is independent of any underlying agent dynamics and therefore applicable to a general class of systems. Classical control techniques, which take into account the agent dynamics and only need the relative outputs to be shared between neighbors, can then be employed to regulate the new variables. We utilize the methodology to address, for the first time, the problem of optimal output consensus for unknown pure-feedback agents with disturbances and state delays. Simulation studies on a group of continuous stirred tank reactors illustrate the validity of the theoretical analysis.
- 7 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 8 (4) , 1964-1974
PdI Regulation for Consensus: Application to Unknown Pure-Feedback Agents With State and Communication Delays
A novel proportional and delayed integral (PdI) transformation is proposed that recasts the cooperative control problem with communication delay to a simpler regulation problem. The PdI transformation enables the use of classical control techniques for solving leaderless consensus problems. Following this approach, we address for the first time the problem of leaderless consensus of heterogeneous multiagent systems in unknown pure-feedback form with state and communication time-delays and unknown disturbances. A general form of state delays is studied, which includes time-varying and distributed state delays among others. Retarded functional differential equations formalism is adopted in order to allow agent dynamics with such general state delays. The proposed algorithm guarantees that all closed-loop signals remain uniformly bounded and that the multiagent system achieves approximate consensus with prescribed steady-state error. Numerical simulations on a swarm of unmanned aerial vehicles verify the validity of the theoretical analysis.
- 7 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 8 (4) , 1964-1974
PdI Regulation for Consensus: Application to Unknown Pure-Feedback Agents With State and Communication Delays
A novel proportional and delayed integral (PdI) transformation is proposed that recasts the cooperative control problem with communication delay to a simpler regulation problem. The PdI transformation enables the use of classical control techniques for solving leaderless consensus problems. Following this approach, we address for the first time the problem of leaderless consensus of heterogeneous multiagent systems in unknown pure-feedback form with state and communication time-delays and unknown disturbances. A general form of state delays is studied, which includes time-varying and distributed state delays among others. Retarded functional differential equations formalism is adopted in order to allow agent dynamics with such general state delays. The proposed algorithm guarantees that all closed-loop signals remain uniformly bounded and that the multiagent system achieves approximate consensus with prescribed steady-state error. Numerical simulations on a swarm of unmanned aerial vehicles verify the validity of the theoretical analysis.