Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-ord...Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-order consensus. It is shown that all the coupling strengths and the ei- genvalues of the Laplacian matrix play important roles in reaching consensus. Specially when all non- zero eigenvalues of the Laplacian matrix are real, consensus can be achieved if and only if the cou- pling strengths are positive and the directed topology has a spanning tree for the first algorithm, and for the second one, consensus can be achieved if and only if the coupling strengths are positive. Fi- nally, simulation examples are presented to verify the theoretical analysis.展开更多
This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-ord...This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-order or second-order dynamics.To solve this problem,a distributed algorithm is proposed based on a contraction operator.By employing the properties of the stochastic matrix,it is shown that all agents’position states could converge to a common point and second-order agents’velocity states could remain in corresponding nonconvex constraint sets and converge to zero as long as the joint communication topology has one directed spanning tree.Finally,the numerical simulation results are provided to verify the effectiveness of the proposed algorithms.展开更多
This paper focuses on the problem of leaderfollowing consensus for nonlinear cascaded multi-agent systems.The control strategies for these systems are transformed into successive control problem schemes for lower-orde...This paper focuses on the problem of leaderfollowing consensus for nonlinear cascaded multi-agent systems.The control strategies for these systems are transformed into successive control problem schemes for lower-order error subsystems.A distributed consensus analysis for the corresponding error systems is conducted by employing recursive methods and virtual controllers,accompanied by a series of Lyapunov functions devised throughout the iterative process,which solves the leaderfollowing consensus problem of a class of nonlinear cascaded multi-agent systems.Specific simulation examples illustrate the effectiveness of the proposed control algorithm.展开更多
Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To de...Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To decrease the control cost,based on ISC,several LFC problems are investigated for second-order MASs without and with time delay,respectively.Firstly,an intermittent sampled controller is designed,and a sufficient and necessary condition is derived,under which state errors between the leader and all the followers approach zero asymptotically.Considering that time delay is inevitable,a new protocol is proposed to deal with the time-delay situation.The error system’s stability is analyzed using the Schur stability theorem,and sufficient and necessary conditions for LFC are obtained,which are closely associated with the coupling gain,the system parameters,and the network structure.Furthermore,for the case where the current position and velocity information are not available,a distributed protocol is designed that depends only on the sampled position information.The sufficient and necessary conditions for LFC are also given.The results show that second-order MASs can achieve the LFC if and only if the system parameters satisfy the inequalities proposed in the paper.Finally,the correctness of the obtained results is verified by numerical simulations.展开更多
Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process...Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process is developed to explain how the involved variation of network scale affects the dynamic behavior of the MASs.From a resource limited perspective,the distributed saturated impulsive control is then designed,under which some sufficient criteria are integrated into local quasi-consensus performance.We also provide a combined optimization algorithm for all agents to make the estimated domain of initial errors closer to the real one,thereby resulting in less conservativeness.Finally,a numerical example validates our results.展开更多
Aiming for the coordinated motion and cooperative control of multi-agents in a non-rectangular bounded space, a velocity consensus algorithm for the agents with double- integrator dynamics is presented. The traditiona...Aiming for the coordinated motion and cooperative control of multi-agents in a non-rectangular bounded space, a velocity consensus algorithm for the agents with double- integrator dynamics is presented. The traditional consensus algorithm for bounded space is only applicable to rectangular bouncing boundaries, not suitable for non-rectangular space. In order to extend the previous consensus algorithm to the non- rectangular space, the concept of mirrored velocity is introduced, which can convert the discontinuous real velocity to continuous mirrored velocity, and expand a bounded space into an infinite space. Using the consensus algorithm, it is found that the mirrored velocities of multi-agents asymptotically converge to the same values. Because each mirrored velocity points to a unique velocity in real space, it can be concluded that the real velocities of multi-agents also asymptotically converge. Finally, the effectiveness of the proposed consensus algorithm is examined by theoretical proof and numerical simulations. Moreover, an experiment is performed with the algorithm in a real multi-robot system successfully.展开更多
To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make th...To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.展开更多
To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated. In order to design effective consensus tracking protocols for a more general class of...Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated. In order to design effective consensus tracking protocols for a more general class of networks, which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state, new consensus tracking protocols with a constant and time-varying reference state are proposed, respectively. Particularly, by contrast with spanning tree, an improved condition of switching interaction topology is presented. And then, convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory. Moreover, consensus tracking protocol with a time-varying reference state is extended to achieve the fbrmation control. By introducing formation structure set, each agent can gain its individual desired trajectory. Finally, several simulations are worked out to illustrate the effectiveness of theoretical results. The test results show that the states of agents can converge to a desired constant or time-varying reference state. In addition, by selecting appropriate structure set, agents can maintain the expected formation under random switching interaction topologies.展开更多
We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states a...We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with real or complex coefficients. We show that by using Hurwitz polynomials with complex coefficients, a necessary and sufficient condition can be obtained for designing the consensus algorithm. Since the condition is both necessary and sufficient, we provide a kind of parametrization for all the weighting coefficients achieving consensus. Moreover, the condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively decreased computation burden. The result is also extended to the case where communication delay exists in the control input.展开更多
This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the ...This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic noise.In traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent agents.By introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local interaction.Through the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is analyzed.Two simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.展开更多
Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the proto...Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the protocol without considering the communication time-delay is presented,and by using Lyapunov stability theory,the sufficient condition of stability for this multi-agent system is presented.Further,considering the communication time-delay,the effectiveness of the protocol based on Lyapunov-Krasovskii function is demonstrated.The main contribution of the proposed protocols is that,as well as the velocity consensus is considered,the formation control is concerned for multi-agent systems described as the second-order equations.Finally,numerical examples are presented to illustrate the effectiveness of the proposed protocols.展开更多
Consensus problems of first-order multi-agent systems with multiple time delays are investigated in this paper. We discuss three cases： 1） continuous, 2） discrete, and 3） a continuous system with a proportional pl...Consensus problems of first-order multi-agent systems with multiple time delays are investigated in this paper. We discuss three cases： 1） continuous, 2） discrete, and 3） a continuous system with a proportional plus derivative controller. In each case, the system contains simultaneous communication and input time delays. Supposing a dynamic multi-agent system with directed topology that contains a globally reachable node, the sufficient convergence condition of the system is discussed with respect to each of the three cases based on the generalized Nyquist criterion and the frequency-domain analysis approach, yielding conclusions that are either less conservative than or agree with previously published results. We know that the convergence condition of the system depends mainly on each agent’s input time delay and the adjacent weights but is independent of the communication delay between agents, whether the system is continuous or discrete. Finally, simulation examples are given to verify the theoretical analysis.展开更多
This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all ag...This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.展开更多
Consensus problem is investigated for heterogeneous multi-agent systems composed of first-order agents and second-order agents in this paper. Leader-following consensus protocol is adopted to solve consensus problem o...Consensus problem is investigated for heterogeneous multi-agent systems composed of first-order agents and second-order agents in this paper. Leader-following consensus protocol is adopted to solve consensus problem of heterogeneous multi-agent systems with time-varying communication and input delays. By constructing Lyapunov-Krasovkii functional, sufficient consensus conditions in linear matrix inequality(LMI) form are obtained for the system under fixed interconnection topology. Moreover, consensus conditions are also obtained for the heterogeneous systems under switching topologies with time delays. Simulation examples are given to illustrate effectiveness of the results.展开更多
The paper develops a novel framework of consensus control with fault-estimation-in-the-loop for multi-agent systems(MASs)in the presence of faults.A dynamic event-triggered protocol(DETP)by adding an auxiliary variabl...The paper develops a novel framework of consensus control with fault-estimation-in-the-loop for multi-agent systems(MASs)in the presence of faults.A dynamic event-triggered protocol(DETP)by adding an auxiliary variable is utilized to improve the utilization of communication resources.First,a novel estimator with a noise bias is put forward to estimate the existed fault and then a consensus controller with fault compensation(FC)is adopted to realize the demand of reliability and safety of addressed MASs.Subsequently,a novel consensus control framework with fault-estimation-in-the-loop is developed to achieve the predetermined consensus performance with the l_(2)-l_(∞)constraint by employing the variance analysis and the Lyapunov stability approaches.Furthermore,the desired estimator and controller gains are obtained in light of the solution to an algebraic matrix equation and a linear matrix inequality in a recursive way,respectively.Finally,a simulation result is employed to verify the usefulness of the proposed design framework.展开更多
Consensus problems for discrete-time multi-agent systems were focused on. In order to design effective consensus protocols, which were aimed at ensuring that the concerned states of agents converged to a common value,...Consensus problems for discrete-time multi-agent systems were focused on. In order to design effective consensus protocols, which were aimed at ensuring that the concerned states of agents converged to a common value, a new consensus protocol for general discrete-time multi-agent system was proposed based on Lyapunov stability theory. For discrete-time multi-agent systems with desired trajectory, trajectory tracking and formation control problems were studied. The main idea of trajectory tracking problems was to design trajectory controller such that each agent tracked desired trajectory. For a type of formation problem with fixed formation structure, the formation structure set was introduced. According to the formation structure set, each agent can track its individual desired trajectory. Finally, simulations were provided to demonstrate the effectiveness of the theoretical results. The mlmerical results show that the states of agents converge to zero with consensus protocol, which is said to achieve a consensus asymptotically. In addition, through designing appropriate trajectory controllers, the simulation results show that agents converge to the desired trajectory asymptotically and can form different formations.展开更多
This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different ...This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.展开更多
The delayed-state-derivative feedback （DSDF） is in- troduced into the existing consensus protocol to simultaneously improve the robustness to communication delay and accele- rate the convergence speed of achieving t...The delayed-state-derivative feedback （DSDF） is in- troduced into the existing consensus protocol to simultaneously improve the robustness to communication delay and accele- rate the convergence speed of achieving the consensus. The frequency-domain analysis, together with the algebra graph the- ory, is employed to derive the sufficient and necessary condition guaranteeing the average consensus. It is shown that introduc- ing the DSDF with the proper intensity in the existing consensus protocol can improve the robustness to communication delay. By analyzing the effect of DSDF on the closed-loop poles, this pa- per proves that for a supercritical-delay multi-agent system, this strategy can also accelerate the convergence speed of achieving the consensus with provided the proper intensity of the DSDE Simulations are provided to demonstrate the effectiveness of the theoretical results.展开更多
Guaranteed cost consensus analysis and design problems for high-dimensional multi-agent systems with time varying delays are investigated. The idea of guaranteed cost con trol is introduced into consensus problems for...Guaranteed cost consensus analysis and design problems for high-dimensional multi-agent systems with time varying delays are investigated. The idea of guaranteed cost con trol is introduced into consensus problems for high-dimensiona multi-agent systems with time-varying delays, where a cos function is defined based on state errors among neighboring agents and control inputs of all the agents. By the state space decomposition approach and the linear matrix inequality(LMI)sufficient conditions for guaranteed cost consensus and consensu alization are given. Moreover, a guaranteed cost upper bound o the cost function is determined. It should be mentioned that these LMI criteria are dependent on the change rate of time delays and the maximum time delay, the guaranteed cost upper bound is only dependent on the maximum time delay but independen of the Laplacian matrix. Finally, numerical simulations are given to demonstrate theoretical results.展开更多
基金Supported by the National Natural Science Foundation of China(61074031)
文摘Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-order consensus. It is shown that all the coupling strengths and the ei- genvalues of the Laplacian matrix play important roles in reaching consensus. Specially when all non- zero eigenvalues of the Laplacian matrix are real, consensus can be achieved if and only if the cou- pling strengths are positive and the directed topology has a spanning tree for the first algorithm, and for the second one, consensus can be achieved if and only if the coupling strengths are positive. Fi- nally, simulation examples are presented to verify the theoretical analysis.
基金2024 Jiangsu Province Youth Science and Technology Talent Support Project2024 Yancheng Key Research and Development Plan(Social Development)projects,“Research and Application of Multi Agent Offline Distributed Trust Perception Virtual Wireless Sensor Network Algorithm”and“Research and Application of a New Type of Fishery Ship Safety Production Monitoring Equipment”。
文摘This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-order or second-order dynamics.To solve this problem,a distributed algorithm is proposed based on a contraction operator.By employing the properties of the stochastic matrix,it is shown that all agents’position states could converge to a common point and second-order agents’velocity states could remain in corresponding nonconvex constraint sets and converge to zero as long as the joint communication topology has one directed spanning tree.Finally,the numerical simulation results are provided to verify the effectiveness of the proposed algorithms.
基金National Natural Science Foundation of China(No.12071370)。
文摘This paper focuses on the problem of leaderfollowing consensus for nonlinear cascaded multi-agent systems.The control strategies for these systems are transformed into successive control problem schemes for lower-order error subsystems.A distributed consensus analysis for the corresponding error systems is conducted by employing recursive methods and virtual controllers,accompanied by a series of Lyapunov functions devised throughout the iterative process,which solves the leaderfollowing consensus problem of a class of nonlinear cascaded multi-agent systems.Specific simulation examples illustrate the effectiveness of the proposed control algorithm.
基金supported by the National Natural Science Foundation of China under Grants 62476138 and 42375016.
文摘Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To decrease the control cost,based on ISC,several LFC problems are investigated for second-order MASs without and with time delay,respectively.Firstly,an intermittent sampled controller is designed,and a sufficient and necessary condition is derived,under which state errors between the leader and all the followers approach zero asymptotically.Considering that time delay is inevitable,a new protocol is proposed to deal with the time-delay situation.The error system’s stability is analyzed using the Schur stability theorem,and sufficient and necessary conditions for LFC are obtained,which are closely associated with the coupling gain,the system parameters,and the network structure.Furthermore,for the case where the current position and velocity information are not available,a distributed protocol is designed that depends only on the sampled position information.The sufficient and necessary conditions for LFC are also given.The results show that second-order MASs can achieve the LFC if and only if the system parameters satisfy the inequalities proposed in the paper.Finally,the correctness of the obtained results is verified by numerical simulations.
基金supported by the Natural Science Foundation of Jiangsu Province(BK20240009)the National Natural Science Foundation of China(62373105,62373262)Jiangsu Provincial Scientific Research Center of Applied Mathematics(BK20233002).
文摘Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process is developed to explain how the involved variation of network scale affects the dynamic behavior of the MASs.From a resource limited perspective,the distributed saturated impulsive control is then designed,under which some sufficient criteria are integrated into local quasi-consensus performance.We also provide a combined optimization algorithm for all agents to make the estimated domain of initial errors closer to the real one,thereby resulting in less conservativeness.Finally,a numerical example validates our results.
基金The National Natural Science Foundation of China(No.61273110)the Specialized Fund for the Doctoral Program of Higher Education(No.20130092130002)
文摘Aiming for the coordinated motion and cooperative control of multi-agents in a non-rectangular bounded space, a velocity consensus algorithm for the agents with double- integrator dynamics is presented. The traditional consensus algorithm for bounded space is only applicable to rectangular bouncing boundaries, not suitable for non-rectangular space. In order to extend the previous consensus algorithm to the non- rectangular space, the concept of mirrored velocity is introduced, which can convert the discontinuous real velocity to continuous mirrored velocity, and expand a bounded space into an infinite space. Using the consensus algorithm, it is found that the mirrored velocities of multi-agents asymptotically converge to the same values. Because each mirrored velocity points to a unique velocity in real space, it can be concluded that the real velocities of multi-agents also asymptotically converge. Finally, the effectiveness of the proposed consensus algorithm is examined by theoretical proof and numerical simulations. Moreover, an experiment is performed with the algorithm in a real multi-robot system successfully.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61104092,61134007,and61203147the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金Projects(61075065,60774045) supported by the National Natural Science Foundation of ChinaProject supported by the Graduate Degree Thesis Innovation Foundation of Central South University,China
文摘Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated. In order to design effective consensus tracking protocols for a more general class of networks, which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state, new consensus tracking protocols with a constant and time-varying reference state are proposed, respectively. Particularly, by contrast with spanning tree, an improved condition of switching interaction topology is presented. And then, convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory. Moreover, consensus tracking protocol with a time-varying reference state is extended to achieve the fbrmation control. By introducing formation structure set, each agent can gain its individual desired trajectory. Finally, several simulations are worked out to illustrate the effectiveness of theoretical results. The test results show that the states of agents can converge to a desired constant or time-varying reference state. In addition, by selecting appropriate structure set, agents can maintain the expected formation under random switching interaction topologies.
基金supported by Japan Ministry of Education,Sciences and Culture(C21560471)the National Natural Science Foundation of China(61603268)+1 种基金the Research Project Supported by Shanxi Scholarship Council of China(2015-044)the Fundamental Research Project of Shanxi Province(2015021085)
文摘We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with real or complex coefficients. We show that by using Hurwitz polynomials with complex coefficients, a necessary and sufficient condition can be obtained for designing the consensus algorithm. Since the condition is both necessary and sufficient, we provide a kind of parametrization for all the weighting coefficients achieving consensus. Moreover, the condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively decreased computation burden. The result is also extended to the case where communication delay exists in the control input.
基金supported in part by the National Natural Science Foundation of China(61722312,61533017,62073321)the National Key Research and Development Program of China(2018YFB1702300)。
文摘This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic noise.In traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent agents.By introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local interaction.Through the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is analyzed.Two simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.
基金supported by the National Natural Science Foundation of China(6093400361074065)+1 种基金the National Basic Research Program of China(973 Program)(2010CB731800)the Key Project for Natural Science Research of Hebei Education Department(ZD200908)
文摘Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the protocol without considering the communication time-delay is presented,and by using Lyapunov stability theory,the sufficient condition of stability for this multi-agent system is presented.Further,considering the communication time-delay,the effectiveness of the protocol based on Lyapunov-Krasovskii function is demonstrated.The main contribution of the proposed protocols is that,as well as the velocity consensus is considered,the formation control is concerned for multi-agent systems described as the second-order equations.Finally,numerical examples are presented to illustrate the effectiveness of the proposed protocols.
基金Project supported in part by the National Natural Science Foundation of China (Grant Nos. 60973114 and 61170249)in part by the Natural Science Foundation of CQCSTC (Grant Nos. 2009BA2024 and cstc2011jjA1320)in part by the State Key Laboratory of Power Transmission Equipment & System Securityand New Technology, Chongqing University (Grant No. 2007DA10512711206)
文摘Consensus problems of first-order multi-agent systems with multiple time delays are investigated in this paper. We discuss three cases： 1） continuous, 2） discrete, and 3） a continuous system with a proportional plus derivative controller. In each case, the system contains simultaneous communication and input time delays. Supposing a dynamic multi-agent system with directed topology that contains a globally reachable node, the sufficient convergence condition of the system is discussed with respect to each of the three cases based on the generalized Nyquist criterion and the frequency-domain analysis approach, yielding conclusions that are either less conservative than or agree with previously published results. We know that the convergence condition of the system depends mainly on each agent’s input time delay and the adjacent weights but is independent of the communication delay between agents, whether the system is continuous or discrete. Finally, simulation examples are given to verify the theoretical analysis.
基金supported by Deanship of Scientific research(CDSR)at KFUPM(RG-1316-1)
文摘This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.
基金supported by National Natural Science Foundation of China(Nos.61104092,61134007 and 61203147)the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘Consensus problem is investigated for heterogeneous multi-agent systems composed of first-order agents and second-order agents in this paper. Leader-following consensus protocol is adopted to solve consensus problem of heterogeneous multi-agent systems with time-varying communication and input delays. By constructing Lyapunov-Krasovkii functional, sufficient consensus conditions in linear matrix inequality(LMI) form are obtained for the system under fixed interconnection topology. Moreover, consensus conditions are also obtained for the heterogeneous systems under switching topologies with time delays. Simulation examples are given to illustrate effectiveness of the results.
基金supported in part by the Australian Research Council Discovery Early Career Researcher Award(DE200101128)。
文摘The paper develops a novel framework of consensus control with fault-estimation-in-the-loop for multi-agent systems(MASs)in the presence of faults.A dynamic event-triggered protocol(DETP)by adding an auxiliary variable is utilized to improve the utilization of communication resources.First,a novel estimator with a noise bias is put forward to estimate the existed fault and then a consensus controller with fault compensation(FC)is adopted to realize the demand of reliability and safety of addressed MASs.Subsequently,a novel consensus control framework with fault-estimation-in-the-loop is developed to achieve the predetermined consensus performance with the l_(2)-l_(∞)constraint by employing the variance analysis and the Lyapunov stability approaches.Furthermore,the desired estimator and controller gains are obtained in light of the solution to an algebraic matrix equation and a linear matrix inequality in a recursive way,respectively.Finally,a simulation result is employed to verify the usefulness of the proposed design framework.
基金Projects(60474029,60774045,60604005) supported by the National Natural Science Foundation of ChinaProject supported by the Graduate Degree Thesis Innovation Foundation of Central South University,China
文摘Consensus problems for discrete-time multi-agent systems were focused on. In order to design effective consensus protocols, which were aimed at ensuring that the concerned states of agents converged to a common value, a new consensus protocol for general discrete-time multi-agent system was proposed based on Lyapunov stability theory. For discrete-time multi-agent systems with desired trajectory, trajectory tracking and formation control problems were studied. The main idea of trajectory tracking problems was to design trajectory controller such that each agent tracked desired trajectory. For a type of formation problem with fixed formation structure, the formation structure set was introduced. According to the formation structure set, each agent can track its individual desired trajectory. Finally, simulations were provided to demonstrate the effectiveness of the theoretical results. The mlmerical results show that the states of agents converge to zero with consensus protocol, which is said to achieve a consensus asymptotically. In addition, through designing appropriate trajectory controllers, the simulation results show that agents converge to the desired trajectory asymptotically and can form different formations.
基金Project supported by the National Natural Science Foundation of China (Grant No. 70571059)
文摘This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.
基金supported by the National Natural Science Foundation of China (60574088 60874053)
文摘The delayed-state-derivative feedback （DSDF） is in- troduced into the existing consensus protocol to simultaneously improve the robustness to communication delay and accele- rate the convergence speed of achieving the consensus. The frequency-domain analysis, together with the algebra graph the- ory, is employed to derive the sufficient and necessary condition guaranteeing the average consensus. It is shown that introduc- ing the DSDF with the proper intensity in the existing consensus protocol can improve the robustness to communication delay. By analyzing the effect of DSDF on the closed-loop poles, this pa- per proves that for a supercritical-delay multi-agent system, this strategy can also accelerate the convergence speed of achieving the consensus with provided the proper intensity of the DSDE Simulations are provided to demonstrate the effectiveness of the theoretical results.
基金supported by Shaanxi Province Natural Science Foundation of Research Projects(2016JM6014)the Innovation Foundation of High-Tech Institute of Xi’an(2015ZZDJJ03)the Youth Foundation of HighTech Institute of Xi’an(2016QNJJ004)
文摘Guaranteed cost consensus analysis and design problems for high-dimensional multi-agent systems with time varying delays are investigated. The idea of guaranteed cost con trol is introduced into consensus problems for high-dimensiona multi-agent systems with time-varying delays, where a cos function is defined based on state errors among neighboring agents and control inputs of all the agents. By the state space decomposition approach and the linear matrix inequality(LMI)sufficient conditions for guaranteed cost consensus and consensu alization are given. Moreover, a guaranteed cost upper bound o the cost function is determined. It should be mentioned that these LMI criteria are dependent on the change rate of time delays and the maximum time delay, the guaranteed cost upper bound is only dependent on the maximum time delay but independen of the Laplacian matrix. Finally, numerical simulations are given to demonstrate theoretical results.
