arXiv subjects

Lanlan Su

Publications and source records attributed to Lanlan Su.

15 recordsLinked to original sources

arXiv2026

Distributed Synchronisation of Heterogeneous Dynamical Networks With Nonlinear Diffusive Couplings

This letter investigates the problem of output synchronisation in heterogeneous dynamical networks with nonlinear diffusive couplings in the presence of disturbances on the coupling links. By exploiting relative dissipativity properties between adjacent agents, distributed conditions are established to guarantee output synchronisation. Specifically, these conditions can be verified using only local information associated with neighbouring agents and coupling links. As an illustration, a heterogeneous network of Goodwin oscillators is considered, where the relative dissipativity properties between neighbouring oscillators are characterised and used to analyse synchronisation.

eess.SY↗

arXiv2026

Consensus in Plug-and-Play Heterogeneous Dynamical Networks: A Passivity Compensation Approach

This paper investigates output consensus in heterogeneous dynamical networks within a plug-and-play framework. The networks are interconnected through nonlinear diffusive couplings and operate in the presence of measurement and communication noise. Focusing on systems that are input feedforward passive (IFP), we propose a passivity-compensation approach that exploits the surplus passivity of coupling links to locally offset shortages of passivity at the nodes. This mechanism enables subnetworks to be interconnected without requiring global reanalysis, thereby preserving modularity. Specifically, we derive locally verifiable interface conditions, expressed in terms of passivity indices and coupling gains, to guarantee that consensus properties of individual subnetworks are preserved when forming larger networks.

eess.SY↗

arXiv2025

Passivity Compensation: A Distributed Approach for Consensus Analysis in Heterogeneous Networks

This paper investigates a passivity-based approach to output consensus analysis in heterogeneous networks composed of non-identical agents coupled via nonlinear interactions, in the presence of measurement and/or communication noise. Focusing on agents that are input-feedforward passive (IFP), we first examine whether a shortage of passivity in some agents can be compensated by a passivity surplus in others, in the sense of preserving the passivity of the transformed open-loop system defined by the agent dynamics and network topology. We show that such compensation is only feasible when at most one agent lacks passivity, and we characterise how this deficit can be offset using the excess passivity within the group of agents. For general networks, we then investigate passivity compensation within the feedback interconnection by leveraging the passivity surplus in the coupling links to locally compensate for the lack of passivity in the adjacent agents. In particular, a distributed condition, expressed in terms of passivity indices and coupling gains, is derived to ensure output consensus of the interconnected network.

eess.SY↗

arXiv2025

Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy

One of the key challenges that Reinforcement Learning (RL) faces is its limited capability to adapt to a change of data distribution caused by uncertainties. This challenge arises especially in RL systems using deep neural networks as decision makers or policies, which are prone to overfitting after prolonged training on fixed environments. To address this challenge, this paper proposes Gaussian Process Diffusion Policy (GPDP), a new algorithm that integrates diffusion models and Gaussian Process Regression (GPR) to represent the policy. GPR guides diffusion models to generate actions that maximize learned Q-function, resembling the policy improvement in RL. Furthermore, the kernel-based nature of GPR enhances the policy's exploration efficiency under distribution shifts at test time, increasing the chance of discovering new behaviors and mitigating overfitting. Simulation results on the Walker2d benchmark show that our approach outperforms state-of-the-art algorithms under distribution shift condition by achieving around 67.74% to 123.18% improvement in the RL's objective function while maintaining comparable performance under normal conditions.

cs.LG↗

arXiv2024

On output consensus of heterogeneous dynamical networks

This work is concerned with interconnected networks with non-identical subsystems. We investigate the output consensus of the network where the dynamics are subject to external disturbance and/or reference input. For a network of output-feedback passive subsystems, we first introduce an index that characterises the gap between a pair of adjacent subsystems by the difference of their input-output trajectories. The set of these indices quantifies the level of heterogeneity of the networks. We then provide a condition in terms of the level of heterogeneity and the connectivity of the networks for ensuring the output consensus of the interconnected network.

eess.SY↗

arXiv2023

Steady-state analysis of networked epidemic models

