Yu Kawano

Rintaro Watanabe, Yu Kawano

In this paper, we investigate contraction analysis for nonlinear time-delay systems described by functional differential equations. We first extend the concept of Lyapunov-Krasovskii functionals within the differential framework. We then show that its existence is equivalent to that of an incremental Lyapunov-Krasovskii functional and guarantees uniform incremental exponential stability. Next, we extend the concept of Lyapunov-Razumikhin functions within the differential framework, whose existence also ensures uniform incremental exponential stability. As an application of our results, we formulate stabilizing feedback control design for nonlinear time-delay systems with single delays in terms of linear matrix inequalities.

Michele Cucuzzella, Riccardo Lazzari, Yu Kawano et al.

This work deals with the design of a robust and decentralized passivity-based control scheme for regulating the voltage of a DC microgrid through boost converters. A Krasovskii-type storage function is proposed and a (local) passivity property for DC microgrids comprising unknown 'ZIP' (constant impedance 'Z', constant current 'I' and constant power 'P') loads is established. More precisely, the input port-variable of the corresponding passive map is equal to the first-time derivative of the control input. Then, the integrated input port-variable is used to shape the closed loop storage function such that it has a minimum at the desired equilibrium point. Convergence to the desired equilibrium is theoretically analyzed and the proposed control scheme is validated through experiments on a real DC microgrid.

Yu Kawano, Jacquelien M. A. Scherpen

In this paper, we present an empirical balanced truncation method for nonlinear systems with linear time-invariant input vector field components. First, we define differential reachability and observability Gramians. They are matrix valued functions of the state trajectory (i.e. the initial state and input trajectory) of the original nonlinear system, and it is difficult to find them as functions of the initial state and input. The main result of this paper is to show that for a fixed state trajectory, it is possible to compute the values of these Gramians by using impulse and initial state responses of the variational system. Therefore, balanced truncation is doable along the fixed state trajectory without solving nonlinear partial differential equations, differently from conventional nonlinear balancing methods. We further develop an approximation method, which only requires trajectories of the original nonlinear systems. Our methods are demonstrated by an RL network along a trajectory.

Krishna Chaitanya Kosaraju, Yu Kawano, Jacquelien M. A. Scherpen

In this paper we introduce a new notion of passivity which we call Krasovskii's passivity and provide a sufficient condition for a system to be Krasovskii's passive. Based on this condition, we investigate classes of port-Hamiltonian and gradient systems which are Krasovskii's passive. Moreover, we provide a new interconnection based control technique based on Krasovskii's passivity. Our proposed control technique can be used even in the case when it is not clear how to construct the standard passivity based controller, which is demonstrated by examples of a Boost converter and a parallel RLC circuit.

Carlo Cenedese, Yu Kawano, Sergio Grammatico et al.

Distributed decision making in multi-agent networks has recently attracted significant research attention thanks to its wide applicability, e.g. in the management and optimization of computer networks, power systems, robotic teams, sensor networks and consumer markets. Distributed decision-making problems can be modeled as inter-dependent optimization problems, i.e., multi-agent game-equilibrium seeking problems, where noncooperative agents seek an equilibrium by communicating over a network. To achieve a network equilibrium, the agents may decide to update their decision variables via proximal dynamics, driven by the decision variables of the neighboring agents. In this paper, we provide an operator-theoretic characterization of convergence with a time-invariant communication network. For the time-varying case, we consider adjacency matrices that may switch subject to a dwell time. We illustrate our investigations using a distributed robotic exploration example.

Kenji Kashima, Ryota Yoshiuchi, Yu Kawano

When neural networks are used to model dynamics, properties such as stability of the dynamics are generally not guaranteed. In contrast, there is a recent method for learning the dynamics of autonomous systems that guarantees global exponential stability using neural networks. In this paper, we propose a new method for learning the dynamics of input-affine control systems. An important feature is that a stabilizing controller and control Lyapunov function of the learned model are obtained as well. Moreover, the proposed method can also be applied to solving Hamilton-Jacobi inequalities. The usefulness of the proposed method is examined through numerical examples.

Anand Gokhale, Anton V. Proskurnikov, Yu Kawano et al.

