首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 46 毫秒
1.
In this paper, the finite-time group consensus for a class of heterogeneous multi-agent systems (HMASs) with bounded disturbances is studied by designing a pinning control scheme with an integral sliding mode. For an HMAS without disturbance, a continuous finite-time consensus protocol with a pinning and grouping strategy is proposed. Under the designed control protocol, the HMAS achieves consensus according to the given grouping requirement in a finite time and the final states converge to the desired consistency values. The detailed theoretical proof is given on the strength of Lyapunov theory, LaSalle’s invariance principle and homogeneity with dilation principle. On this basis, this paper further introduces an integral sliding mode into finite-time group consensus protocol designed above such that the HMAS with one or more pinning agents can achieve accurate finite-time group consensus even if there exist uncertain bounded disturbances. It is noted that the control input is chattering-free. Two simulation examples are presented to illustrate the effectiveness of the proposed control schemes.  相似文献   

2.
This paper investigates the consensus of fractional-order multiagent systems via sampled-data event-triggered control. Firstly, an event-triggered algorithm is defined using sampled states. Thus, Zeno behaviors can be naturally avoided. Then, a distributed control protocol is proposed to ensure the consensus of fractional-order multiagent systems, where each agent updates its current state based on its neighbors’ states at event-triggered instants. Furthermore, the pinning control technology is taken into account to ensure all agents in multiagent systems reach the specified reference state. With the aid of linear matrix inequalities (LMI), some sufficient conditions are obtained to guarantee the consensus of fractional-order multiagent system. Finally, numerical simulations are presented to demonstrate the theoretical analysis.  相似文献   

3.
In this paper, the distributed optimal consensus control of a group of Euler-Lagrange systems under input saturation is considered. The objective function is only known by each agent itself. Meanwhile it is assumed that the velocities of the systems are unknown. To solve this problem, the filters and observers are designed for each agent. The magnitudes of the control input could be guaranteed within the bounds which are given in advance. It is shown that global optimal consensus control could be achieved under the proposed bounded controllers. The states of all agents will reach a consensus which minimizes the sum of the objective functions of all agents. Simulation results illustrate the effectiveness of the control schemes.  相似文献   

4.
This paper investigates the stochastic scaled consensus problem for multi-agent systems with semi-Markov switching topologies. Sufficient conditions are established to guarantee the addressed system to realize the scaled consensus with probability one, which means that all agents’ states almost surely reach a dictated proportion. Here, the semi-Markov process concerned is much more general than those utilized in the recent literature, which can be characterized by two important factors: (1) the transition probability matrix, and (2) the polytropical distribution functions of sojourn times. In addition, pinning scaled consensus protocol is designed by employing the pinning control technique, where only the root nodes of the union set of all the topologies are chosen to be pinned, and the final desired state value of the considered system can be realized with probability one. Finally, numerical simulations are provided to illustrate validity of the obtained main results.  相似文献   

5.
《Journal of The Franklin Institute》2019,356(18):11581-11604
A solution is provided in this paper for the adaptive approximate consensus problem of nonlinear multi-agent systems with unknown and non-identical control directions assuming an underlying graph topology having a spanning tree. This is achieved with the introduction of a novel variable transformation called PI consensus error transformation. The new variables include the position error of each agent from some reference trajectory chosen by him, which represents the agent’s selection for the desired swarm trajectory, along with an integral term of the weighted total displacement of the agent’s position from all neighbor positions. It is proven that if these new variables are bounded and regulated to zero, then asymptotic approximate consensus among all agents is ensured. Using classical Nussbaum gain based techniques, distributed controllers are designed to regulate the PI consensus error variables to zero and ultimately solve the approximate agreement problem. The proposed approach also allows for a specific calculation of the final consensus trajectory based on the controller parameter selection and the associated graph topology. It is shown that all agent positions converge towards a neighborhood of the weighted average of all agents reference trajectories. Simulation results verify our theoretical derivations.  相似文献   

