The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upp...The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upper bounds of the reference signals and their derivatives are known in advance,thereby posing significant challenges in practical scenarios.Introducing adaptive gains in DAC algorithms provides a remedy by relaxing this assumption.However,the current adaptive gains used in this type of DAC algorithms are non-decreasing and may increase to infinity if persist disturbance exists.In order to overcome this defect,this paper presents a novel DAC algorithm with modified adaptive gains.This approach obviates the necessity for prior knowledge concerning the upper bounds of the reference signals and their derivatives.Moreover,the adaptive gains are able to remain bounded even in the presence of external disturbances.Furthermore,the proposed adaptive DAC algorithm is employed to address the distributed secondary control problem of DC microgrids.Comparative case studies are provided to verify the superiority of the proposed DAC algorithm.展开更多
This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is ...This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the 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.展开更多
We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and fin...We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and finite-time consensus criteria are obtained for the heterogeneous multi-agent systems.Compared with the existing results,the stationary and kinetic consensuses of the heterogeneous multi-agent systems can be achieved in a finite time respectively.Moreover,the leader can be a first-order or a second-order integrator agent.Finally,some simulation examples are employed to verify the efficiency of the theoretical results.展开更多
This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensu...This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.展开更多
In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-id...In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.展开更多
The leaderless and leader-following finite-time consensus problems for multiagent systems(MASs)described by first-order linear hyperbolic partial differential equations(PDEs)are studied.The Lyapunov theorem and the un...The leaderless and leader-following finite-time consensus problems for multiagent systems(MASs)described by first-order linear hyperbolic partial differential equations(PDEs)are studied.The Lyapunov theorem and the unique solvability result for the first-order linear hyperbolic PDE are used to obtain some sufficient conditions for ensuring the finite-time consensus of the leaderless and leader-following MASs driven by first-order linear hyperbolic PDEs.Finally,two numerical examples are provided to verify the effectiveness of the proposed methods.展开更多
In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability t...In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.展开更多
This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global ...This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.展开更多
This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy o...This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy of recovering the connectivity of network topology among normal agents based on multi-hop communication and a fault-tolerant finitetime dynamical consensus protocol with time-varying gains are proposed to resist synchronous SSFF.It is proved that double-integrator MASs with partial agents subject to synchronous SSFF using the proposed strategy of network topology connectivity recovery and fault-tolerant finite-time dynamical consensus protocol with the proper time-varying gains can achieve finite-time dynamical consensus.Numerical simulations are given to illustrate the effectiveness of the theoretical results.展开更多
This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order le...This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.展开更多
The average consensus problem in a directed network of multi-agent systems with communication time delays was investigated. The directed networks were balanced and weakly connected with fixed or switching topology dig...The average consensus problem in a directed network of multi-agent systems with communication time delays was investigated. The directed networks were balanced and weakly connected with fixed or switching topology digraph. Based on frequency domain analysis method, a sufficient condition of asymptotic stability of multi-agent systems with time delays was obtained,where the analytic formula between the maximum time delay and the directed network structure was provided. The maximum time delay can be derived directly and easily by the eigenvalue of Laplacian L. Numerical examples confirm the effectiveness of the proposed technique.展开更多
The average consensus in undirected networks of multi-agent with both fixed and switching topology coupling multiple time-varying delays is studied. By using orthogonal transformation techniques, the original system c...The average consensus in undirected networks of multi-agent with both fixed and switching topology coupling multiple time-varying delays is studied. By using orthogonal transformation techniques, the original system can be turned into a reduced dimensional system and then LMI-based method can be applied conveniently. Convergence analysis is conducted by constructing Lyapunov-Krasovskii function. Sufficient conditions on average consensus problem with multiple time-varying delays in undirected networks are obtained via linear matrix inequality (LMI) techniques. In particular, the maximal admissible upper bound of time-varying delays can be easily obtained by solving several simple and feasible LMIs. Finally, simulation examples are given to demonstrate the effectiveness of the theoretical results.展开更多
Dear Editor,This letter introduces a novel algorithm for privacy preservation designed to safeguard both the initial and real-time states of agents under complete distributed average consensus.It addresses a gap in ex...Dear Editor,This letter introduces a novel algorithm for privacy preservation designed to safeguard both the initial and real-time states of agents under complete distributed average consensus.It addresses a gap in existing privacy preservation approaches that predominantly focus on protecting the initial state,with limited consideration for privacy implications throughout the entire process.The algorithm ensures the privacy of both the initial and real-time states by introducing perturbations to the consensus process,allowing agents to freely define these perturbations themselves.Additionally,the perturbations defined by agents arbitrarily do not compromise the accuracy of the consensus result.One of the main results derived is that no agent has access to the real-time state of another agent.展开更多
Consensus theory and noncooperative game theory respectively deal with cooperative and noncooperative interactions among multiple players/agents. They provide a natural framework for road pricing design, since each mo...Consensus theory and noncooperative game theory respectively deal with cooperative and noncooperative interactions among multiple players/agents. They provide a natural framework for road pricing design, since each motorist may myopically optimize his or her own utility as a function of road price and collectively communicate with his or her friends and neighbors on traffic situation at the same time. This paper considers the road pricing design by using game theory and consensus theory. For the case where a system supervisor broadcasts information on the overall system to each agent, we present a variant of standard fictitious play called average strategy fictitious play(ASFP) for large-scale repeated congestion games.Only a weighted running average of all other players actions is assumed to be available to each player. The ASFP reduces the burden of both information gathering and information processing for each player. Compared to the joint strategy fictitious play(JSFP) studied in the literature, the updating process of utility functions for each player is avoided. We prove that there exists at least one pure strategy Nash equilibrium for the congestion game under investigation, and the players actions generated by the ASFP with inertia(players reluctance to change their previous actions) converge to a Nash equilibrium almost surely. For the case without broadcasting, a consensus protocol is introduced for individual agents to estimate the percentage of players choosing each resource, and the convergence property of players action profile is still ensured. The results are applied to road pricing design to achieve socially local optimal trip timing. Simulation results are provided based on the real traffic data for the Singapore case study.展开更多
Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have th...Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions.Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics.Therefore,while sustaining the significance of both directed and undirected graphs,this research emphases on the demonstration of a distributed average consensus algorithm.It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme.The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time.The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links.Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence.The same network parameters are introduced for both orientations of the communication graphs.In addition,the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.展开更多
基金supported in part by the National Natural Science Foundation of China(20221017-10,62573258,62188101)the National Natural Science Foundation of Shandong Province(ZR2024 JQ018,ZR2022MF227).
文摘The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upper bounds of the reference signals and their derivatives are known in advance,thereby posing significant challenges in practical scenarios.Introducing adaptive gains in DAC algorithms provides a remedy by relaxing this assumption.However,the current adaptive gains used in this type of DAC algorithms are non-decreasing and may increase to infinity if persist disturbance exists.In order to overcome this defect,this paper presents a novel DAC algorithm with modified adaptive gains.This approach obviates the necessity for prior knowledge concerning the upper bounds of the reference signals and their derivatives.Moreover,the adaptive gains are able to remain bounded even in the presence of external disturbances.Furthermore,the proposed adaptive DAC algorithm is employed to address the distributed secondary control problem of DC microgrids.Comparative case studies are provided to verify the superiority of the proposed DAC algorithm.
基金supported by the National Natural Science Foundation of China(6127312661363002+3 种基金61374104)the Natural Science Foundation of Guangdong Province(10251064101000008S2012010009675)the Fundamental Research Funds for the Central Universities(2012ZM0059)
文摘This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the 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.
基金Project supported by the National Basic Research Program of China (Grant No. 2010CB731800)the National Natural Science Foundation of China (Grant Nos. 60934003 and 61074065)the Natural Science Foundation of Hebei Province,China (Grant Nos. F2012203119 and 1208085MF111)
文摘We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and finite-time consensus criteria are obtained for the heterogeneous multi-agent systems.Compared with the existing results,the stationary and kinetic consensuses of the heterogeneous multi-agent systems can be achieved in a finite time respectively.Moreover,the leader can be a first-order or a second-order integrator agent.Finally,some simulation examples are employed to verify the efficiency of the theoretical results.
基金supported in part by the National Key Research and Development Program of China (2016YFB0800601)
文摘This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.
基金Supported by the National Natural Science Foundation of China(6147333861304164)
文摘In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.
基金the National Natural Science Foundation of China(Nos.11671282 and 12171339)。
文摘The leaderless and leader-following finite-time consensus problems for multiagent systems(MASs)described by first-order linear hyperbolic partial differential equations(PDEs)are studied.The Lyapunov theorem and the unique solvability result for the first-order linear hyperbolic PDE are used to obtain some sufficient conditions for ensuring the finite-time consensus of the leaderless and leader-following MASs driven by first-order linear hyperbolic PDEs.Finally,two numerical examples are provided to verify the effectiveness of the proposed methods.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61203304,61203055,and 11226150)the Fundamental Research Funds for the Central Universities,China (Grant Nos. 2011QNA26,2010LKSX04,and 2010LKSX09)
文摘In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.
基金Supported by National Natural Science Foundation of China （61074032, 61473182, 61104089）, National High Technology Research and Development Program of China （863 Program） （2011AA040103-7）, Project of Science and Technology Commission of Shanghai Municipality （10JC1405000, 11ZR1413100,14JC1402200）, and Shanghai Rising-Star Program （13QA1401600）
基金supported by the National Natural Science Foundation of China(62073019)。
文摘This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.
基金Project supported by the National Natural Science Foundation of China(Grant No.61876073)the Fundamental Research Funds for the Central Universities of China(Grant No.JUSRP21920)
文摘This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy of recovering the connectivity of network topology among normal agents based on multi-hop communication and a fault-tolerant finitetime dynamical consensus protocol with time-varying gains are proposed to resist synchronous SSFF.It is proved that double-integrator MASs with partial agents subject to synchronous SSFF using the proposed strategy of network topology connectivity recovery and fault-tolerant finite-time dynamical consensus protocol with the proper time-varying gains can achieve finite-time dynamical consensus.Numerical simulations are given to illustrate the effectiveness of the theoretical results.
基金supported by National Natural Science Foundation of China(61473182)National Key Scientific Instrument and Equipment Development Project(2012YQ15008703)+1 种基金Project of Science and Technology Commission of Shanghai Municipality(14JC1402200,15JC1401900,14ZR1414800)Shanghai Rising-Star Program(13QA1401600)
基金Supported by National Natural Science Foundation of China （61079001, 61273006）, National High Technology Research and Development Program of China （863 Program） （2011AAl10301）, Specialized Research Fund for the Doctoral Program of Higher Education of China （20111103110017）, Hebei Province Science and Technology Research and Development Planning Project （10203548D）, Hebei Province Science and Technology Planning Project （13210807） Hebei Province Science and Technology Conditions Building Program （11963546D）
基金supported by National Basic Research Program of China (973 Program) (No.2010CB731800)National Natural Science Foundation of China (Nos.60934003 and 61074065)Natural Science Foundation of Hebei Province (No.F2012203119)
文摘This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.
基金National Natural Science Foundation of China(No.61074032)National High Technology Research and Development Program of China(No.2011AA040103-7)+3 种基金National Science Foundation of China(No.61104089)Science and Technology Commission of Shanghai Municipality,China(No.11JC1404000)Shanghai Rising-Star Program,China(No.13QA1401600)Shandong Province Special Topic of Information Strategy,China(No.2013EI214)
文摘The average consensus problem in a directed network of multi-agent systems with communication time delays was investigated. The directed networks were balanced and weakly connected with fixed or switching topology digraph. Based on frequency domain analysis method, a sufficient condition of asymptotic stability of multi-agent systems with time delays was obtained,where the analytic formula between the maximum time delay and the directed network structure was provided. The maximum time delay can be derived directly and easily by the eigenvalue of Laplacian L. Numerical examples confirm the effectiveness of the proposed technique.
文摘The average consensus in undirected networks of multi-agent with both fixed and switching topology coupling multiple time-varying delays is studied. By using orthogonal transformation techniques, the original system can be turned into a reduced dimensional system and then LMI-based method can be applied conveniently. Convergence analysis is conducted by constructing Lyapunov-Krasovskii function. Sufficient conditions on average consensus problem with multiple time-varying delays in undirected networks are obtained via linear matrix inequality (LMI) techniques. In particular, the maximal admissible upper bound of time-varying delays can be easily obtained by solving several simple and feasible LMIs. Finally, simulation examples are given to demonstrate the effectiveness of the theoretical results.
基金supported in part by the National Natural Science Foundation of China(62276036)the Major Project of Scientific and Technological Research Program of Chongqing Municipal Education Commission(KJZD-M202100602)Innovation and Development Joint Fund Project of Chongqing Natural Science Foundation(CSTB2024NSCQ-LZX0118).
文摘Dear Editor,This letter introduces a novel algorithm for privacy preservation designed to safeguard both the initial and real-time states of agents under complete distributed average consensus.It addresses a gap in existing privacy preservation approaches that predominantly focus on protecting the initial state,with limited consideration for privacy implications throughout the entire process.The algorithm ensures the privacy of both the initial and real-time states by introducing perturbations to the consensus process,allowing agents to freely define these perturbations themselves.Additionally,the perturbations defined by agents arbitrarily do not compromise the accuracy of the consensus result.One of the main results derived is that no agent has access to the real-time state of another agent.
文摘Consensus theory and noncooperative game theory respectively deal with cooperative and noncooperative interactions among multiple players/agents. They provide a natural framework for road pricing design, since each motorist may myopically optimize his or her own utility as a function of road price and collectively communicate with his or her friends and neighbors on traffic situation at the same time. This paper considers the road pricing design by using game theory and consensus theory. For the case where a system supervisor broadcasts information on the overall system to each agent, we present a variant of standard fictitious play called average strategy fictitious play(ASFP) for large-scale repeated congestion games.Only a weighted running average of all other players actions is assumed to be available to each player. The ASFP reduces the burden of both information gathering and information processing for each player. Compared to the joint strategy fictitious play(JSFP) studied in the literature, the updating process of utility functions for each player is avoided. We prove that there exists at least one pure strategy Nash equilibrium for the congestion game under investigation, and the players actions generated by the ASFP with inertia(players reluctance to change their previous actions) converge to a Nash equilibrium almost surely. For the case without broadcasting, a consensus protocol is introduced for individual agents to estimate the percentage of players choosing each resource, and the convergence property of players action profile is still ensured. The results are applied to road pricing design to achieve socially local optimal trip timing. Simulation results are provided based on the real traffic data for the Singapore case study.
基金Supported by National Basic Research Program of China （973 Program） （2010CB731800） and National Natural Science Foundation of China （60974059, 60736026, 61021063）
文摘Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions.Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics.Therefore,while sustaining the significance of both directed and undirected graphs,this research emphases on the demonstration of a distributed average consensus algorithm.It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme.The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time.The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links.Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence.The same network parameters are introduced for both orientations of the communication graphs.In addition,the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.
