Related papers: Local Synchronization of Sampled-Data Systems on L…
In this article, we investigate exponential lag synchronization results for the Cohen-Grossberg neural networks (C-GNNs) with discrete and distributed delays on an arbitrary time domain by applying feedback control. We formulate the problem…
We introduce a distributed control architecture for a class of heterogeneous, nonlinear dynamical agents moving in the "string" formation, while guaranteeing trajectory tracking, collision avoidance and the preservation of the formation's…
This paper studies the synchronization problem of second-order nonlinear multi-agent systems with intermittent communication in the presence of irregular communication delays and possible information loss. The control objective is to steer…
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can…
Measurement data is often sampled irregularly i.e. not on equidistant time grids. This is also true for Hamiltonian systems. However, existing machine learning methods, which learn symplectic integrators, such as SympNets [20] and…
In this manuscript, we study the problem of robust synchronization in networks of diffusively time-delayed coupled nonlinear systems. In particular, we prove that, under some mild conditions on the input-output dynamics of the systems and…
We analyze nonlocally coupled networks of identical chaotic oscillators with either time-discrete or time-continuous dynamics (Henon map, Lozi map, Lorenz system). We hypothesize that chimera states, in which spatial domains of coherent…
We consider a group of computation units trying to cooperatively solve a distributed optimization problem with shared linear equality and inequality constraints. Assuming that the computation units are communicating over a network whose…
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor (communication) graph can be exponentially stabilized with any…
Synchronization in a group of linear time-invariant systems is studied where the coupling between each pair of systems is characterized by a different output matrix. Simple methods are proposed to generate a (separate) linear coupling gain…
New methods are developed for the stabilization of a linear system with general time-varying distributed delays existing at the system's states, inputs and outputs. In contrast to most existing literature where the function of time-varying…
We show the existence of a local stable manifold for a bidirectional discrete-time nondiffeomorphic nonlinear Hamiltonian dynamics. This is the case where zero is a closed loop eigenvalue and therefore the Hamiltonian matrix is not…
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to…
In this paper, we consider the output synchronization problem for a network of heterogeneous diffusively-coupled nonlinear agents. Specifically, we show how the (non-identical) agents can be controlled in such a way that their outputs…
Motivated by the recent interest in formal methods-based control of multi-agent systems, we adopt a bottom-up approach. Each agent is subject to a local signal temporal logic task that may depend on other agents behavior. These dependencies…
Adaptive synchronization protocols for heterogeneous multi-agent network are investigated. The interaction between each of the agents is carried out through a directed graph. We highlight the lack of communication between agents and the…
Zero-lag synchronization (ZLS) is achieved in a very restricted mutually coupled chaotic systems, where the delays of the self-coupling and the mutual coupling are identical or fulfil some restricted ratios. Using a set of multiple…
We consider a network of agents whose objective is for the aggregate of their states to converge to a solution of a linear program in standard form. Each agent has limited information about the problem data and can communicate with other…
The behaviour of many real-world phenomena can be modelled by nonlinear dynamical systems whereby a latent system state is observed through a filter. We are interested in interacting subsystems of this form, which we model by a set of…
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…