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.
This study studies the consensus of multi-agent systems on time-varying network topologies. It is shown that this consensus reaching is equivalent to the corresponding weak ergodicity of the Markov process. A very mild sufficient condition of the consensus reaching that allows the communication among agents to be time-dependent and directed is obtained by estimating the Dobrushin coefficient of ergodicity...
In this paper we present a result which modifies Moreau's theorem [1] on linear consensus problem over time-varying directed networks. Our result uses integral connectivity on varying-length intervals to characterize the consensus criterion and conditionally allows the Laplacian matrix to be unbounded. Some examples are given to show the details of the result.
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.