Compartmental epidemic models with dynamics that evolve over a graph network have gained considerable importance in recent years but analysis of these models is in general difficult due to their complexity. In this paper, we develop two positive feedback frameworks that are applicable to the study of steady-state values in a wide range of compartmental epidemic models, including both group and networked processes. In the case of a group (resp. networked) model, we show that the convergence limit of the susceptible proportion of the population (resp. the susceptible proportion in at least one of the subgroups) is upper bounded by the reciprocal of the basic reproduction number (BRN) of the model. The BRN, when it is greater than unity, thus demonstrates the level of penetration into a subpopulation by the disease. Both non-strict and strict bounds on the convergence limits are derived and shown to correspond to substantially distinct scenarios in the epidemic processes, one in the presence of the endemic state and another without. Formulae for calculating the limits are provided in the latter case. We apply the developed framework to examining various group and networked epidemic models commonly seen in the literature to verify the validity of our conclusions.

q-bio.PE↗

arXiv2022

On the exponential convergence of input-output signals of nonlinear feedback systems

This note studies the exponential convergence of input-output signals of discrete-time nonlinear systems composed of a feedback interconnection of a linear time-invariant system and a nonlinear uncertainty. Both the open-loop subsystems are allowed to be unbounded. Integral-quadratic-constraint-based conditions are proposed for these uncertain feedback systems, including the Lurye type, to exhibit the property that the endogenous input-output signals enjoy an exponential convergence rate for all initial conditions of the linear time-invariant subsystem. The conditions are established via a combination of tools, including integral quadratic constraints, directed gap, and exponential weightings.

eess.SY↗

arXiv2021

On the Necessity and Sufficiency of Discrete-Time O'Shea-Zames-Falb Multipliers

This paper considers the robust stability of a discrete-time Lurye system consisting of the feedback interconnection between a linear system and a bounded and monotone nonlinearity. It has been conjectured that the existence of a suitable linear time-invariant (LTI) O'Shea-Zames-Falb multiplier is not only sufficient but also necessary. Roughly speaking, a successful proof of the conjecture would require: (a) a conic parameterization of a set of multipliers that describes exactly the set of nonlinearities, (b) a lossless S-procedure to show that the non-existence of a multiplier implies that the Lurye system is not uniformly robustly stable over the set of nonlinearities, and (c) the existence of a multiplier in the set of multipliers used in (a) implies the existence of an LTI multiplier. We investigate these three steps, showing the current bottlenecks for proving this conjecture. In addition, we provide an extension of the class of multipliers which may be used to disprove the conjecture.

eess.SY↗

arXiv2021

Distributed Resource Allocation over Time-varying Balanced Digraphs with Discrete-time Communication

This work is concerned with the problem of distributed resource allocation in continuous-time setting but with discrete-time communication over infinitely jointly connected and balanced digraphs. We provide a passivity-based perspective for the continuous-time algorithm, based on which an intermittent communication scheme is developed. Particularly, a periodic communication scheme is first derived through analyzing the passivity degradation over output sampling of the distributed dynamics at each node. Then, an asynchronous distributed event-triggered scheme is further developed. The sampled-based event-triggered communication scheme is exempt from Zeno behavior as the minimum inter-event time is lower bounded by the sampling period. The parameters in the proposed algorithm rely only on local information of each individual nodes, which can be designed in a truly distributed fashion

cs.MA↗

arXiv2021

Robust Monotonic Convergent Iterative Learning Control Design: an LMI-based Method

This work investigates robust monotonic convergent iterative learning control (ILC) for uncertain linear systems in both time and frequency domains, and the ILC algorithm optimizing the convergence speed in terms of $l_{2}$ norm of error signals is derived. Firstly, it is shown that the robust monotonic convergence of the ILC system can be established equivalently by the positive definiteness of a matrix polynomial over some set. Then, a necessary and sufficient condition in the form of sum of squares (SOS) for the positive definiteness is proposed, which is amendable to the feasibility of linear matrix inequalities (LMIs). Based on such a condition, the optimal ILC algorithm that maximizes the convergence speed is obtained by solving a set of convex optimization problems. Moreover, the order of the learning function can be chosen arbitrarily so that the designers have the flexibility to decide the complexity of the learning algorithm.

eess.SY↗

arXiv2020

On the Necessity and Sufficiency of the Zames-Falb Multipliers for Bounded Operators

