The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The stability of a nonlinear reaction-diffusion process and its convergence rate can be determined very simply, based on an extension of the recently developed tools of contraction theory. This paper extend our earlier results [9] to the case where the diffusion term is itself nonlinear and where a convection term is also introduced. The results have applications to observer design for distributed...
We study the linear consensus problem in weighted and directed networks under signal transmission delays. In contrast to signal processing delays, the average of the initial conditions is not an invariant of the dynamics. Consequently, the consensus value depends on the delay distribution. On the other hand, the condition for convergence to consensus does not depend on delays but requires the existence...
This study investigates the consensus control problem of linear multi-agent systems with input time delay. By exploring the certain features of Laplacian matrix, we transform the consensus problem into an asymptotic stability problem. The key element in our work is introducing the semi-discretization method to identify the optimal consensus control conditions and develops a mapping of the system response...
In this paper we provide a distributed scheme for updating the weight links in a weighted graph in order to improve the process of reaching an agreement in multi-agent systems. This concept of reaching an agreement based on local information, known as Consensus, has several quantitative aspects that can characterize the whole network behaviour. Among them, one of the pivotal features, is the consensus...
This paper deals with simple integrator consensus problems. The objective is the design of an improved consensus algorithm for continuous-time multi-agent systems using memory effects. The novel algorithm proposes to sample, in an appropriate manner, part of the multi-agent systems information such that the algorithm converges, assuming that at each instant, agent's control laws will also consider...
We consider the standard distributed average consensus algorithm under the conditions of random communication link failures, for which we analyze convergence of nodes to average consensus in the mean square sense. We first recast this problem as a discrete-time linear system with multiplicative random coefficients. We then rewrite the system equations as a nominal system in feedback with diagonally...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.