6.
In this paper, we consider the quantized consensus problem of multiple discrete-time integrator agents which suffer from input saturation. As agents transmit state information through communication networks with limited bandwidth, the states of agents have to be quantized into a finite number of bits before transmission. To handle this quantized consensus problem, we introduce an internal time-varying saturation function into the controllers of all agents and ensure that the range of the state of each agent can be known in advance by its neighboring agents. Based on such shared state range information, we construct a quantized consensus protocol which implements a finite-bit quantization strategy to all states of agents and can guarantee the achievement of the asymptotic consensus under any given input saturation threshold. Such desired consensus can be guaranteed at as low bit rate as 1 bit per time step for each agent. Moreover, we can place an upper bound on the convergence rate of the consensus error of agents. We further improve that quantized consensus protocol to a robust version whose parameters are determined with only an upper bound on the number of agents and does not require any more global information of the inter-agent network. Simulations are done to confirm the effectiveness of our quantized consensus protocols.  相似文献   

7.
This paper considers the problem of the leader-following consensus of generally nonlinear discrete-time multi-agent systems with limited communication channel capacity over directed fixed communication networks. The leader agent and all follower agents are with multi-dimensional nonlinear dynamics. We propose a novel kind of consensus algorithm for each follower agent based on dynamic encoding and decoding algorithms and conduct a rigorous analysis for consensus convergence. It is proved that under the consensus algorithm designed, the leader-following consensus is achievable and the quantizers equipped for the multi-agent systems can never be saturated. Furthermore, we give the explicit forms of the data transmission rate for the connected communication channel. By properly designing the system parameters according to restriction conditions, we can ensure the consensus and communication efficiency with merely one bit information exchanging between each pair of adjacent agents per step. Finally, simulation example is presented to verify the validity of results obtained.  相似文献   

8.
This paper considers the consensus disturbance rejection problem of networks of linear agents with event-triggered communications in the presence of matched disturbances. Based on the disturbance observer, distributed event-based consensus protocols are proposed and constructed for both the cases of neutrally stable and general linear agents. Under the proposed event-based consensus protocol, it is shown that the consensus errors are asymptotically stable and the Zeno behavior can be excluded. Compared to the previous related works, our main contribution is that the proposed event-based protocol can achieve consensus and meanwhile reject disturbance, without the need of continuous communications among neighboring agents. For the case of neutrally stable agents, the event-based protocol is fully distributed, using only the local information of each agent and its neighbors. Simulation results are presented to illustrate the effectiveness of the theoretical results.  相似文献   

9.
This paper proposes a privacy-preserving consensus algorithm which enables all the agents in the directed network to eventually reach the weighted average of initial states, and while preserving the privacy of the initial state of each agent. A novel privacy-preserving scheme is proposed in our consensus algorithm where initial states are hidden in random values. We also develop detailed analysis based on our algorithm, including its convergence property and the topology condition of privacy leakages for each agent. It can be observed that final consensus point is independent of their initial values that can be arbitrary random values. Besides, when an eavesdropper exists and can intercept the data transmitted on the edges, we introduce an index to measure the privacy leakage degree of agents, and then analyze the degree of privacy leakage for each agent. Similarly, the degree for network privacy leakage is derived. Subsequently, we establish an optimization problem to find the optimal attacking strategy, and present a heuristic optimization algorithm based on the Sequential Least Squares Programming (SLSQP) to solve the proposed optimization problem. Finally, numerical experiments are designed to demonstrate the effectiveness of our algorithm.  相似文献   

10.
This paper intends to investigate the consensus problem of a nonlinear multi-agent system with new nonlinear terms added to the dynamics of each agent in the leader-following framework with impulsive control. The main contribution of this paper is introducing these new terms expressing the effect of each agent on neighbor agents. The new terms called effect terms (ETs) are considered with time-varying delay. Moreover, the communication interactions among all agents are addressed by a set of consensusable and unconsensusable switching topologies. In particular, the topology-dependent average dwell time (TDADT), one of the significant practical analysis methods for switched systems, has been calculated for each topology. The globally uniformly exponentially stability (GUES) for the consensus error dynamics is analyzed by employing algebraic graph theory and a multiple discontinuous Lyapunov function approach (MDLF) regarding separate Lyapunov functions for impulse instants. Furthermore, sufficient conditions in terms of linear matrix inequalities (LMIs) are derived to ensure that consensus can be achieved. Finally, the effectiveness of the theoretical analysis is corroborated by a numerical example.  相似文献   

