This paper addresses the time-varying formation-containment(FC) problem for nonholonomic multi-agent systems with a desired trajectory constraint, where only the leaders can acquire information about the desired traje...This paper addresses the time-varying formation-containment(FC) problem for nonholonomic multi-agent systems with a desired trajectory constraint, where only the leaders can acquire information about the desired trajectory. Input the fixed time-varying formation template to the leader and start executing, this process also needs to track the desired trajectory, and the follower needs to converge to the convex hull that the leader crosses. Firstly, the dynamic models of nonholonomic systems are linearized to second-order dynamics. Then, based on the desired trajectory and formation template, the FC control protocols are proposed. Sufficient conditions to achieve FC are introduced and an algorithm is proposed to resolve the control parameters by solving an algebraic Riccati equation. The system is demonstrated to achieve FC, with the average position and velocity of the leaders converging asymptotically to the desired trajectory. Finally, the theoretical achievements are verified in simulations by a multi-agent system composed of virtual human individuals.展开更多
For multi-agent systems based on the local information,the agents automatically converge to a common consensus state and the convergence speed is determined by the algebraic connectivity of the communication network.T...For multi-agent systems based on the local information,the agents automatically converge to a common consensus state and the convergence speed is determined by the algebraic connectivity of the communication network.To study fast consensus seeking problems of multi-agent systems in undirected networks,a consensus protocol is proposed which considers the average information of the agents＇ states in a certain time interval,and a consensus convergence criterion for the system is obtained.Based on the frequency-domain analysis and algebra graph theory,it is shown that if the time interval is chosen properly,then requiring the same maximum control effort the proposed protocol reaches consensus faster than the standard consensus protocol.Simulations are provided to demonstrate the effectiveness of these theoretical results.展开更多
Aiming at the problem on cooperative air-defense of surface warship formation, this paper maps the cooperative airdefense system of systems （SoS） for surface warship formation （CASoSSWF） to the biological immune s...Aiming at the problem on cooperative air-defense of surface warship formation, this paper maps the cooperative airdefense system of systems （SoS） for surface warship formation （CASoSSWF） to the biological immune system （BIS） according to the similarity of the defense mechanism and characteristics between the CASoSSWF and the BIS, and then designs the models of components and the architecture for a monitoring agent, a regulating agent, a killer agent, a pre-warning agent and a communicating agent by making use of the theories and methods of the artificial immune system, the multi-agent system （MAS）, the vaccine and the danger theory （DT）. Moreover a new immune multi-agent model using vaccine based on DT （IMMUVBDT） for the cooperative air-defense SoS is advanced. The immune response and immune mechanism of the CASoSSWF are analyzed. The model has a capability of memory, evolution, commendable dynamic environment adaptability and self-learning, and embodies adequately the cooperative air-defense mechanism for the CASoSSWF. Therefore it shows a novel idea for the CASoSSWF which can provide conception models for a surface warship formation operation simulation system.展开更多
In multi-agent systems(MAS),finding agents which are able to service properly in an open and dynamic environment are the key issue in problem solving.However,it is difficult to find agent resources quickly and positio...In multi-agent systems(MAS),finding agents which are able to service properly in an open and dynamic environment are the key issue in problem solving.However,it is difficult to find agent resources quickly and position agents accurately and complete the system integration by the keyword matching method,due to the lack of clear semantic information of the classical agent model.An semantic-based agent dynamic positioning mechanism was proposed to assist in the system dynamic integration.According to the semantic agent model and the description method,a two-stage process including the domain positioning stage and the service semantic matching positioning stage,was discussed.With this mechanism,proper agents that provide appropriate service to assign sub-tasks for task completion can be found quickly and accurately.Finally,the effectiveness of the positioning mechanism was validated through the in-depth performance analysis in the application of simulation experiments to the system dynamic integration.展开更多
Theoretical analysis of consensus for networked multi-agent systems with switching topologies was conducted.Supposing that information-exchange topologies of networked system are dynamic,a modified linear protocol is ...Theoretical analysis of consensus for networked multi-agent systems with switching topologies was conducted.Supposing that information-exchange topologies of networked system are dynamic,a modified linear protocol is proffered which is more practical than existing ones.The definition of trajectory consensus is given and a new consensus protocol is exhibited such that multi-agent system achieves trajectory consensus.In addition,a formation control strategy is designed.A common Lyapunov function is proposed to analyze the consensus convergence of networked multi-agent systems with switching topologies.Simulations are provided to demonstrate the effectiveness of the theoretical results.展开更多
The rapid development of military technology has prompted different types of equipment to break the limits of operational domains and emerged through complex interactions to form a vast combat system of systems(CSoS),...The rapid development of military technology has prompted different types of equipment to break the limits of operational domains and emerged through complex interactions to form a vast combat system of systems(CSoS),which can be abstracted as a heterogeneous combat network(HCN).It is of great military significance to study the disintegration strategy of combat networks to achieve the breakdown of the enemy’s CSoS.To this end,this paper proposes an integrated framework called HCN disintegration based on double deep Q-learning(HCN-DDQL).Firstly,the enemy’s CSoS is abstracted as an HCN,and an evaluation index based on the capability and attack costs of nodes is proposed.Meanwhile,a mathematical optimization model for HCN disintegration is established.Secondly,the learning environment and double deep Q-network model of HCN-DDQL are established to train the HCN’s disintegration strategy.Then,based on the learned HCN-DDQL model,an algorithm for calculating the HCN’s optimal disintegration strategy under different states is proposed.Finally,a case study is used to demonstrate the reliability and effectiveness of HCNDDQL,and the results demonstrate that HCN-DDQL can disintegrate HCNs more effectively than baseline methods.展开更多
A new vertical handoff decision algorithm is proposed to maximize the system benefit in heterogeneous wireless networks which comprise cellular networks and wireless local area networks （WLANs）. Firstly the block pr...A new vertical handoff decision algorithm is proposed to maximize the system benefit in heterogeneous wireless networks which comprise cellular networks and wireless local area networks （WLANs）. Firstly the block probability, the drop probability and the number of users in the heterogeneous networks are calculated in the channel-guard call admission method, and a function of the system benefit which is based on the new call arrival rate and the handoff call arrival rate is proposed. Then the optimal radius of WLAN is obtained by using simulation annealing （SA） method to maximize the benefit. All the nodes should handoff from cellular network to WLAN if they enter WLAN＇s scope and handoff from WLAN to cellular network if they leave the scope. Finally, the algorithm in different new call arrival rates and handoff call arrival rates is analyzed and results show that it can achieve good effects.展开更多
Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the proto...Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the protocol without considering the communication time-delay is presented,and by using Lyapunov stability theory,the sufficient condition of stability for this multi-agent system is presented.Further,considering the communication time-delay,the effectiveness of the protocol based on Lyapunov-Krasovskii function is demonstrated.The main contribution of the proposed protocols is that,as well as the velocity consensus is considered,the formation control is concerned for multi-agent systems described as the second-order equations.Finally,numerical examples are presented to illustrate the effectiveness of the proposed protocols.展开更多
Based on the idea of backstepping design, distributedcoordinated tracking problems under directed topology are discussedfor multiple Euler-Lagrange （EL） systems. The dynamicleader case is considered. First, with the...Based on the idea of backstepping design, distributedcoordinated tracking problems under directed topology are discussedfor multiple Euler-Lagrange （EL） systems. The dynamicleader case is considered. First, with the parameter-linearity property,a distributed coordinated adaptive control scheme is proposedfor EL systems in the presence of parametric uncertainties.Then, subject to nonlinear uncertainties and external disturbances,an improved adaptive control algorithm is developed by usingneural-network （NN） approximation of nonlinear functions. Bothproposed algorithms can make tracking errors for each followerultimately bounded. The closed-loop systems are investigated byusing the combination of graph theory, Lyapunov theory, and BarbalatLemma. Numerical examples and comparisons with othermethods are provided to show the effectiveness of the proposedcontrol strategies.展开更多
The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an i...The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an infinite grid-world. Predator agents are applied algorithms that use the univector field method to reach the prey agent, strategies for avoiding obstacles and strategies for cooperation between predator agents. Obstacle avoidance strategies are generalized and presented through strategies called hitting and following boundary(HFB); trapped and following shortest path(TFSP); and predicted and following shortest path(PFSP). In terms of cooperation, cooperation strategies are employed to more quickly reach and capture the prey agent. Experimental results are shown to illustrate the efficiency of the method in the pursuit problem.展开更多
This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market a...This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market and dealing with internal uncertainties such as machine breakdown or resources shortage. This system consists of various autonomous agents, each of which has t he capability of communicating with one another and making decisions based on it s knowledge and if necessary on information provided by other agents. Machine ag ents which represent the machines play an important role in the system in that t hey negotiate with each other to bid for jobs. An iterative bidding mechanism is proposed to facilitate the process of job assignment to machines and handle the negotiation between agents. This mechanism enables near optimal process plans a nd production schedules to be produced concurrently, so that dynamic changes in the market can be coped with at a minimum cost, and the utilisation of manufactu ring resources can be optimised. In addition, a currency scheme with currency-l ike metrics is proposed to encourage or prohibit machine agents to put forward t heir bids for the jobs announced. The values of the metrics are adjusted iterati vely so as to obtain an integrated plan and schedule which result in the minimum total production cost while satisfying products due dates. To deal with the optimisation problem, i.e. to what degree and how the currencies should be adj usted in each iteration, a genetic algorithm (GA) is developed. Comparisons are made between GA approach and simulated annealing (SA) optimisation technique.展开更多
虽然异构计算系统的应用可以加快神经网络参数的处理,但系统功耗也随之剧增。良好的功耗预测方法是异构系统优化功耗和处理多类型工作负载的基础,基于此,通过改进多层感知机-注意力模型,提出一种面向CPU/GPU异构计算系统多类型工作负载...虽然异构计算系统的应用可以加快神经网络参数的处理,但系统功耗也随之剧增。良好的功耗预测方法是异构系统优化功耗和处理多类型工作负载的基础,基于此,通过改进多层感知机-注意力模型,提出一种面向CPU/GPU异构计算系统多类型工作负载的功耗预测算法。首先,考虑服务器功耗与系统特征,建立一种基于特征的工作负载功耗模型;其次,针对现有的功耗预测算法不能解决系统特征与系统功耗之间的长程依赖的问题,提出一种改进的基于多层感知机-注意力模型的功耗预测算法Prophet,该算法改进多层感知机实现各个时刻的系统特征的提取,并使用注意力机制综合这些特征,从而有效解决系统特征与系统功耗之间的长程依赖问题;最后,在实际系统中开展相关实验,将所提算法分别与MLSTM_PM(Power consumption Model based on Multi-layer Long Short-Term Memory)和ENN_PM(Power consumption Model based on Elman Neural Network)等功耗预测算法对比。实验结果表明,Prophet具有较高的预测精准性,与MLSTM_PM算法相比,在工作负载blk、memtest和busspd上将平均相对误差(MRE)分别降低了1.22、1.01和0.93个百分点,并且具有较低的复杂度,表明了所提算法的有效性及可行性。展开更多
基金Supported by National Basic Research Program of China （973 Program） （2010CB731800）, National Natural Science Foundation of China （60934003, 61074065）, Key Project for Natural Science Research of Hebei Education Department （ZD200908）, and the Doctor Foundation of Northeastern University at Qinhuangdao（XNB201507）
文摘This paper addresses the time-varying formation-containment(FC) problem for nonholonomic multi-agent systems with a desired trajectory constraint, where only the leaders can acquire information about the desired trajectory. Input the fixed time-varying formation template to the leader and start executing, this process also needs to track the desired trajectory, and the follower needs to converge to the convex hull that the leader crosses. Firstly, the dynamic models of nonholonomic systems are linearized to second-order dynamics. Then, based on the desired trajectory and formation template, the FC control protocols are proposed. Sufficient conditions to achieve FC are introduced and an algorithm is proposed to resolve the control parameters by solving an algebraic Riccati equation. The system is demonstrated to achieve FC, with the average position and velocity of the leaders converging asymptotically to the desired trajectory. Finally, the theoretical achievements are verified in simulations by a multi-agent system composed of virtual human individuals.
基金supported by the National Natural Science Foundation of China (6087405360574088)
文摘For multi-agent systems based on the local information,the agents automatically converge to a common consensus state and the convergence speed is determined by the algebraic connectivity of the communication network.To study fast consensus seeking problems of multi-agent systems in undirected networks,a consensus protocol is proposed which considers the average information of the agents＇ states in a certain time interval,and a consensus convergence criterion for the system is obtained.Based on the frequency-domain analysis and algebra graph theory,it is shown that if the time interval is chosen properly,then requiring the same maximum control effort the proposed protocol reaches consensus faster than the standard consensus protocol.Simulations are provided to demonstrate the effectiveness of these theoretical results.
文摘Aiming at the problem on cooperative air-defense of surface warship formation, this paper maps the cooperative airdefense system of systems （SoS） for surface warship formation （CASoSSWF） to the biological immune system （BIS） according to the similarity of the defense mechanism and characteristics between the CASoSSWF and the BIS, and then designs the models of components and the architecture for a monitoring agent, a regulating agent, a killer agent, a pre-warning agent and a communicating agent by making use of the theories and methods of the artificial immune system, the multi-agent system （MAS）, the vaccine and the danger theory （DT）. Moreover a new immune multi-agent model using vaccine based on DT （IMMUVBDT） for the cooperative air-defense SoS is advanced. The immune response and immune mechanism of the CASoSSWF are analyzed. The model has a capability of memory, evolution, commendable dynamic environment adaptability and self-learning, and embodies adequately the cooperative air-defense mechanism for the CASoSSWF. Therefore it shows a novel idea for the CASoSSWF which can provide conception models for a surface warship formation operation simulation system.
基金Projects(61173026,61373045,61202039)supported by the National Natural Science Foundation of ChinaProject(2012AA02A603)supported by the National High Technology Research and Development Program of China+1 种基金Projects(K5051223008,K5051223002)supported by the Fundamental Research Funds for the Central Universities of ChinaProject(513***103E)supported by the Pre-Research Project of the"Twelfth Five-Year-Plan"of China
文摘In multi-agent systems(MAS),finding agents which are able to service properly in an open and dynamic environment are the key issue in problem solving.However,it is difficult to find agent resources quickly and position agents accurately and complete the system integration by the keyword matching method,due to the lack of clear semantic information of the classical agent model.An semantic-based agent dynamic positioning mechanism was proposed to assist in the system dynamic integration.According to the semantic agent model and the description method,a two-stage process including the domain positioning stage and the service semantic matching positioning stage,was discussed.With this mechanism,proper agents that provide appropriate service to assign sub-tasks for task completion can be found quickly and accurately.Finally,the effectiveness of the positioning mechanism was validated through the in-depth performance analysis in the application of simulation experiments to the system dynamic integration.
基金Projects(61075065, 60774045) supported by the National Natural Science Foundation of China Project(CX2010B080) supported by Hunan Provincial Innovation Foundation For Postgraduate,China
文摘Theoretical analysis of consensus for networked multi-agent systems with switching topologies was conducted.Supposing that information-exchange topologies of networked system are dynamic,a modified linear protocol is proffered which is more practical than existing ones.The definition of trajectory consensus is given and a new consensus protocol is exhibited such that multi-agent system achieves trajectory consensus.In addition,a formation control strategy is designed.A common Lyapunov function is proposed to analyze the consensus convergence of networked multi-agent systems with switching topologies.Simulations are provided to demonstrate the effectiveness of the theoretical results.
基金supported by the National Natural Science Foundation of China(7200120972231011+2 种基金72071206)the Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province(2020RC4046)the Science Foundation for Outstanding Youth Scholars of Hunan Province(2022JJ20047).
文摘The rapid development of military technology has prompted different types of equipment to break the limits of operational domains and emerged through complex interactions to form a vast combat system of systems(CSoS),which can be abstracted as a heterogeneous combat network(HCN).It is of great military significance to study the disintegration strategy of combat networks to achieve the breakdown of the enemy’s CSoS.To this end,this paper proposes an integrated framework called HCN disintegration based on double deep Q-learning(HCN-DDQL).Firstly,the enemy’s CSoS is abstracted as an HCN,and an evaluation index based on the capability and attack costs of nodes is proposed.Meanwhile,a mathematical optimization model for HCN disintegration is established.Secondly,the learning environment and double deep Q-network model of HCN-DDQL are established to train the HCN’s disintegration strategy.Then,based on the learned HCN-DDQL model,an algorithm for calculating the HCN’s optimal disintegration strategy under different states is proposed.Finally,a case study is used to demonstrate the reliability and effectiveness of HCNDDQL,and the results demonstrate that HCN-DDQL can disintegrate HCNs more effectively than baseline methods.
文摘A new vertical handoff decision algorithm is proposed to maximize the system benefit in heterogeneous wireless networks which comprise cellular networks and wireless local area networks （WLANs）. Firstly the block probability, the drop probability and the number of users in the heterogeneous networks are calculated in the channel-guard call admission method, and a function of the system benefit which is based on the new call arrival rate and the handoff call arrival rate is proposed. Then the optimal radius of WLAN is obtained by using simulation annealing （SA） method to maximize the benefit. All the nodes should handoff from cellular network to WLAN if they enter WLAN＇s scope and handoff from WLAN to cellular network if they leave the scope. Finally, the algorithm in different new call arrival rates and handoff call arrival rates is analyzed and results show that it can achieve good effects.
基金supported by the National Natural Science Foundation of China (6093400361074065)+1 种基金the National Basic Research Program of China (973 Program) (2010CB731800)the Key Project for Natural Science Research of Hebei Education Department (ZD200908)
文摘Two protocols are presented,which can make agents reach consensus while achieving and preserving the desired formation in fixed topology with and without communication timedelay for multi-agent network.First,the protocol without considering the communication time-delay is presented,and by using Lyapunov stability theory,the sufficient condition of stability for this multi-agent system is presented.Further,considering the communication time-delay,the effectiveness of the protocol based on Lyapunov-Krasovskii function is demonstrated.The main contribution of the proposed protocols is that,as well as the velocity consensus is considered,the formation control is concerned for multi-agent systems described as the second-order equations.Finally,numerical examples are presented to illustrate the effectiveness of the proposed protocols.
基金supported by the National Natural Science Foundation of China(6130400561174200)the Research Fund for the Doctoral Program of Higher Education of China(20102302110031)
文摘Based on the idea of backstepping design, distributedcoordinated tracking problems under directed topology are discussedfor multiple Euler-Lagrange （EL） systems. The dynamicleader case is considered. First, with the parameter-linearity property,a distributed coordinated adaptive control scheme is proposedfor EL systems in the presence of parametric uncertainties.Then, subject to nonlinear uncertainties and external disturbances,an improved adaptive control algorithm is developed by usingneural-network （NN） approximation of nonlinear functions. Bothproposed algorithms can make tracking errors for each followerultimately bounded. The closed-loop systems are investigated byusing the combination of graph theory, Lyapunov theory, and BarbalatLemma. Numerical examples and comparisons with othermethods are provided to show the effectiveness of the proposedcontrol strategies.
基金the Basic Science Research Program through the National Research Foundation of Korea (NRF-2014R1A1A2057735)the Kyung Hee University in 2016 [KHU-20160601]
文摘The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an infinite grid-world. Predator agents are applied algorithms that use the univector field method to reach the prey agent, strategies for avoiding obstacles and strategies for cooperation between predator agents. Obstacle avoidance strategies are generalized and presented through strategies called hitting and following boundary(HFB); trapped and following shortest path(TFSP); and predicted and following shortest path(PFSP). In terms of cooperation, cooperation strategies are employed to more quickly reach and capture the prey agent. Experimental results are shown to illustrate the efficiency of the method in the pursuit problem.
文摘This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market and dealing with internal uncertainties such as machine breakdown or resources shortage. This system consists of various autonomous agents, each of which has t he capability of communicating with one another and making decisions based on it s knowledge and if necessary on information provided by other agents. Machine ag ents which represent the machines play an important role in the system in that t hey negotiate with each other to bid for jobs. An iterative bidding mechanism is proposed to facilitate the process of job assignment to machines and handle the negotiation between agents. This mechanism enables near optimal process plans a nd production schedules to be produced concurrently, so that dynamic changes in the market can be coped with at a minimum cost, and the utilisation of manufactu ring resources can be optimised. In addition, a currency scheme with currency-l ike metrics is proposed to encourage or prohibit machine agents to put forward t heir bids for the jobs announced. The values of the metrics are adjusted iterati vely so as to obtain an integrated plan and schedule which result in the minimum total production cost while satisfying products due dates. To deal with the optimisation problem, i.e. to what degree and how the currencies should be adj usted in each iteration, a genetic algorithm (GA) is developed. Comparisons are made between GA approach and simulated annealing (SA) optimisation technique.
文摘虽然异构计算系统的应用可以加快神经网络参数的处理,但系统功耗也随之剧增。良好的功耗预测方法是异构系统优化功耗和处理多类型工作负载的基础,基于此,通过改进多层感知机-注意力模型,提出一种面向CPU/GPU异构计算系统多类型工作负载的功耗预测算法。首先,考虑服务器功耗与系统特征,建立一种基于特征的工作负载功耗模型;其次,针对现有的功耗预测算法不能解决系统特征与系统功耗之间的长程依赖的问题,提出一种改进的基于多层感知机-注意力模型的功耗预测算法Prophet,该算法改进多层感知机实现各个时刻的系统特征的提取,并使用注意力机制综合这些特征,从而有效解决系统特征与系统功耗之间的长程依赖问题;最后,在实际系统中开展相关实验,将所提算法分别与MLSTM_PM(Power consumption Model based on Multi-layer Long Short-Term Memory)和ENN_PM(Power consumption Model based on Elman Neural Network)等功耗预测算法对比。实验结果表明,Prophet具有较高的预测精准性,与MLSTM_PM算法相比,在工作负载blk、memtest和busspd上将平均相对误差(MRE)分别降低了1.22、1.01和0.93个百分点,并且具有较低的复杂度,表明了所提算法的有效性及可行性。
