Search

In this paper, we present an event-triggered distributed optimization approach including a distributed controller to solve a class of distributed time-varying optimization problems (DTOP). The proposed approach is developed within a distributed neurodynamic (DND) framework that not only optimizes the global objective function in real-time, but also ensures that the states of the agents converge to consensus. This work stands out from existing methods in two key aspects. First, the distributed controller enables the agents to communicate only at designed instants rather than continuously by an event-triggered scheme, which reduces the energy required for agent communication. Second, by incorporating an integral mode technique, the event-triggered distributed controller avoids computing the inverse of the Hessian of each local objective function, thereby reducing computational costs. Finally, an example of battery charging problem is provided to demonstrate the effectiveness of the proposed event-triggered distributed optimization approach.

Greenhouse production systems play a crucial role in modern agriculture, enabling year-round cultivation of crops by providing a controlled environment. However, effectively quantifying uncertainty in modeling greenhouse systems remains a challenging task. In this paper, we apply a novel approach based on sparse Bayesian deep learning for the system identification of lettuce greenhouse models. The method leverages the power of deep neural networks while incorporating Bayesian inference to quantify the uncertainty in the weights of a Neural ODE. The simulation results show that the generated model can capture the intrinsic nonlinear behavior of the greenhouse system with probabilistic estimates of environmental variables and lettuce growth within the greenhouse., Comment: CCTA2024

This paper proposes a model reduction approach for simplifying the interconnection topology of Lur'e network systems. A class of reduced-order models are generated by the projection framework based on graph clustering, which not only preserve the network structure but also ensure absolute stability. Furthermore, we provide an upper bound on the input-output approximation error between the original and reduced-order Lur'e network systems, which is expressed as a function of the characteristic matrix of graph clustering. Finally, the results are illustrated via a numerical example., Comment: to appear in 22nd European Control Conference (ECC24), Stockholm, Sweden

This paper studies a structure-preserving model reduction problem for large-scale second-order dynamical systems via the framework of time-domain moment matching. The moments of a second-order system are interpreted as the solutions of second-order Sylvester equations, which leads to families of parameterized second-order reduced models that match the moments of an original second-order system at selected interpolation points. Based on this, a two-sided moment matching problem is addressed, providing a unique second-order reduced system that match two distinct sets interpolation points. Furthermore, we also construct the reduced second-order systems that matches the moments of both zero and first order derivative of the original second-order system. Finally, the Loewner framework is extended to the second-order systems, where two parameterized families of models are presented that retain the second-order structure and interpolate sets of tangential data.

Let $H$, $T$ and $C_n$ be a graph, a tree and a cycle of order $n$, respectively. Let $H^{(i)}$ be the complete join of $H$ and an empty graph on $i$ vertices. Then the Cartesian product $H\Box T$ of $H$ and $T$ can be obtained by applying zip product on $H^{(i)}$ and the graph produced by zip product repeatedly. Let $\textrm{cr}_{\Sigma}(H)$ denote the crossing number of $H$ in an arbitrary surface $\Sigma$. If $H$ satisfies certain connectivity condition, then $\textrm{cr}_{\Sigma}(H\Box T)$ is not less than the sum of the crossing numbers of its ``subgraphs". In this paper, we introduced a new concept of generalized periodic graphs, which contains $H\Box C_n$. For a generalized periodic graph $G$ and a function $f(t)$, where $t$ is the number of subgraphs in a decomposition of $G$, we gave a necessary and sufficient condition for $\textrm{cr}_{\Sigma}(G)\geq f(t)$. As an application, we confirmed a conjecture of Lin et al. on the crossing number of the generalized Petersen graph $P(4h+2,2h)$ in the plane. Based on the condition, algorithms are constructed to compute lower bounds on the crossing number of generalized periodic graphs in $\Sigma$. In special cases, it is possible to determine lower bounds on an infinite family of generalized periodic graphs, by determining a lower bound on the crossing number of a finite generalized periodic graph., Comment: 26 pages, 20 figures