11.
The leaderless, prescribed performance consensus problem for groups of agents with antagonistic interactions is addressed for the first time in this paper. We consider agents modeled by pure feedback nonlinear systems with unknown dynamics and an agent communication network described by a signed digraph with a directed spanning tree. A new proportional and integral (PI) variable transformation is proposed that enables the solution of the problem of leaderless bipartite consensus with prescribed performance by recasting it into a regulation problem with prescribed performance, which in turn we solve by a low complexity distributed control law. The algorithm guarantees uniform boundedness of all closed-loop signals and prescribed performance for the bipartite consensus error. Simulations verify the validity of our theoretical analysis.  相似文献   

12.
In this paper, a distributed time-varying convex optimization problem with inequality constraints is discussed based on neurodynamic system. The goal is to minimize the sum of agents’ local time-varying objective functions subject to some time-varying inequality constraints, each of which is known only to an individual agent. Here, the optimal solution is time-varying instead of constant. Under an undirected and connected graph, a distributed continuous-time consensus algorithm is designed by using neurodynamic system, signum functions and log-barrier penalty functions. The proposed algorithm can be understood through two parts: one part is used to reach consensus and the other is used to achieve gradient descent to track the optimal solution. Theoretical studies indicate that all agents will achieve consensus and the proposed algorithm can track the optimal solution of the time-varying convex problem. Two numerical examples are provided to validate the theoretical results.  相似文献   

13.
In this paper, I discuss whether in a society where the use of artificial agents is pervasive, these agents should be recognized as having rights like those we accord to group agents. This kind of recognition I understand to be at once social and legal, and I argue that in order for an artificial agent to be so recognized, it will need to meet the same basic conditions in light of which group agents are granted such recognition. I then explore the implications of granting recognition in this manner. The thesis I will be defending is that artificial agents that do meet the conditions of agency in light of which we ascribe rights to group agents should thereby be recognized as having similar rights. The reason for bringing group agents into the picture is that, like artificial agents, they are not self-evidently agents of the sort to which we would naturally ascribe rights, or at least that is what the historical record suggests if we look, for example, at what it took for corporations to gain legal status in the law as group agents entitled to rights and, consequently, as entities subject to responsibilities. This is an example of agency ascribed to a nonhuman agent, and just as a group agent can be described as nonhuman, so can an artificial agent. Therefore, if these two kinds of nonhuman agents can be shown to be sufficiently similar in relevant ways, the agency ascribed to one can also be ascribed to the other—this despite the fact that neither is human, a major impediment when it comes to recognizing an entity as an agent proper, and hence as a bearer of rights.  相似文献   

14.
《Journal of The Franklin Institute》2022,359(18):10931-10948
This paper studies practical consensus problems for continuous-time multiagent systems with heterophilous dynamics. Agents in the network tend to cease communication when they are close enough to each other inspired by the heterophily principle in social and opinion dynamics. We propose two types of state constraints on dynamical agents, in which the hard constraint refers to exogenous restrictions that rule the entire evolution of the agent behavior and the soft constraint turns out to be endogenous and only the ultimate equilibria of the agents are restricted. Sufficient conditions have been established to achieve practical consensus for both types of constrained systems. Numerical simulations show that the practical consensus time grows logarithmically, revealing a rapid convergence with respect to disagreement of initial conditions.  相似文献   

