Yu Kawano
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
Yu Kawano has a total of 84 co-authors. Here are the top co-authors by number of shared publications:
- Ming Cao
University of Groningen
23 shared publications - Jacquelien M. A. Scherpen
University of Groningen
21 shared publications - Toshiyuki Ohtsuka
Graduate School of Informatics, Kyoto University, Kyoto, Japan
17 shared publications - Michele Cucuzzella
University of Groningen
9 shared publications - Ülle Kotta
Department of Software Science, Tallinn University of Technology, Tallinn, Estonia
6 shared publications - Bart Besselink
Bernoulli Institute for Mathematics, Computer Science, and Artificial Intelligence, University of Groningen, Groningen, The Netherlands
5 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by Elsevier in Journal of Fluids and Structures
- Vol. 146
Fluid-structure interaction analysis with interface control principle
- 25 June 2026
- Published by Elsevier in Journal of Fluids and Structures
- Vol. 146
Open AccessFluid-structure interaction analysis with interface control principle
- Open Access
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-16
Differential Transparency and Excitability Functions for Cooperative Systems
In this paper, we introduce novel concepts of $L\_{1}$ differential transparency and $L\_\infty$ differential excitability functions and analyze their properties in cooperative nonlinear systems. Specifically, we establish connections among the positive definiteness of the $L\_{1}$ differential transparency (resp. $L\_\infty$ differential excitability) function, transparency (resp. excitability), and stability of the associated variational systems, where transparency and excitability are weaker observability and reachability concepts compared to local observability and local accessibility, respectively. These $L_{1}$ differential transparency and $L\_\infty$ differential excitability functions can be computed numerically by simulation of cooperative systems and their variational system. We also provide convex approaches to estimating their upper or lower bound. Furthermore, we define the $L_{1}$ incremental transparency and $L\_\infty$ incremental excitability functions, which are studied in terms of the differential energy functions. Finally, we apply the proposed differential energy functions to model reduction of cooperative systems by truncation and singular perturbation.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-16
Open AccessDifferential Transparency and Excitability Functions for Cooperative Systems
In this paper, we introduce novel concepts of $L\_{1}$ differential transparency and $L\_\infty$ differential excitability functions and analyze their properties in cooperative nonlinear systems. Specifically, we establish connections among the positive definiteness of the $L\_{1}$ differential transparency (resp. $L\_\infty$ differential excitability) function, transparency (resp. excitability), and stability of the associated variational systems, where transparency and excitability are weaker observability and reachability concepts compared to local observability and local accessibility, respectively. These $L_{1}$ differential transparency and $L\_\infty$ differential excitability functions can be computed numerically by simulation of cooperative systems and their variational system. We also provide convex approaches to estimating their upper or lower bound. Furthermore, we define the $L_{1}$ incremental transparency and $L\_\infty$ incremental excitability functions, which are studied in terms of the differential energy functions. Finally, we apply the proposed differential energy functions to model reduction of cooperative systems by truncation and singular perturbation.
- 7 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (2) , 789-815
Reciprocity of Linear Time-Varying Systems
In this paper, we investigate reciprocal linear time-varying (LTV) systems. Originally, reciprocity has been defined for linear time-invariant (LTI) systems, which becomes a symmetry prop...
- 7 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (2) , 789-815
Reciprocity of Linear Time-Varying Systems
In this paper, we investigate reciprocal linear time-varying (LTV) systems. Originally, reciprocity has been defined for linear time-invariant (LTI) systems, which becomes a symmetry prop...
- Open Access
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4057-4064
Virtual Contraction Approach to Decentralized Adaptive Stabilization of Nonlinear Time-Delayed Networks
In this article, we exploit a diagonally dominant structure for decentralized stabilization of unknown nonlinear time-delayed networks. To this end, we first introduce a novel generalization of virtual contraction analysis to diagonally dominant time-delayed nonlinear control systems. We then show that nonlinear time-delayed networks can be stabilized using diagonal high-gains, provided that the input matrices satisfy certain generalized (column/row) diagonally dominant conditions. To enable stabilization of unknown networks, we further propose a distributed adaptive tuning rule for each individual gain function, guaranteeing that all closed-loop trajectories converge to the origin while all decentralized adaptive gains converge to finite values. The effectiveness of the proposed decentralized adaptive control is illustrated through a case study on epidemic spreading control in susceptible-infected-susceptible networks with transmission delays.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4057-4064
Open AccessVirtual Contraction Approach to Decentralized Adaptive Stabilization of Nonlinear Time-Delayed Networks
In this article, we exploit a diagonally dominant structure for decentralized stabilization of unknown nonlinear time-delayed networks. To this end, we first introduce a novel generalization of virtual contraction analysis to diagonally dominant time-delayed nonlinear control systems. We then show that nonlinear time-delayed networks can be stabilized using diagonal high-gains, provided that the input matrices satisfy certain generalized (column/row) diagonally dominant conditions. To enable stabilization of unknown networks, we further propose a distributed adaptive tuning rule for each individual gain function, guaranteeing that all closed-loop trajectories converge to the origin while all decentralized adaptive gains converge to finite values. The effectiveness of the proposed decentralized adaptive control is illustrated through a case study on epidemic spreading control in susceptible-infected-susceptible networks with transmission delays.
- Open Access
Privacy protection under the exposure of systems' prior information
For systems whose states implicate sensitive information, their privacy is of great concern. While notions like differential privacy have been successfully introduced to dynamical systems, it is still unclear how a system's privacy can be properly protected when facing the challenging yet frequently-encountered scenario where an adversary possesses prior knowledge, e.g., the steady state, of the system. This paper presents a new systematic approach to protect the privacy of a discrete-time linear time-invariant system against adversaries knowledgeable of the system's prior information. We employ a tailored \emph{pointwise maximal leakage (PML) privacy} criterion. PML characterizes the worst-case privacy performance, which is sharply different from that of the better-known mutual-information privacy. We derive necessary and sufficient conditions for PML privacy and construct tractable design procedures. Furthermore, our analysis leads to insight into how PML privacy, differential privacy, and mutual-information privacy are related. We then revisit Kalman filters from the perspective of PML privacy and derive a lower bound on the steady-state estimation-error covariance in terms of the PML parameters. Finally, the derived results are illustrated in a case study of privacy protection for distributed sensing in smart buildings.
Open AccessPrivacy protection under the exposure of systems' prior information
For systems whose states implicate sensitive information, their privacy is of great concern. While notions like differential privacy have been successfully introduced to dynamical systems, it is still unclear how a system's privacy can be properly protected when facing the challenging yet frequently-encountered scenario where an adversary possesses prior knowledge, e.g., the steady state, of the system. This paper presents a new systematic approach to protect the privacy of a discrete-time linear time-invariant system against adversaries knowledgeable of the system's prior information. We employ a tailored \emph{pointwise maximal leakage (PML) privacy} criterion. PML characterizes the worst-case privacy performance, which is sharply different from that of the better-known mutual-information privacy. We derive necessary and sufficient conditions for PML privacy and construct tractable design procedures. Furthermore, our analysis leads to insight into how PML privacy, differential privacy, and mutual-information privacy are related. We then revisit Kalman filters from the perspective of PML privacy and derive a lower bound on the steady-state estimation-error covariance in terms of the PML parameters. Finally, the derived results are illustrated in a case study of privacy protection for distributed sensing in smart buildings.
- Open Access
Partial Eigenvalue Assignment for Nonlinear Systems
In this paper, we study control design methods for assigning a subset of nonlinear right or left eigenvalues to a specified set of scalar-valued functions via nonlinear Sylvester equations. This framework can be viewed as a generalization of partial linear eigenvalue assignment (also referred to as partial pole placement) for linear systems. First, we propose a method for partial nonlinear right eigenvalue assignment via state feedback using a nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear right eigenvalue. This method can be applied to partial stabilization of nonlinear systems. Then, as the dual problem, we present a method for partial nonlinear left eigenvalue assignment via the dual nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear left eigenvalue, which can be applied to partial observer design for nonlinear system.
Open AccessPartial Eigenvalue Assignment for Nonlinear Systems
In this paper, we study control design methods for assigning a subset of nonlinear right or left eigenvalues to a specified set of scalar-valued functions via nonlinear Sylvester equations. This framework can be viewed as a generalization of partial linear eigenvalue assignment (also referred to as partial pole placement) for linear systems. First, we propose a method for partial nonlinear right eigenvalue assignment via state feedback using a nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear right eigenvalue. This method can be applied to partial stabilization of nonlinear systems. Then, as the dual problem, we present a method for partial nonlinear left eigenvalue assignment via the dual nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear left eigenvalue, which can be applied to partial observer design for nonlinear system.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 1160-1174
Design of Stochastic Quantizers for Privacy-Preserving Control
In this article, we examine the role of stochastic quantizers for privacy preservation in control systems. We first employ a static stochastic quantizer and investigate its privacy-preserving properties regarding the system’s initial state. Specifically, we demonstrate that a sufficiently large quantization step guarantees $(0, \delta)$ differential privacy. In addition, the degradation of control performance caused by quantization is evaluated as the tracking error of output regulation. These two analyses characterize the tradeoff between privacy and control performance, determined by the quantization step. This insight enables us to use quantization intentionally as a means to achieve the seemingly conflicting two goals of maintaining control performance and preserving privacy at the same time; toward this end, we further investigate a dynamic stochastic quantizer. Under a stability assumption, the dynamic stochastic quantizer can enhance privacy, more than the static one, while achieving the same control performance. We further handle the unstable case by additionally applying input Gaussian noise.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (2) , 1160-1174
Design of Stochastic Quantizers for Privacy-Preserving Control
In this article, we examine the role of stochastic quantizers for privacy preservation in control systems. We first employ a static stochastic quantizer and investigate its privacy-preserving properties regarding the system’s initial state. Specifically, we demonstrate that a sufficiently large quantization step guarantees $(0, \delta)$ differential privacy. In addition, the degradation of control performance caused by quantization is evaluated as the tracking error of output regulation. These two analyses characterize the tradeoff between privacy and control performance, determined by the quantization step. This insight enables us to use quantization intentionally as a means to achieve the seemingly conflicting two goals of maintaining control performance and preserving privacy at the same time; toward this end, we further investigate a dynamic stochastic quantizer. Under a stability assumption, the dynamic stochastic quantizer can enhance privacy, more than the static one, while achieving the same control performance. We further handle the unstable case by additionally applying input Gaussian noise.
- Open Access
- 22 July 2025
- Published by Elsevier in European Journal of Control
- Vol. 86
On differential controllability and observability functions
- 22 July 2025
- Published by Elsevier in European Journal of Control
- Vol. 86
Open AccessOn differential controllability and observability functions
- 20 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1147-1152
Distributionally Robust Model Order Reduction for Linear Systems
In this paper, we investigate distributionally robust model order reduction for linear, discrete-time, time-invariant systems. The external input is assumed to follow an uncertain distribution within a Wasserstein ambiguity set. We begin by considering the case where the distribution is certain and formulate an optimization problem to obtain the reduced model. When the distribution is uncertain, the interaction between the reduced-order model and the distribution is modeled by a Stackelberg game. To ensure solvability, we first introduce the Gelbrich distance and demonstrate that the Stackelberg game within a Wasserstein ambiguity set is equivalent to that within a Gelbrich ambiguity set. Then, we propose a nested optimization problem to solve the Stackelberg game. Furthermore, the nested optimization problem is relaxed into a nested convex optimization problem, ensuring computational feasibility. Finally, a simulation is presented to illustrate the effectiveness of the proposed method.
- 20 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1147-1152
Distributionally Robust Model Order Reduction for Linear Systems
In this paper, we investigate distributionally robust model order reduction for linear, discrete-time, time-invariant systems. The external input is assumed to follow an uncertain distribution within a Wasserstein ambiguity set. We begin by considering the case where the distribution is certain and formulate an optimization problem to obtain the reduced model. When the distribution is uncertain, the interaction between the reduced-order model and the distribution is modeled by a Stackelberg game. To ensure solvability, we first introduce the Gelbrich distance and demonstrate that the Stackelberg game within a Wasserstein ambiguity set is equivalent to that within a Gelbrich ambiguity set. Then, we propose a nested optimization problem to solve the Stackelberg game. Furthermore, the nested optimization problem is relaxed into a nested convex optimization problem, ensuring computational feasibility. Finally, a simulation is presented to illustrate the effectiveness of the proposed method.
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1057-1062
Stability Conditions for Discrete-Time Stochastic Systems Introduced on Left-Bounded Time Interval
Stability conditions for discrete-time stochastic systems characterized by general stochastic processes have been discussed in earlier articles, under the assumption that the systems are introduced on the unbounded time interval. This paper newly develops theoretical bridges between the frameworks of those stability conditions and the stochastic systems introduced on the left-bounded time interval, and explicitly shows necessary and sufficient stability conditions on the left-bounded time interval. The results in this paper are expected to be useful for ensuring the validity of the future developments of control theory on the unbounded time interval.
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1057-1062
Stability Conditions for Discrete-Time Stochastic Systems Introduced on Left-Bounded Time Interval
Stability conditions for discrete-time stochastic systems characterized by general stochastic processes have been discussed in earlier articles, under the assumption that the systems are introduced on the unbounded time interval. This paper newly develops theoretical bridges between the frameworks of those stability conditions and the stochastic systems introduced on the left-bounded time interval, and explicitly shows necessary and sufficient stability conditions on the left-bounded time interval. The results in this paper are expected to be useful for ensuring the validity of the future developments of control theory on the unbounded time interval.