Andreas Kasis
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
Andreas Kasis has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Ioannis Lestas
Department of Engineering, University of Cambridge, Cambridge, U.K.
10 shared publications - Marios M. Polycarpou
University of Cyprus
8 shared publications - Stelios Timotheou
Department of Electrical and Computer Engineering, KIOS Research and Innovation Center of Excellence, University of Cyprus, Nicosia, Cyprus
7 shared publications - Nima Monshizadeh
Engineering and Technology Institute, University of Groningen, Groningen, the Netherlands
6 shared publications - Qingkai Meng
KIOS Research and Innovation Center of Excellence, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
4 shared publications - Carolina Cortez
KIOS Research and Innovation Center of Excellence and the Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
2 shared publications
Latest Publications
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 809-822
Stability of Vehicular Admission Control Schemes in Urban Traffic Networks Under Modeling Uncertainty
Traffic congestion in urban transportation networks causes significant environmental and socioeconomic impacts. Vehicular admission control (VAC) mitigates congestion by regulating vehicle entry over space and time using information and communication technologies. Despite extensive development, the stability of VAC schemes under modeling uncertainty remains under-explored. This work investigates the stability properties of a class of decentralized VAC schemes under modelling uncertainty. We consider large-scale, heterogeneous urban traffic networks characterised by nonlinear dynamics and concave macroscopic fundamental diagrams with bounded uncertainty between flow, density, and speed. In this context, we examine a broad class of decentralized VAC dynamics, described by general nonlinear forms. Using passivity theory, we derive scalable, locally verifiable conditions on the design of VAC schemes, that enable stability guarantees in the presence of modelling uncertainty. Examples are presented to illustrate the applicability of the proposed design framework. Numerical simulations on 6 and 20-region systems validate the analytical results and confirm their practical relevance.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 809-822
Stability of Vehicular Admission Control Schemes in Urban Traffic Networks Under Modeling Uncertainty
Traffic congestion in urban transportation networks causes significant environmental and socioeconomic impacts. Vehicular admission control (VAC) mitigates congestion by regulating vehicle entry over space and time using information and communication technologies. Despite extensive development, the stability of VAC schemes under modeling uncertainty remains under-explored. This work investigates the stability properties of a class of decentralized VAC schemes under modelling uncertainty. We consider large-scale, heterogeneous urban traffic networks characterised by nonlinear dynamics and concave macroscopic fundamental diagrams with bounded uncertainty between flow, density, and speed. In this context, we examine a broad class of decentralized VAC dynamics, described by general nonlinear forms. Using passivity theory, we derive scalable, locally verifiable conditions on the design of VAC schemes, that enable stability guarantees in the presence of modelling uncertainty. Examples are presented to illustrate the applicability of the proposed design framework. Numerical simulations on 6 and 20-region systems validate the analytical results and confirm their practical relevance.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 946-961
Threat Discrimination Between Attacks and Faults for a Class of Nonlinear Systems
This article addresses the problem of detecting and discriminating threats in cyber-physical systems, where the threats may be physical faults and cyber attacks. We propose a sensor switching watermark scheme, composed of a watermark generator and a remover, both switching between a set of two larger (outer) and two smaller (inner) values. We show that threat detection and discrimination are achieved by properly setting these values and the switching times. In particular, the proposed methodology can handle a class of physical faults and a broad range of man-in-the-middle cyber attacks, such as replay attacks and integrity attacks. A key feature of our methodology is the unpredictable switching time instants that entail a combination of random elements and private time seeds. In addition, we provide suitable design requirements for the time seeds and demonstrate how these are satisfied by a chaotic Lorenz system. Finally, we illustrate the effectiveness of the proposed methodology by numerical simulations.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 946-961
Threat Discrimination Between Attacks and Faults for a Class of Nonlinear Systems
This article addresses the problem of detecting and discriminating threats in cyber-physical systems, where the threats may be physical faults and cyber attacks. We propose a sensor switching watermark scheme, composed of a watermark generator and a remover, both switching between a set of two larger (outer) and two smaller (inner) values. We show that threat detection and discrimination are achieved by properly setting these values and the switching times. In particular, the proposed methodology can handle a class of physical faults and a broad range of man-in-the-middle cyber attacks, such as replay attacks and integrity attacks. A key feature of our methodology is the unpredictable switching time instants that entail a combination of random elements and private time seeds. In addition, we provide suitable design requirements for the time seeds and demonstrate how these are satisfied by a chaotic Lorenz system. Finally, we illustrate the effectiveness of the proposed methodology by numerical simulations.
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 6021-6035
Sliding Mode Control for Robustness in Networked Switched Systems Under Denial-of-Service Attacks
Denial-of-service (DoS) attacks impose an important threat for networked switched systems, as they impede the effective transmission of the control signals and measurement data and disrupt the synchronization of the switching modes between the controllers and the plant. To address this challenge, this article proposes a sliding-mode controller design for safety against DoS attacks in networked switched systems. First, we analyze the impact of the time delays induced by signal quantization and DoS attacks on the switching signals, control laws, and measurement data. We then design an integral sliding surface associated with the switching modes such that, when system uncertainties, disturbances, and the frequency and duration of DoS attacks are suitably bounded, input-to-state practical stability is guaranteed. Moreover, a reaching law is designed such that the trajectories of the networked switched system reach the sliding surface in finite time. The practicality and applicability of the proposed approach is demonstrated with numerical simulations on a networked continuous stirred tank reactor system.
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 6021-6035
Sliding Mode Control for Robustness in Networked Switched Systems Under Denial-of-Service Attacks
Denial-of-service (DoS) attacks impose an important threat for networked switched systems, as they impede the effective transmission of the control signals and measurement data and disrupt the synchronization of the switching modes between the controllers and the plant. To address this challenge, this article proposes a sliding-mode controller design for safety against DoS attacks in networked switched systems. First, we analyze the impact of the time delays induced by signal quantization and DoS attacks on the switching signals, control laws, and measurement data. We then design an integral sliding surface associated with the switching modes such that, when system uncertainties, disturbances, and the frequency and duration of DoS attacks are suitably bounded, input-to-state practical stability is guaranteed. Moreover, a reaching law is designed such that the trajectories of the networked switched system reach the sliding surface in finite time. The practicality and applicability of the proposed approach is demonstrated with numerical simulations on a networked continuous stirred tank reactor system.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7710-7724
Integrated Attitude–Position Formation Control of Multiple Vehicles on $SE(3)$ With Individual ObjectivesThis paper explores the integrated attitude-position formation control problem of multiple vehicles, where individual entities within the formation have heterogeneous objectives. The six-degree-of-freedom multi-vehicle model is established by using the Lie group $SE(3)$, where the attitude of each vehicle is represented by the rotation matrix. Initially, leveraging left-invariant metrics on $SE(3)$, cost functions with respect to individual objectives and the group goal are established, formulating the formation control problem as a non-cooperative differential game. The existence of Nash equilibrium (NE) points is proven by using the monotonic game function analysis technique. To account for vehicle individual objectives, we apply a regularization technique for a strongly monotone operator to reformulate the game, providing conditions such that the NE points of the two games coincide. This transforms the original coordinated optimization problem into a NE-seeking problem for the augmented game. The aforementioned game control problem is solved using a Laplacian-flow-consensus-based NE-seeking algorithm, which yields a distributed geometric controller, for which we offer analytic convergence guarantees. Finally, simulation results demonstrate the practical validity of the proposed method.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7710-7724
Integrated Attitude–Position Formation Control of Multiple Vehicles on $SE(3)$ With Individual ObjectivesThis paper explores the integrated attitude-position formation control problem of multiple vehicles, where individual entities within the formation have heterogeneous objectives. The six-degree-of-freedom multi-vehicle model is established by using the Lie group $SE(3)$, where the attitude of each vehicle is represented by the rotation matrix. Initially, leveraging left-invariant metrics on $SE(3)$, cost functions with respect to individual objectives and the group goal are established, formulating the formation control problem as a non-cooperative differential game. The existence of Nash equilibrium (NE) points is proven by using the monotonic game function analysis technique. To account for vehicle individual objectives, we apply a regularization technique for a strongly monotone operator to reformulate the game, providing conditions such that the NE points of the two games coincide. This transforms the original coordinated optimization problem into a NE-seeking problem for the augmented game. The aforementioned game control problem is solved using a Laplacian-flow-consensus-based NE-seeking algorithm, which yields a distributed geometric controller, for which we offer analytic convergence guarantees. Finally, simulation results demonstrate the practical validity of the proposed method.
- 19 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Stability of regional traffic networks employing maximum throughput demand management
- 19 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Stability of regional traffic networks employing maximum throughput demand management
- 17 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Secure state estimation of networked switched systems under denial-of-service attacks
- 17 June 2024
- Published by Elsevier in European Journal of Control
- Vol. 80
Secure state estimation of networked switched systems under denial-of-service attacks
- Open Access
Pandemic infection forecasting through compartmental model and learning-based approaches
The emergence and spread of deadly pandemics has repeatedly occurred throughout history, causing widespread infections and loss of life. The rapid spread of pandemics have made governments across the world adopt a range of actions, including non-pharmaceutical measures to contain its impact. However, the dynamic nature of pandemics makes selecting intervention strategies challenging. Hence, the development of suitable monitoring and forecasting tools for tracking infected cases is crucial for designing and implementing effective measures. Motivated by this, we present a hybrid pandemic infection forecasting methodology that integrates compartmental model and learning-based approaches. In particular, we develop a compartmental model that includes time-varying infection rates, which are the key parameters that determine the pandemic's evolution. To identify the time-dependent infection rates, we establish a hybrid methodology that combines the developed compartmental model and tools from optimization and neural networks. Specifically, the proposed methodology estimates the infection rates by fitting the model to available data, regarding the COVID-19 pandemic in Cyprus, and then predicting their future values through either a) extrapolation, or b) feeding them to neural networks. The developed approach exhibits strong accuracy in predicting infections seven days in advance, achieving low average percentage errors both using the extrapolation (9.90%) and neural network (5.04%) approaches.
Open AccessPandemic infection forecasting through compartmental model and learning-based approaches
The emergence and spread of deadly pandemics has repeatedly occurred throughout history, causing widespread infections and loss of life. The rapid spread of pandemics have made governments across the world adopt a range of actions, including non-pharmaceutical measures to contain its impact. However, the dynamic nature of pandemics makes selecting intervention strategies challenging. Hence, the development of suitable monitoring and forecasting tools for tracking infected cases is crucial for designing and implementing effective measures. Motivated by this, we present a hybrid pandemic infection forecasting methodology that integrates compartmental model and learning-based approaches. In particular, we develop a compartmental model that includes time-varying infection rates, which are the key parameters that determine the pandemic's evolution. To identify the time-dependent infection rates, we establish a hybrid methodology that combines the developed compartmental model and tools from optimization and neural networks. Specifically, the proposed methodology estimates the infection rates by fitting the model to available data, regarding the COVID-19 pandemic in Cyprus, and then predicting their future values through either a) extrapolation, or b) feeding them to neural networks. The developed approach exhibits strong accuracy in predicting infections seven days in advance, achieving low average percentage errors both using the extrapolation (9.90%) and neural network (5.04%) approaches.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 5117-5122
Attitude Consensus Control with Disturbance Rejection for Incompletely Cooperative Multi-agent Systems on $SO(3)$The three-dimensional orthogonal matrix group $SO(3)$ offers global, unique, and nonsingular attitude representation of the rotational motion. This paper addresses the attitude consensus problem with disturbance rejection for multi-agent systems consisting of incompletely cooperative agents evolving on $SO(3)$ . Firstly, we establish an individual cost functional that evaluates the agent consensus aim using the natural Riemannian metric on $SO(3)$ , and formulate the considered consensus problem as a differential game. Secondly, a baseline consensus protocol is designed following the inverse optimal control procedure. In addition, a finite-time disturbance observer on $SO(3)$ is developed based on the non-singular terminal sliding mode technique, which is used for estimating and compensating for disturbances. The effectiveness of the proposed schemes is verified with simulations on a 4-vehicle formation setting.- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 5117-5122
Attitude Consensus Control with Disturbance Rejection for Incompletely Cooperative Multi-agent Systems on $SO(3)$The three-dimensional orthogonal matrix group $SO(3)$ offers global, unique, and nonsingular attitude representation of the rotational motion. This paper addresses the attitude consensus problem with disturbance rejection for multi-agent systems consisting of incompletely cooperative agents evolving on $SO(3)$ . Firstly, we establish an individual cost functional that evaluates the agent consensus aim using the natural Riemannian metric on $SO(3)$ , and formulate the considered consensus problem as a differential game. Secondly, a baseline consensus protocol is designed following the inverse optimal control procedure. In addition, a finite-time disturbance observer on $SO(3)$ is developed based on the non-singular terminal sliding mode technique, which is used for estimating and compensating for disturbances. The effectiveness of the proposed schemes is verified with simulations on a 4-vehicle formation setting.- Open Access
Demand Management for Peak to Average Ratio Minimization via Intraday Block Pricing
Price based demand response schemes may significantly improve power system efficiency. Additionally, it is desired that such schemes yield improved power operation, by reducing the peak consumption. This paper proposes the Intraday Block Pricing (IBP) scheme, aiming to promote effective demand response among consumers by charging their electricity usage based on intraday time-slots. To design the prices associated with the proposed scheme, we formulate a bilevel optimization problem that aims to minimize the Peak-to-Average Ratio (PAR) and simultaneously benefit the consumers and the utility company. The bilevel problem is converted into a single-level Mathematical Program with Equilibrium Constraints (MPEC). The resulting MPEC is non-convex and includes nonlinear constraints. Hence, to obtain a solution, it is relaxed into a Mixed Integer Linear Program by dealing with all nonlinearities. To evaluate the conservativeness of the proposed approach, a lower bound to the cost of the original bilevel problem is obtained. The applicability of the proposed scheme is demonstrated with simulations on various case studies, which exhibit a significant reduction in PAR and economic gains for the utility company and consumers. Moreover, simulation results show that the solutions of the original and relaxed problems are equivalent, demonstrating the effectiveness of the proposed solution approach. Further simulation results demonstrate significant advantages in the performance of the IBP scheme when compared to existing schemes in the literature.
Open AccessDemand Management for Peak to Average Ratio Minimization via Intraday Block Pricing
Price based demand response schemes may significantly improve power system efficiency. Additionally, it is desired that such schemes yield improved power operation, by reducing the peak consumption. This paper proposes the Intraday Block Pricing (IBP) scheme, aiming to promote effective demand response among consumers by charging their electricity usage based on intraday time-slots. To design the prices associated with the proposed scheme, we formulate a bilevel optimization problem that aims to minimize the Peak-to-Average Ratio (PAR) and simultaneously benefit the consumers and the utility company. The bilevel problem is converted into a single-level Mathematical Program with Equilibrium Constraints (MPEC). The resulting MPEC is non-convex and includes nonlinear constraints. Hence, to obtain a solution, it is relaxed into a Mixed Integer Linear Program by dealing with all nonlinearities. To evaluate the conservativeness of the proposed approach, a lower bound to the cost of the original bilevel problem is obtained. The applicability of the proposed scheme is demonstrated with simulations on various case studies, which exhibit a significant reduction in PAR and economic gains for the utility company and consumers. Moreover, simulation results show that the solutions of the original and relaxed problems are equivalent, demonstrating the effectiveness of the proposed solution approach. Further simulation results demonstrate significant advantages in the performance of the IBP scheme when compared to existing schemes in the literature.
- Open Access
Privacy of distributed optimality schemes in power networks
The increasing participation of local generation and controllable demand units within the power network motivates the use of distributed schemes for their control. Simultaneously, it raises two issues; achieving an optimal power allocation among these units, and securing the privacy of the generation/demand profiles. This study considers the problem of designing distributed optimality schemes that preserve the privacy of the generation and controllable demand units within the secondary frequency control timeframe. We propose a consensus scheme that includes the generation/demand profiles within its dynamics, keeping this information private when knowledge of its internal dynamics is not available. However, the prosumption profiles may be inferred using knowledge of its internal model. We resolve this by proposing a privacy-preserving scheme which ensures that the generation/demand cannot be inferred from the communicated signals. For both proposed schemes, we provide analytic stability, optimality and privacy guarantees and show that the secondary frequency control objectives are satisfied. The presented schemes are distributed, locally verifiable and applicable to arbitrary network topologies. Our analytic results are verified with simulations on a 140-bus system, where we demonstrate that the proposed schemes offer enhanced privacy properties, enable an optimal power allocation and preserve the stability of the power network.
Open AccessPrivacy of distributed optimality schemes in power networks
The increasing participation of local generation and controllable demand units within the power network motivates the use of distributed schemes for their control. Simultaneously, it raises two issues; achieving an optimal power allocation among these units, and securing the privacy of the generation/demand profiles. This study considers the problem of designing distributed optimality schemes that preserve the privacy of the generation and controllable demand units within the secondary frequency control timeframe. We propose a consensus scheme that includes the generation/demand profiles within its dynamics, keeping this information private when knowledge of its internal dynamics is not available. However, the prosumption profiles may be inferred using knowledge of its internal model. We resolve this by proposing a privacy-preserving scheme which ensures that the generation/demand cannot be inferred from the communicated signals. For both proposed schemes, we provide analytic stability, optimality and privacy guarantees and show that the secondary frequency control objectives are satisfied. The presented schemes are distributed, locally verifiable and applicable to arbitrary network topologies. Our analytic results are verified with simulations on a 140-bus system, where we demonstrate that the proposed schemes offer enhanced privacy properties, enable an optimal power allocation and preserve the stability of the power network.