This paper presents a structure-preserving model reduction framework for linear systems, in which the $\mathcal{H}_2$ optimization is incorporated with the Petrov-Galerkin projection to preserve structural features of interest, including dissipativity, passivity, and bounded realness. The model reduction problem is formulated in a nonconvex optimization setting on a noncompact Stiefel manifold, aiming to minimize the $\mathcal{H}_2$ norm of the approximation error between the full-order and reduced-order models. The explicit expression for the gradient of the objective function is derived, and two gradient descent procedures are applied to seek for a (local) minimum, followed by a theoretical analysis on the convergence properties of the algorithms. Finally, the performance of the proposed method is demonstrated by two numerical examples which consider stability-preserving and passivity-preserving model reduction problems, respectively.

This paper addresses the aggregated monitoring problem for large-scale network systems with a few dedicated sensors. Full state estimation of such systems is often infeasible due to unobservability and/or computational infeasibility. Therefore, through clustering and aggregation, a tractable representation of a network system, called a projected network system, is obtained for designing a minimum-order average state observer. This observer estimates the average states of the clusters, which are identified with explicit consideration to the estimation error. Moreover, given the clustering, the proposed observer design algorithm exploits the structure of the estimation error dynamics to achieve computational tractability. Simulations show that the computation of the proposed algorithm is significantly faster than the usual $\mathcal{H}_2/\mathcal{H}_\infty$ observer design techniques. On the other hand, compromise on the estimation error characteristics is shown to be marginal.

This paper deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are measured and a subset of the vertices are excited, we explore conditions under which all the modules are identifiable on the basis of measurement data. Two sufficient conditions are presented in the paper, where the first condition concerns an identifiability analysis that needs to be performed for each vertex, while the second condition, based on the concept of tree/anti-tree covering, results from a graphical synthesis approach to allocate actuators and sensors in an acyclic network for achieving generic identifiability.

This paper considers dynamic networks where vertices and edges represent manifest signals and causal dependencies among the signals, respectively. We address the problem of how to determine if the dynamics of a network can be identified when only partial vertices are measured and excited. A necessary condition for network identifiability is presented, where the analysis is performed based on identifying the dependency of a set of rational functions from excited vertices to measured ones. This condition is further characterised by using an edge-removal procedure on the associated bipartite graph. Moreover, on the basis of necessity analysis, we provide a necessary and sufficient condition for identifiability in circular networks.

This paper provides an $H_2$ optimal scheme for reducing diffusively coupled second-order systems evolving over undirected networks. The aim is to find a reduced-order model that not only approximates the input-output mapping of the original system but also preserves crucial structures, such as the second-order form, asymptotically stability, and diffusive couplings. To this end, an $H_2$ optimal approach based on a convex relaxation is implemented to reduce the dimension, yielding a lower order asymptotically stable approximation of the original second-order network system. Then, a novel graph reconstruction approach is employed to convert the obtained model to a reduced system that is interpretable as an undirected diffusively coupled network. Finally, the effectiveness of the proposed method is illustrated via a large-scale networked mass-spring-damper system.

In this paper, we investigate the fixed-time behavioral control problem for a team of second-order nonlinear agents, aiming to achieve a desired formation with collision/obstacle~avoidance. In the proposed approach, the two behaviors(tasks) for each agent are prioritized and integrated via the framework of the null-space-based behavioral projection, leading to a desired merged velocity that guarantees the fixed-time convergence of task errors. To track this desired velocity, we design a fixed-time sliding mode controller for each agent with state-independent adaptive gains, which provides a fixed-time convergence of the tracking error. The control scheme is implemented in a distributed manner, where each agent only acquires information from its neighbors in the network. Moreover, we adopt an online learning algorithm to improve the robustness of the closed system with respect to uncertainties/disturbances. Finally, simulation results are provided to show the effectiveness of the proposed approach.