This paper analyzes the robust feedback stability of a single-input-single-output stable linear time-invariant (LTI) system against four different classes of nonlinear systems using the Zames-Falb multipliers. The contribution is fourfold. Firstly, we present a generalised S-procedure lossless theorem that involves a countably infinite number of quadratic forms. Secondly, we identify a class of uncertain systems over which the robust feedback stability implies the existence of an appropriate Zames-Falb multiplier based on the generalised S-procedure lossless theorem. Meanwhile, we show that the existence of such a Zames-Falb multiplier is sufficient for the robust feedback stability over a smaller class of uncertain systems. Thirdly, when restricted to be static (a.k.a. memoryless), the second class of systems coincides with the class of sloped-restricted monotone nonlinearities, and the classical result of using the Zames-Falb multipliers to ensure feedback stability is recovered. Lastly, when restricted to be LTI, the second class is demonstrated to be a subset of the third, and the existence of a Zames-Falb multiplier is shown to be sufficient but not necessary for the robust feedback stability.

eess.SY↗

arXiv2020

Distributed Optimization With Event-triggered Communication via Input Feedforward Passivity

In this work, we address the distributed optimization problem with event-triggered communication by the notion of input feedforward passivity (IFP). First, we analyze the distributed continuous-time algorithm over uniformly jointly strongly connected balanced digraphs in an IFP-based framework. Then, we propose a distributed event-triggered communication mechanism for this algorithm. Next, we discretize the continuous-time algorithm by the forward Euler method with a constant stepsize irrelevant to network size, and show that the discretization can be seen as a stepsize-dependent passivity degradation of the input feedforward passivity. Thus, the discretized system preserves the IFP property and enables the same event-triggered communication mechanism but without Zeno behavior due to the discrete-time nature. Finally, a numerical example is presented to illustrate our results.

math.OC↗

arXiv2019

Analysis of Two-Dimensional Feedback Systems over Networks Using Dissipativity

This paper investigates the closed-loop $\mathcal{L}_2$ stability of two-dimensional (2-D) feedback systems across a digital communication network by introducing the tool of dissipativity. First, sampling of a continuous 2-D system is considered and an analytical characterization of the $QSR$-dissipativity of the sampled system is presented. Next, the input-feedforward output-feedback passivity (IF-OFP), a simplified form of $QSR$-dissipativity, is utilized to study the framework of feedback interconnection of two 2-D systems over networks. Then, the effects of signal quantization in communication links on dissipativity degradation of the 2-D feedback quantized system is analyzed. Additionally, an event-triggered mechanism is developed for 2-D networked control systems while maintaining $\mathcal{L}_2$ stability of the closed-loop system. In the end, an illustrative example is provided.

eess.SY↗

arXiv2019

Stabilization of Linear Systems Across a Time-Varying AWGN Fading Channel

This technical note investigates the minimum average transmit power required for mean-square stabilization of a discrete-time linear process across a time-varying additive white Gaussian noise (AWGN) fading channel that is presented between the sensor and the controller. We assume channel state information at both the transmitter and the receiver, and allow the transmit power to vary with the channel state to obtain the minimum required average transmit power via optimal power adaptation. We consider both the case of independent and identically distributed fading and fading subject to a Markov chain. Based on the proposed necessary and sufficient conditions for mean-square stabilization, we show that the minimum average transmit power to ensure stabilizability can be obtained by solving a geometric program.

eess.SY↗

arXiv2019

Feedback Passivation of Linear Systems with Fixed-Structured Controllers

This paper addresses the problem of designing an optimal output feedback controller with a specified controller structure for linear time-invariant (LTI) systems to maximize the passivity level for the closed-loop system, in both continuous-time (CT) and discrete-time (DT). Specifically, the set of controllers under consideration is linearly parameterized with constrained parameters. Both input feedforward passivity (IFP) and output feedback passivity (OFP) indices are used to capture the level of passivity. Given a set of stabilizing controllers, a necessary and sufficient condition is proposed for the existence of such fixed-structured output feedback controllers that can passivate the closed-loop system. Moreover, it is shown that the condition can be used to obtain the controller that maximizes the IFP or the OFP index by solving a convex optimization problem.

eess.SY↗