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 paper considers the group consensus problem for a class of discrete-time heterogeneous multi-agent systems composed of first-order and second-order agents with directed topology. The discrete-time heterogenous multi-agent systems reaching group consensus is proved and the convergent points of such system are found. Finally, numerical examples are provided to demonstrate the effectiveness of the...
We study consensus in networks of multiagents with stochastically switching topologies, where the switching topologies are described as an adapted process, a rather general process including the independent and identically distributed (i.i.d.) process and the Markov process as special cases. First, motivated by some works done in the field of stochastic stability theory, we introduce a new concept...
In this paper, we consider the coordinated motion of multiple dynamic agents via nearest neighbor rules based on fixed and switching topologies, respectively. We design the control law which consists of two parts: a potential field force that makes the agents attract to each other and at the same time avoid collision in the group, and an alignment force that makes all dynamic agents' headings and...
This paper considers the consensus of the leader-following systems with a discrete-time model. The velocity of the active leader is unknown in real time. This paper designs the control laws and observers based on the neighbors to solve the consensus problem. The Lyapunov approach has played an important role in the leader-following systems. It is shown that all agents asymptotically move with the...
In this brief, we provide some theoretical analysis of the consensus for networks of agents via stochastically switching topologies. We consider both discrete-time case and continuous-time case. The main contribution of this brief is that the underlying graph topology is more general in both cases than those appeared in previous papers. The weight matrix of the coupling graph is not assumed to be...
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.