Large-scale network systems describe a wide class of complex dynamical systems composed of many interacting subsystems. A large number of subsystems and their high-dimensional dynamics often result in highly complex topology and dynamics, which pose challenges to network management and operation. This chapter provides an overview of reduced-order modeling techniques that are developed recently for simplifying complex dynamical networks. In the first part, clustering-based approaches are reviewed, which aim to reduce the network scale, i.e., find a simplified network with a fewer number of nodes. The second part presents structure-preserving methods based on generalized balanced truncation, which can reduce the dynamics of each subsystem., Comment: Chapter 11 in the book Model Order Reduction: Volume 3 Applications

Identifiability of a single module in a network of transfer functions is determined by whether a particular transfer function in the network can be uniquely distinguished within a network model set, on the basis of data. Whereas previous research has focused on the situations that all network signals are either excited or measured, we develop generalized analysis results for the situation of partial measurement and partial excitation. As identifiability conditions typically require a sufficient number of external excitation signals, this work introduces a novel network model structure such that excitation from unmeasured noise signals is included, which leads to less conservative identifiability conditions than relying on measured excitation signals only. More importantly, graphical conditions are developed to verify global and generic identifiability of a single module based on the topology of the dynamic network. Depending on whether the input or the output of the module can be measured, we present four identifiability conditions which cover all possible situations in single module identification. These conditions further lead to synthesis approaches for allocating excitation signals and selecting measured signals, to warrant single module identifiability. In addition, if the identifiability conditions are satisfied, indirect identification methods are developed to provide a consistent estimate of the module. All the obtained results are also extended to identifiability of multiple modules in the network.

Network systems consist of subsystems and their interconnections, and provide a powerful framework for analysis, modeling and control of complex systems. However, subsystems may have high-dimensional dynamics, and the amount and nature of interconnections may also be of high complexity. Therefore, it is relevant to study reduction methods for network systems. An overview on reduction methods for both the topological (interconnection) structure of the network and the dynamics of the nodes, while preserving structural properties of the network, and taking a control systems perspective, is provided. First topological complexity reduction methods based on graph clustering and aggregation are reviewed, producing a reduced-order network model. Second, reduction of the nodal dynamics is considered by using extensions of classical methods, while preserving the stability and synchronization properties. Finally, a structure-preserving generalized balancing method for simplifying simultaneously the topological structure and the order of the nodal dynamics is treated., Comment: To be published in Annual Review of Control, Robotics, and Autonomous Systems

This paper investigates a distributed formation control problem for networked robots, with the global objective of achieving predefined time-varying formations in an environment with obstacles. A novel fixed-time behavioral approach is proposed to tackle the problem, where a global formation task is divided into two local prioritized subtasks, and each of them leads to a desired velocity that can achieve the individual task in a fixed time. Then, two desired velocities are combined via the framework of the null-space-based behavioral projection, leading to a desired merged velocity that guarantees the fixed-time convergence of task errors. Finally, the effectiveness of the proposed control method is demonstrated by simulation results.

Identifiability conditions for single or multiple modules in a dynamic network specify under which conditions the considered modules can be uniquely recovered from the second-order statistical properties of the measured signals. Conditions for generic identifiability of multiple modules, i.e. a subnetwork, are developed for the situation that all node signals are measured and excitation of the network is provided by both measured excitation signals and unmeasured disturbance inputs. Additionally, the network model set is allowed to contain non-parametrized modules that are fixed, and e.g. reflect modules of which the dynamics are known to the user. The conditions take the form of path-based conditions on the graph of the network model set. Based on these conditions, synthesis results are formulated for allocating external excitation signals to achieve generic identifiability of particular subnetworks. If there are a sufficient number of measured external excitation signals, the formulated results give rise to a generalized indirect type of identification algorithm that requires only the measurement of a subset of the node signals in the network.

This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are parameters to be determined. The model of the reduced network is thereby obtained with parameterized system matrices, and then an edge weighting procedure is devised, aiming to select an optimal set of edge weights that minimizes the approximation error between the original and the reduced-order network models in terms of H2-norm. The effectiveness of the proposed method is illustrated by a numerical example.