This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employi...This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.展开更多
This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency do...This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.展开更多
This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and off...This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.展开更多
In this paper, we investigate two kinds of second-order consensus algorithms for multiple agents with coupling delay under general fixed directed information topology. Stability analysis is performed based on Lyapunov...In this paper, we investigate two kinds of second-order consensus algorithms for multiple agents with coupling delay under general fixed directed information topology. Stability analysis is performed based on Lyapunov- Krasovskii functional method. Delay-dependent asymptotical stability condition in terms of linear matrix inequalities （LMIs） is derived for the second-order consensus algorithm of delayed dynamical networks. Both delay-independent and delay-dependent asymptotical stability conditions in terms of LMIs are derived for the second-order consensus algorithm with information feedback.展开更多
This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded co...This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded control inputs.Under the condition that the initial network is connected,the network will be connected all the time and all agents and the virtual leader can attain the same position and move with the same velocity.A simulation example is proposed to illustrate the effective of the proposed 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.展开更多
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.展开更多
Kidney transplantation(KT)accounts for nearly three-fourths of organ transplants in India,with living donors contributing to 82%of cases.Induction immunosuppression is essential to optimize initial immunosuppression,r...Kidney transplantation(KT)accounts for nearly three-fourths of organ transplants in India,with living donors contributing to 82%of cases.Induction immunosuppression is essential to optimize initial immunosuppression,reduce acute rejections,and enable tailored use of maintenance agents.Rabbit anti-thymocyte globulin(rATG)and interleukin-2 receptor anatagonists(IL-2RA/IL-2RBs)are the most widely used induction therapies.However,data on induction practices across India are limited.To evaluate induction immunosuppression practices across KT centers in India and establish a consensus for different subsets of KT recipients.A nationwide online survey was conducted by the Indian Society of Organ Transplantation(ISOT)among its members(400 KT centers).Responses were analyzed to assess induction practices across diverse donor types,age groups,and immunological risk profiles.Heterogeneity in practices prompted consensus building using a modified Delphi process.Literature review and expert panel discussions(April 2024)were followed by structured voting,and 16 consensus statements were finalized.Of 400 centers approached,254 participated.rATG was the most commonly used induction therapy,followed by IL-2RBs;alemtuzumab was least used.Significant heterogeneity was observed in type,dose,and duration of induction therapy.Consensus recommendations were framed:rATG for high immunological risk recipients and deceased donor KTs;IL-2RB or low-dose rATG for low immunological risk;rituximab in ABOincompatible KTs;and tailoring based on age,diabetes,donor type,infection risk,and affordability.This first ISOT consensus provides 16 India-specific statements on induction therapy in KT.It emphasizes risk-stratified,evidenceinformed,and context-appropriate induction strategies,supporting standardization of care across the country.展开更多
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.展开更多
This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent...This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent to track the active leader and it is proved that the proposed control scheme enables the consensus to be obtained when the adjacency topology is fixed/switched. Simulation results show effectiveness of the proposed theoretical analysis.展开更多
In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a ...In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.展开更多
This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which...This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy.展开更多
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.展开更多
This paper is concerned with the consensus problems for second-order multi-agent systems with multiple input delays.Different from all standard consensus algorithms with uniform delays,the authors aim to find the larg...This paper is concerned with the consensus problems for second-order multi-agent systems with multiple input delays.Different from all standard consensus algorithms with uniform delays,the authors aim to find the largest input-delay margin which can guarantee the consensus for the case when delays are nonuniform.Based on frequency domain analysis and matrix theory,an upper bound for maximum tolerable input-delay is given in terms of the relationship with scaling strengths and largest eigenvalue of the Lapalician matrix.Simulation results are provided to illustrate the obtained results.展开更多
This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference mod...This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference model based consensus algorithm is proposed. It is proved that the consensus can be achieved if the communication graph has a spanning tree. Different from most of the consensus algorithms proposed in the literature, the parameters of the control laws are different among agents. Therefore, each agent can design its control law independently. Secondly, it gives a consensus algorithm for the case that the velocities of the agents are not available. Thirdly, the effectiveness of the input delay and the communication delay is considered. It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law. Finally, some numerical examples are given to illustrate the proposed results.展开更多
In this study, the consensus problem for a class of second-order multi-agent systems with nonuniform time delays is investigated. A linear consensus protocol is used to make all agents reach consensus and move with a ...In this study, the consensus problem for a class of second-order multi-agent systems with nonuniform time delays is investigated. A linear consensus protocol is used to make all agents reach consensus and move with a constant velocity. By a frequency-domain analysis, a simplified sufficient condition is given to guarantee the consensus stability of the dynamic system. Finally, the effectiveness of the obtained theoretical results is illustrated through numerical simulations.展开更多
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.展开更多
This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted b...This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms.展开更多
This paper investigates the consensus problem of second-order nonlinear multi-agent systems (MASs) via the sliding mode control (SMC) approach. The velocity of each agent is assumed to be unmeasurable. A second-order ...This paper investigates the consensus problem of second-order nonlinear multi-agent systems (MASs) via the sliding mode control (SMC) approach. The velocity of each agent is assumed to be unmeasurable. A second-order sliding mode observer is designed to estimate the velocity. Then a distributed discontinuous control law based on first-order SMC is presented to solve the consensus problem. Moreover, to overcome the chatting problem, two controllers based on the boundary layer method and the super-twisting algorithm respectively are presented. It is shown that the MASs will achieve consensus under some given conditions. Some examples are provided to demonstrate the effectiveness of the proposed control laws.展开更多
This paper is concerned with distributed fault detection of second-order discrete-time multi-agent systems with adversary,where the adversary is regarded as a slowly time-varying signal.Firstly,a novel intrusion detec...This paper is concerned with distributed fault detection of second-order discrete-time multi-agent systems with adversary,where the adversary is regarded as a slowly time-varying signal.Firstly,a novel intrusion detection scheme based on the theory of unknown input observability( UIO) is proposed. By constructing a bank of UIO,the states of the malicious agents can be directly estimated. Secondly,the faulty-node-removal algorithm is provided.Simulations are also provided to demonstrate the effectiveness of the theoretical results.展开更多
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.
基金Supported by the National Natural Science Foundation of China (60574088, 60274014)
文摘This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.
基金Supported by the National Natural Science Foundation of China(No.61340034)the Research Program of Application Foundation and Advanced Technology of Tianjin(No.13JCYBJC15600)
文摘This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.
文摘In this paper, we investigate two kinds of second-order consensus algorithms for multiple agents with coupling delay under general fixed directed information topology. Stability analysis is performed based on Lyapunov- Krasovskii functional method. Delay-dependent asymptotical stability condition in terms of linear matrix inequalities （LMIs） is derived for the second-order consensus algorithm of delayed dynamical networks. Both delay-independent and delay-dependent asymptotical stability conditions in terms of LMIs are derived for the second-order consensus algorithm with information feedback.
文摘This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded control inputs.Under the condition that the initial network is connected,the network will be connected all the time and all agents and the virtual leader can attain the same position and move with the same velocity.A simulation example is proposed to illustrate the effective of the proposed 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 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.
文摘Kidney transplantation(KT)accounts for nearly three-fourths of organ transplants in India,with living donors contributing to 82%of cases.Induction immunosuppression is essential to optimize initial immunosuppression,reduce acute rejections,and enable tailored use of maintenance agents.Rabbit anti-thymocyte globulin(rATG)and interleukin-2 receptor anatagonists(IL-2RA/IL-2RBs)are the most widely used induction therapies.However,data on induction practices across India are limited.To evaluate induction immunosuppression practices across KT centers in India and establish a consensus for different subsets of KT recipients.A nationwide online survey was conducted by the Indian Society of Organ Transplantation(ISOT)among its members(400 KT centers).Responses were analyzed to assess induction practices across diverse donor types,age groups,and immunological risk profiles.Heterogeneity in practices prompted consensus building using a modified Delphi process.Literature review and expert panel discussions(April 2024)were followed by structured voting,and 16 consensus statements were finalized.Of 400 centers approached,254 participated.rATG was the most commonly used induction therapy,followed by IL-2RBs;alemtuzumab was least used.Significant heterogeneity was observed in type,dose,and duration of induction therapy.Consensus recommendations were framed:rATG for high immunological risk recipients and deceased donor KTs;IL-2RB or low-dose rATG for low immunological risk;rituximab in ABOincompatible KTs;and tailoring based on age,diabetes,donor type,infection risk,and affordability.This first ISOT consensus provides 16 India-specific statements on induction therapy in KT.It emphasizes risk-stratified,evidenceinformed,and context-appropriate induction strategies,supporting standardization of care across the country.
基金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(11301492)the Ph.D.Programs Foundation of Ministry of Education of China(20130145120005)the TianYuan Special Funds of the National Natural Science Foundation of China(11226134)
文摘This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent to track the active leader and it is proved that the proposed control scheme enables the consensus to be obtained when the adjacency topology is fixed/switched. Simulation results show effectiveness of the proposed theoretical analysis.
基金supported by National Natural Science Foundation of China (No. 60774016, No. 60875039, No. 60904022)the Science Foundation of Education Office of Shandong Province of China (No. J08LJ01)Internal Visiting Scholar Object for Excellence Youth Teacher of the College of Shandong Province of China
文摘In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61203147,61374047,and 61403168)
文摘This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy.
基金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.
基金supported by the Defense Industrial Development Program of China under Grant No.JCKY2017212C005
文摘This paper is concerned with the consensus problems for second-order multi-agent systems with multiple input delays.Different from all standard consensus algorithms with uniform delays,the authors aim to find the largest input-delay margin which can guarantee the consensus for the case when delays are nonuniform.Based on frequency domain analysis and matrix theory,an upper bound for maximum tolerable input-delay is given in terms of the relationship with scaling strengths and largest eigenvalue of the Lapalician matrix.Simulation results are provided to illustrate the obtained results.
基金supported by the National Natural Science Foundation of China (Grant No. 60904022)
文摘This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference model based consensus algorithm is proposed. It is proved that the consensus can be achieved if the communication graph has a spanning tree. Different from most of the consensus algorithms proposed in the literature, the parameters of the control laws are different among agents. Therefore, each agent can design its control law independently. Secondly, it gives a consensus algorithm for the case that the velocities of the agents are not available. Thirdly, the effectiveness of the input delay and the communication delay is considered. It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law. Finally, some numerical examples are given to illustrate the proposed results.
基金Project supported by the National Basic Research Program of China (Grant No. 2012CB215203)the Key Program of the National Natural Science Foundation of China (Grant No. 51036002)the Fundamental Research Funds for the Central Universities of China (Grant No. JB2012008)
文摘In this study, the consensus problem for a class of second-order multi-agent systems with nonuniform time delays is investigated. A linear consensus protocol is used to make all agents reach consensus and move with a constant velocity. By a frequency-domain analysis, a simplified sufficient condition is given to guarantee the consensus stability of the dynamic system. Finally, the effectiveness of the obtained theoretical results is illustrated through numerical simulations.
基金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 the National Natural Science Foundation of China(Grant Nos.61573156,61273126,61503142,61272382,and 61573154)the Fundamental Research Funds for the Central Universities(Grant No.x2zd D2153620)
文摘This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms.
基金supported by the National Natural Science Foundation of China(6137510561403334)
文摘This paper investigates the consensus problem of second-order nonlinear multi-agent systems (MASs) via the sliding mode control (SMC) approach. The velocity of each agent is assumed to be unmeasurable. A second-order sliding mode observer is designed to estimate the velocity. Then a distributed discontinuous control law based on first-order SMC is presented to solve the consensus problem. Moreover, to overcome the chatting problem, two controllers based on the boundary layer method and the super-twisting algorithm respectively are presented. It is shown that the MASs will achieve consensus under some given conditions. Some examples are provided to demonstrate the effectiveness of the proposed control laws.
基金National Natural Science Foundations of China(Nos.61203147,61374047,61203126,60973095)
文摘This paper is concerned with distributed fault detection of second-order discrete-time multi-agent systems with adversary,where the adversary is regarded as a slowly time-varying signal.Firstly,a novel intrusion detection scheme based on the theory of unknown input observability( UIO) is proposed. By constructing a bank of UIO,the states of the malicious agents can be directly estimated. Secondly,the faulty-node-removal algorithm is provided.Simulations are also provided to demonstrate the effectiveness of the theoretical results.
