Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective fun...Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective functions of all clusters.A novel piecewise power-law control protocol with cooperative-competition relations is proposed.Furthermore,a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT.展开更多
Dear Editor,An adaptive consensus control algorithm for uncertain multi-agent systems(MAS),capable of guaranteeing unified prescribed performance,is presented in this letter.Unlike many existing prescribed performance...Dear Editor,An adaptive consensus control algorithm for uncertain multi-agent systems(MAS),capable of guaranteeing unified prescribed performance,is presented in this letter.Unlike many existing prescribed performance related works,the developed control exhibits some features.Firstly,a distributed prescribed time observer is introduced so that not only each follower is able to estimate the leader’s signal within a predetermined time,but also the control design for each agent is independent with its neighbors.展开更多
Dear Editor,The optimal formation control design problem is studied for a class of second-order multi-agent systems(MASs) with obstacle avoidance.Based on the actor-critic framework, an optimized formation controller ...Dear Editor,The optimal formation control design problem is studied for a class of second-order multi-agent systems(MASs) with obstacle avoidance.Based on the actor-critic framework, an optimized formation controller is proposed by constructing a novel performance index function. Furthermore, the stability of MAS is proved by constructing the Lyapunov function. The simulation results are provided to depict the effectiveness of the proposed strategies.展开更多
Dear Editor,This letter investigates the target enclosing control problem of multi-agent systems.A signed graph-based control strategy is presented,where the agents are steered to enclose the dynamic target from both ...Dear Editor,This letter investigates the target enclosing control problem of multi-agent systems.A signed graph-based control strategy is presented,where the agents are steered to enclose the dynamic target from both sides as they move.This is inspired by the phenomenon that signed networks exhibit bipartite clustering if the underlying graph is structurally balanced,so that the agents may naturally enclose the zero point from opposite sides(+and.)if proper controllers are applied.By adopting a distributed observer to estimate the information of dynamic target。展开更多
In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control sc...In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control scheme is constructed recursively by the backstepping method, graph theory,neural networks(NNs) and the dynamic surface control(DSC)approach. The key advantage of the proposed control strategy is that, by the DSC technique, it avoids "explosion of complexity"problem along with the increase of the degree of individual agents and thus the computational burden of the scheme can be drastically reduced. Moreover, there is no requirement for prior knowledge about system parameters of individual agents and uncertain dynamics by employing NNs approximation technology.We then further show that, in theory, the designed control policy guarantees the consensus errors to be cooperatively semi-globally uniformly ultimately bounded(CSUUB). Finally, two examples are presented to validate the effectiveness of the proposed control strategy.展开更多
Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus...Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus algorithm. A novel distributed control model is proposed for the multi-agent system to form the anticipated formation as well as achieve obstacle avoidance. Based on the consensus algorithm, a distributed control function consisting of three terms （formation control term, velocity matching term, and obstacle avoidance term） is presented. By establishing a novel formation control matrix, a formation control term is constructed such that the agents can converge to consensus and reach the anticipated formation. A new obstacle avoidance function is developed by using the modified potential field approach to make sure that obstacle avoidance can be achieved whether the obstacle is in a dynamic state or a stationary state. A velocity matching term is also put forward to guarantee that the velocities of all agents converge to the same value. Furthermore, stability of the control model is proven. Simulation results are provided to demonstrate the effectiveness of the proposed control.展开更多
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.展开更多
We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite siz...We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.展开更多
This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed c...This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.展开更多
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.展开更多
Leader-following stationary consensus problem is investigated for the second-order multi-agent systems with timevarying communication delay and switching topology. Based on Lyapunov-Krasovskii functional and Lyapunov-...Leader-following stationary consensus problem is investigated for the second-order multi-agent systems with timevarying communication delay and switching topology. Based on Lyapunov-Krasovskii functional and Lyapunov-Razumikhin functions respectively, consensus criterions in the form of linear matrix inequality （LMI） are obtained for the system with time-varying communication delays under static interconnection topology con- verging to the leader＇s states. Moreover, the delay-dependent consensus criterion in the form of LMI is also obtained for the system with time-invariant communication delay and switching topologies by constructing Lyapunov-Krasovskii functional. Numerical simulations present the correctness of the 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.展开更多
Finite-time consensus problem of the leader-following multi-agent system under switching network topologies is studied in this paper. Based on the graph theory, matrix theory, homogeneity with dilation, and LaSalle＇s...Finite-time consensus problem of the leader-following multi-agent system under switching network topologies is studied in this paper. Based on the graph theory, matrix theory, homogeneity with dilation, and LaSalle＇s invariance principle, the control protocol of each agent using local information is designed, and the detailed analysis of the leader- following finite-time consensus is provided. Some examples and simulation results are given to illustrate the effectiveness of the obtained theoretical results.展开更多
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.展开更多
基金supported in part by the National Natural Science Foundation of China(62373231,61973201)the Fundamental Research Program of Shanxi Province(202203021211297)Shanxi Scholarship Council of China(2023-002)。
文摘Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective functions of all clusters.A novel piecewise power-law control protocol with cooperative-competition relations is proposed.Furthermore,a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT.
基金supported in part by the National Key Research and Development Program of China(2022YFB4701400/4701401)the National Natural Science Foundation of China(61991400,61991403,62250710167,61860206008,61933012,62273064)+1 种基金the Chongqing Outstanding Young Talents Support Program(cstc2024ycjh-bgzxm0085)CAAI-Huawei MindSpore Open Fund。
文摘Dear Editor,An adaptive consensus control algorithm for uncertain multi-agent systems(MAS),capable of guaranteeing unified prescribed performance,is presented in this letter.Unlike many existing prescribed performance related works,the developed control exhibits some features.Firstly,a distributed prescribed time observer is introduced so that not only each follower is able to estimate the leader’s signal within a predetermined time,but also the control design for each agent is independent with its neighbors.
基金supported by the National Natural Science Foundation of China(61822307)。
文摘Dear Editor,The optimal formation control design problem is studied for a class of second-order multi-agent systems(MASs) with obstacle avoidance.Based on the actor-critic framework, an optimized formation controller is proposed by constructing a novel performance index function. Furthermore, the stability of MAS is proved by constructing the Lyapunov function. The simulation results are provided to depict the effectiveness of the proposed strategies.
基金supported by the Science&Technology Department of Sichuan Province(2022NSFSC0037,2022JDR0107,2020YJ0044,2021YFG0131)the Fundamental Research Funds for the Central Universities(ZYGX2020J020)the National Numerical Wind Tunnel Project,China(NNW2021ZT6-A26)。
文摘Dear Editor,This letter investigates the target enclosing control problem of multi-agent systems.A signed graph-based control strategy is presented,where the agents are steered to enclose the dynamic target from both sides as they move.This is inspired by the phenomenon that signed networks exhibit bipartite clustering if the underlying graph is structurally balanced,so that the agents may naturally enclose the zero point from opposite sides(+and.)if proper controllers are applied.By adopting a distributed observer to estimate the information of dynamic target。
基金supported in part by the National Natural Science Foundation of Chin(61503194,61533010,61374055)the Ph.D.Programs Foundation of Ministry of Education of China(20110142110036)+6 种基金the Natural Science Foundation o Jiangsu Province(BK20131381,BK20140877)China Postdoctoral Scienc Foundation(2015M571788)Jiangsu Planned Projects for Postdoctoral Re search Funds(1402066B)the Foundation of the Key Laboratory of Marin Dynamic Simulation and Control for the Ministry of Transport(DMU)(DMU MSCKLT2016005)Jiangsu Government Scholarship for Overseas Studie(2017-037)the Key University Natural Science Research Project of Jiangsu Province(17KJA120003)the Scientific Foundation of Nanjing University of Posts and Telecommunications(NUPTSF)(NY214076)
文摘In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control scheme is constructed recursively by the backstepping method, graph theory,neural networks(NNs) and the dynamic surface control(DSC)approach. The key advantage of the proposed control strategy is that, by the DSC technique, it avoids "explosion of complexity"problem along with the increase of the degree of individual agents and thus the computational burden of the scheme can be drastically reduced. Moreover, there is no requirement for prior knowledge about system parameters of individual agents and uncertain dynamics by employing NNs approximation technology.We then further show that, in theory, the designed control policy guarantees the consensus errors to be cooperatively semi-globally uniformly ultimately bounded(CSUUB). Finally, two examples are presented to validate the effectiveness of the proposed control strategy.
基金supported by the National High Technology Research and Development Program of China(Grant No.2011AA040103)the Research Foundationof Shanghai Institute of Technology,China(Grant No.B504)
文摘Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus algorithm. A novel distributed control model is proposed for the multi-agent system to form the anticipated formation as well as achieve obstacle avoidance. Based on the consensus algorithm, a distributed control function consisting of three terms （formation control term, velocity matching term, and obstacle avoidance term） is presented. By establishing a novel formation control matrix, a formation control term is constructed such that the agents can converge to consensus and reach the anticipated formation. A new obstacle avoidance function is developed by using the modified potential field approach to make sure that obstacle avoidance can be achieved whether the obstacle is in a dynamic state or a stationary state. A velocity matching term is also put forward to guarantee that the velocities of all agents converge to the same value. Furthermore, stability of the control model is proven. Simulation results are provided to demonstrate the effectiveness of the proposed control.
基金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.
基金This work was supported by the National Natural Science Foundation of China (No. 10372002,60274001) and the National Key Basic Research and Develop-ment Program (No.2002CB312200).
文摘We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.
基金supported by the National Natural Science Foundation of China(No.60674050,60736022,10972002,60774089,60704039)
文摘This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.
基金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 the Fundamental Research Funds for the Central Universities(JUSRP11020)the Specialized Research Fund for the Doctoral Program of Higher Education of China(20090093120006)
文摘Leader-following stationary consensus problem is investigated for the second-order multi-agent systems with timevarying communication delay and switching topology. Based on Lyapunov-Krasovskii functional and Lyapunov-Razumikhin functions respectively, consensus criterions in the form of linear matrix inequality （LMI） are obtained for the system with time-varying communication delays under static interconnection topology con- verging to the leader＇s states. Moreover, the delay-dependent consensus criterion in the form of LMI is also obtained for the system with time-invariant communication delay and switching topologies by constructing Lyapunov-Krasovskii functional. Numerical simulations present the correctness of the 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.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60834002,60873021,and 61004042)the Youth Science Research Project of Chongqing University of Posts and Telecommunications,China(Grant No.A2012-82)the Doctor Start-up Foundation of Chongqing University of Posts and Telecommunications,China(Grant No.A2012-23)
文摘Finite-time consensus problem of the leader-following multi-agent system under switching network topologies is studied in this paper. Based on the graph theory, matrix theory, homogeneity with dilation, and LaSalle＇s invariance principle, the control protocol of each agent using local information is designed, and the detailed analysis of the leader- following finite-time consensus is provided. Some examples and simulation results are given to illustrate the effectiveness of the obtained theoretical results.
基金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.