15.
This paper deals with the privacy-preserving average consensus problem for continuous-time multi-agent network systems (MANSs) based on the event-triggered strategy. A novel event-triggered privacy-preserving consensus algorithm is designed to achieve the average consensus of MANSs while avoiding the disclosure of the agents’ initial states. Different from the approaches incorporating stochastic noises, an output mask function in the proposed algorithm is developed to make initial state of each agent indiscernible by the others. Particularly, under the output mask function, all agents can exactly tend to the average value of initial states rather than the mean square value. Under the proposed algorithm, detailed theoretical proof about average consensus and privacy of the MANSs are conducted. Moreover, the proposed algorithm is extended to nonlinear continuous-time MANSs, and the corresponding results are also derived. A numerical simulation eventually is performed to demonstrate the validity of our results.  相似文献   

16.
This paper studies the multi-target localization and circumnavigation problem for a networked multi-agent system using bearing-only measurements. A more general case that only some of the agents are responsible for measuring the bearing angles with respect to the targets is considered. First, a novel estimator is developed for the agents to locate the targets collaboratively, based on which the geometric center of multi-target is reconstructed by each agent. Then, an estimator-based distributed controller is proposed to steer the agents, such that they can enclose the targets along different circles centered at the geometric center of multi-target with any desired angular spacing. By using Lyapunov stability theory, graph theory and consensus algorithm, global exponential stability of the overall system is analyzed rigorously. Besides, it is proved that bounded angular velocity of each agent and collision avoidance between the target and agent can be guaranteed in the whole movement process. Finally, numerical simulations are given to corroborate the theoretical results.  相似文献   

17.
This paper studies the consensus problem of multiple agents with discrete-time second-order dynamics. It is assumed that the information obtained by each agent is with time-varying delays and the interaction topology is time-varying, where the associated direct graphs may not have spanning trees. Under the condition that the union graph is strongly connected and balanced, it is shown that there exist controller gains such that consensus can be reached for any bounded time-delays. Moreover, a method is provided to design controller gains. Simulations are performed to validate the theoretical results.  相似文献   

18.
This paper address the distributed bipartite consensus problem of multi-agent systems (MASs) under undirected and directed topologies with dynamic event-triggered (DET) mechanism. The relationship among agents not only collaborative interaction but also competitive interaction are taken into account. A novel DET control protocol is raised with internal dynamic variables to guarantee that each agent can reach the bipartite consensus. Compared with the existing static triggering laws, the introduced DET strategy can significantly enlarge the interval time between two triggering instants. In addition, continuous information transmission in either controller updating or between agent and its neighbors is not demanded, which implies that the communication frequency can be extremely decreased. It is also proven that Zeno behavior does not occur. Finally, two numerical examples verify the validity of the presented theoretical results.  相似文献   

19.
In this paper, we investigate the problem of leaderless consensus control for the multiagent systems whose nonlinear dynamics satisfying incremental quadratic constraints. A distributed dynamic consensus protocol, decided by communication among neighboring agents, is presented to render nonlinear agent consensus with appropriate coupling weights. Next, an observer-based distributed protocol is considered to ensure consensus of nonlinear system without knowing full state information. Further, extensions to consensus strategies with nonlinear dynamics for the leader-following fashion are also addressed. By comparison to the traditional nonlinear consensus control methodologies, the proposed approach generalizes the Lipschitz nonlinearity as well as the combined nonlinearity of one-sided Lipschitz condition and quadratic inner-boundness condition towards a more generalized type of nonlinearity, which shows us a less conservative result in the Lyapunov proof. Finally, the numerical simulations for six agents are illustrated to show the feasibility and performance of the proposed control protocol with or without the presence of the observer.  相似文献   

20.
We study scaled group consensus problems of the first/second-order multi-agent dynamics under continuous/discrete-time settings. For a directed multi-agent network with finite sub-networks, the scaled group consensus is concerned with this case that all the sub-networks reach consensus, separately, while maintain the given ratios among the multiple consensus. First/second-order distributed protocols with continuous/discrete data are designed to solve the scaled group consensus problems, and then necessary and sufficient criteria are established to guarantee the agents’ states reaching the scaled group consensus asymptotically applying both algebraic and analytical tools. Finally, the effectiveness of the theoretical results are verified by several simulation examples.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号