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.
In this paper, we consider the constrained consensus problem of discrete multi-agent systems subject to multiplicative noises. Each agent can only receive information corrupted by noises from its neighbors. The intensities of these noises are dependent on the distance between neighbors' states. By using such inaccurate local information, a distributed control law is proposed to drive the agents to...
In this paper, we study a simultaneous stabilization and synchronization (SSS) problem for one class of linear multi-agent systems with non-identical agent dynamics and switching information-exchange topology. We show that a single control loop can be designed for each agent to enable some internal agent states to be stabilized while some other external states to be synchronized. We design a distributed...
This paper studies the consensusability problem for general multi-agent systems over random graphs. Two types of consensusability notions, namely mean square consensusability and probabilistic consensusability, are examined. We first consider a graph model with Markovian switching topologies for continuous-time agent dynamic. For the counterpart of discrete-time case, we consider the graph model with...
This paper is concerned with the consensus convergence rate for second order multi-agent systems. First, when both position and velocity are exchanged between neighboring agents, the fastest consensus convergence rate under a given protocol is derived based on the assumption that all the eigenvalues of the Laplacian matrix are real. Next, in the case when only the position information is exchanged...
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.