This paper investigates continuous-time and discrete-time firing-rate and Hopfield recurrent neural networks (RNNs), with applications in nonlinear control design and implicit deep learning. First, we introduce a nonlinear separation principle that guarantees global exponential stability for the interconnection of a contracting state-feedback controller and a contracting observer, alongside parametric extensions for robustness and equilibrium tracking. Second, we derive sharp linear matrix inequality (LMI) conditions that guarantee the contractivity of both firing rate and Hopfield neural network architectures. We establish structural relationships among these certificates-demonstrating that continuous-time models with monotone non-decreasing activations maximize the admissible weight space, and extend these stability guarantees to interconnected systems and Graph RNNs. Third, we combine our separation principle and LMI framework to solve the output reference tracking problem for RNN-modeled plants. We provide LMI synthesis methods for feedback controllers and observers, and rigorously design a low-gain integral controller to eliminate steady-state error. Finally, we derive an exact, unconstrained algebraic parameterization of our contraction LMIs to design highly expressive implicit neural networks, achieving competitive accuracy and parameter efficiency on standard image classification benchmarks.

Ye Tian, Angela Fontan, Yu Kawano et al.

Social power quantifies the ability of individuals to influence others and plays a central role in social influence networks. Yet, computing social power typically requires global knowledge and significant computational or storage capability, especially in large-scale networks with stubborn individuals. In this paper, we propose a distributed perception mechanism based on the Friedkin-Johnsen opinion dynamics that enables individuals to estimate their true social power through local interactions. The mechanism starts from independent initial perceptions and relies only on local information: each individual only needs to know its neighbors' stubbornness and the influence weights they accord. We provide rigorous dynamical system analysis that characterizes equilibria, invariant sets, and convergence. Conditions are established for convergence to the true social power in both the static setting with fixed influence weights and the reflected-appraisal setting where influence weights coevolve with perceptions. The proposed mechanism remains reliable under extreme initial perceptions, disconnected influence networks, reflected-appraisal coupling, and variations in timescales. Numerical examples illustrate our results.

Yu Kawano, Francesco Bullo

Many control, optimization, and learning algorithms rely on discretizations of continuous-time contracting systems, where preservation of contractivity under numerical integration is key for stability, robustness, and reliable fixed-point computation. In this paper, we establish conditions under which multi-stage Runge-Kutta methods preserve strong contractivity when discretizing infinitesimally contractive continuous-time systems. For explicit Runge-Kutta methods, preservation conditions are derived by bounding Lipschitz constants of the associated composite stage mappings, leading to coefficient-dependent criteria. For implicit methods, the algebraic structure of the stage equations enables explicit conditions on the Runge-Kutta coefficients that guarantee preservation of strong contractivity. In the implicit case, these results extend classical guarantees, typically limited to weak contractivity in the Euclidean metric, to strong contractivity with respect to the $\ell_1$-, $\ell_2$-, and $\ell_\infty$-norms. In addition, we study well-definedness of implicit methods through an auxiliary continuous-time system associated with the stage equations. We show that strong infinitesimal contractivity of this auxiliary system is sufficient to guarantee unique solvability of the stage equations. This analysis generalizes standard well-definedness conditions and provides a dynamic implementation approach that avoids direct solution of the implicit algebraic equations.

Anand Gokhale, Anton V. Proskurnikov, Yu Kawano et al.

This paper studies contractivity of firing-rate and Hopfield recurrent neural networks. We derive sharp LMI conditions on the synaptic matrices that characterize contractivity of both architectures, for activation functions that are either non-expansive or monotone non-expansive, in both continuous and discrete time. We establish structural relationships among these conditions, including connections to Schur diagonal stability and the recovery of optimal contraction rates for symmetric synaptic matrices. We demonstrate the utility of these results through two applications. First, we develop an LMI-based design procedure for low-gain integral controllers enabling reference tracking in contracting firing rate networks. Second, we provide an exact parameterization of weight matrices that guarantee contraction and use it to improve the expressivity of Implicit Neural Networks, achieving competitive performance on image classification benchmarks with fewer parameters.

Xiaodong Cheng, Yu Kawano, Jacquelien M. A. Scherpen

This paper proposes a general framework for structure-preserving model reduction of a secondorder network system based on graph clustering. In this approach, vertex dynamics are captured by the transfer functions from inputs to individual states, and the dissimilarities of vertices are quantified by the H2-norms of the transfer function discrepancies. A greedy hierarchical clustering algorithm is proposed to place those vertices with similar dynamics into same clusters. Then, the reduced-order model is generated by the Petrov-Galerkin method, where the projection is formed by the characteristic matrix of the resulting network clustering. It is shown that the simplified system preserves an interconnection structure, i.e., it can be again interpreted as a second-order system evolving over a reduced graph. Furthermore, this paper generalizes the definition of network controllability Gramian to second-order network systems. Based on it, we develop an efficient method to compute H2-norms and derive the approximation error between the full-order and reduced-order models. Finally, the approach is illustrated by the example of a small-world network.