When performing tasks,unmanned clusters often face a variety of strategy choices.One of the key issues in unmanned cluster tasks is the method through which to design autonomous collaboration and cooperative evolution...When performing tasks,unmanned clusters often face a variety of strategy choices.One of the key issues in unmanned cluster tasks is the method through which to design autonomous collaboration and cooperative evolution mechanisms that allow for unmanned clusters to maximize their overall task effective-ness under the condition of strategic diversity.This paper ana-lyzes these task requirements from three perspectives:the diver-sity of the decision space,information network construction,and the autonomous collaboration mechanism.Then,this paper pro-poses a method for solving the problem of strategy selection diversity under two network structures.Next,this paper presents a Moran-rule-based evolution dynamics model for unmanned cluster strategies and a vision-driven-mechanism-based evolu-tion dynamics model for unmanned cluster strategy in the con-text of strategy selection diversity according to various unmanned cluster application scenarios.Finally,this paper pro-vides a simulation analysis of the effects of relevant parameters such as the payoff factor and cluster size on cooperative evolu-tion in autonomous cluster collaboration for the two types of models.On this basis,this paper presents advice for effectively addressing diverse choices in unmanned cluster tasks,thereby providing decision support for practical applications of unmanned cluster tasks.展开更多
As the unmanned weap system-of systems(UWSoS)becomes complex,the inevitable uncertain interference gradu-ally increases,which leads to a strong emphasis on the resilience of UWSoS.Hence,this paper presents a resilienc...As the unmanned weap system-of systems(UWSoS)becomes complex,the inevitable uncertain interference gradu-ally increases,which leads to a strong emphasis on the resilience of UWSoS.Hence,this paper presents a resilience-driven cooperative reconfiguration strategy to enhance the resilience of UWSoS.First,a unified resilience-driven coopera-tive reconfiguration strategy framework is designed to guide the UWSoS resilience enhancement.Subsequently,a cooperative reconfiguration strategy algorithm is proposed to identify the optimal cooperative reconfiguration sequence,combining the cooperative pair resilience contribution index(CPRCI)and coop-erative pair importance index(CPII).At last,the effectiveness and superiority of the proposed algorithm are demonstrated through various attack scenario simulations that include differ-ent attack modes and intensities.The analysis results can pro-vide a reference for decision-makers to manage UWSoS.展开更多
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.展开更多
To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model wit...To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model without boundary constraints are built,and the criteria for successful target capture are given.Then,the cooperative hunting problem of a USV fleet is modeled as a decentralized partially observable Markov decision process(Dec-POMDP),and a distributed partially observable multitarget hunting Proximal Policy Optimization(DPOMH-PPO)algorithm applicable to USVs is proposed.In addition,an observation model,a reward function and the action space applicable to multi-target hunting tasks are designed.To deal with the dynamic change of observational feature dimension input by partially observable systems,a feature embedding block is proposed.By combining the two feature compression methods of column-wise max pooling(CMP)and column-wise average-pooling(CAP),observational feature encoding is established.Finally,the centralized training and decentralized execution framework is adopted to complete the training of hunting strategy.Each USV in the fleet shares the same policy and perform actions independently.Simulation experiments have verified the effectiveness of the DPOMH-PPO algorithm in the test scenarios with different numbers of USVs.Moreover,the advantages of the proposed model are comprehensively analyzed from the aspects of algorithm performance,migration effect in task scenarios and self-organization capability after being damaged,the potential deployment and application of DPOMH-PPO in the real environment is verified.展开更多
Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the n...Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the near future. On the basisof analyzing the structure of the MCAV/UCAV cooperative engage-ment system, this paper divides the unique system into three hi-erarchical levels, respectively, i.e., mission level, task-cluster leveland task level. To solve the formation and adjustment problem ofthe latter two levels, three corresponding mathematical modelsare established. To solve these models, three algorithms calledquantum artificial bee colony （QABC） algorithm, greedy strategy（GS） and two-stage greedy strategy （TSGS） are proposed. Finally,a series of simulation experiments are designed to verify the effec-tiveness and superiority of the proposed algorithms.展开更多
Particle swarm optimization （PSO） is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been ...Particle swarm optimization （PSO） is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been proven that computing minimal reduc- tion of decision tables is a non-derterministic polynomial （NP）-hard problem. A new cooperative extended attribute reduction algorithm named Co-PSAR based on improved PSO is proposed, in which the cooperative evolutionary strategy with suitable fitness func- tions is involved to learn a good hypothesis for accelerating the optimization of searching minimal attribute reduction. Experiments on Benchmark functions and University of California, Irvine （UCI） data sets, compared with other algorithms, verify the superiority of the Co-PSAR algorithm in terms of the convergence speed, efficiency and accuracy for the attribute reduction.展开更多
The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual incom...The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.展开更多
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.展开更多
In order to efficiently mitigate error propagation and reduce computational complexity, this paper proposes a scheme for traditional cooperative networks, named as dual-threshold symbol selective demodulate-and-forwar...In order to efficiently mitigate error propagation and reduce computational complexity, this paper proposes a scheme for traditional cooperative networks, named as dual-threshold symbol selective demodulate-and-forward. In the scheme, two log likelihood ratio(LLR)-based thresholds are devised to measure the reliability of received signals for the relay and the destination, respectively. One of the threshold guarantees that the relay only forwards reliable symbols, thus less error will be propagated to the destination. The other threshold is used at the destination for determining the reliability of symbols received from the source.The destination will directly demodulate reliable symbols received from the source. Otherwise, when the symbols received from the source are not reliable, the maximum ratio combiner(MRC) is used to combine symbols received from the source and the relay.Closed-form expression of the bit error probability(BEP) of the proposed scheme is derived and analyzed under binary phase shift keying(BPSK) modulation. Then, the relationship and closed-form solutions of two LLR-based thresholds are derived. Simulation results prove that the theoretical BEP of the proposed scheme closely matches the simulated ones. The proposed scheme can achieve high performance with low computational complexity compared to existing schemes.展开更多
Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm ...Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably.展开更多
This paper studies a special defense game using unmanned aerial vehicle(UAV)swarm against a fast intruder.The fast intruder applies an offensive strategy based on the artificial potential field method and Apollonius c...This paper studies a special defense game using unmanned aerial vehicle(UAV)swarm against a fast intruder.The fast intruder applies an offensive strategy based on the artificial potential field method and Apollonius circle to scout a certain destination.As defenders,the UAVs are arranged into three layers:the forward layer,the midfield layer and the back layer.The co-defense mechanism,including the role derivation method of UAV swarm and a guidance law based on the co-defense front point,is introduced for UAV swarm to co-detect the intruder.Besides,five formations are designed for comparative analysis when ten UAVs are applied.Through Monte Carlo experiments and ablation experiment,the effectiveness of the proposed co-defense method has been verified.展开更多
基金supported by the National Natural Science Foundation of China(72471240).
文摘When performing tasks,unmanned clusters often face a variety of strategy choices.One of the key issues in unmanned cluster tasks is the method through which to design autonomous collaboration and cooperative evolution mechanisms that allow for unmanned clusters to maximize their overall task effective-ness under the condition of strategic diversity.This paper ana-lyzes these task requirements from three perspectives:the diver-sity of the decision space,information network construction,and the autonomous collaboration mechanism.Then,this paper pro-poses a method for solving the problem of strategy selection diversity under two network structures.Next,this paper presents a Moran-rule-based evolution dynamics model for unmanned cluster strategies and a vision-driven-mechanism-based evolu-tion dynamics model for unmanned cluster strategy in the con-text of strategy selection diversity according to various unmanned cluster application scenarios.Finally,this paper pro-vides a simulation analysis of the effects of relevant parameters such as the payoff factor and cluster size on cooperative evolu-tion in autonomous cluster collaboration for the two types of models.On this basis,this paper presents advice for effectively addressing diverse choices in unmanned cluster tasks,thereby providing decision support for practical applications of unmanned cluster tasks.
基金This work was supported by Ph.D.Intelligent Innovation Foundation Project(201-CXCY-A01-08-19-01)Science and Technology on Information System Engineering Laboratory(05202007).
文摘As the unmanned weap system-of systems(UWSoS)becomes complex,the inevitable uncertain interference gradu-ally increases,which leads to a strong emphasis on the resilience of UWSoS.Hence,this paper presents a resilience-driven cooperative reconfiguration strategy to enhance the resilience of UWSoS.First,a unified resilience-driven coopera-tive reconfiguration strategy framework is designed to guide the UWSoS resilience enhancement.Subsequently,a cooperative reconfiguration strategy algorithm is proposed to identify the optimal cooperative reconfiguration sequence,combining the cooperative pair resilience contribution index(CPRCI)and coop-erative pair importance index(CPII).At last,the effectiveness and superiority of the proposed algorithm are demonstrated through various attack scenario simulations that include differ-ent attack modes and intensities.The analysis results can pro-vide a reference for decision-makers to manage UWSoS.
文摘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.
基金financial support from National Natural Science Foundation of China(Grant No.61601491)Natural Science Foundation of Hubei Province,China(Grant No.2018CFC865)Military Research Project of China(-Grant No.YJ2020B117)。
文摘To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model without boundary constraints are built,and the criteria for successful target capture are given.Then,the cooperative hunting problem of a USV fleet is modeled as a decentralized partially observable Markov decision process(Dec-POMDP),and a distributed partially observable multitarget hunting Proximal Policy Optimization(DPOMH-PPO)algorithm applicable to USVs is proposed.In addition,an observation model,a reward function and the action space applicable to multi-target hunting tasks are designed.To deal with the dynamic change of observational feature dimension input by partially observable systems,a feature embedding block is proposed.By combining the two feature compression methods of column-wise max pooling(CMP)and column-wise average-pooling(CAP),observational feature encoding is established.Finally,the centralized training and decentralized execution framework is adopted to complete the training of hunting strategy.Each USV in the fleet shares the same policy and perform actions independently.Simulation experiments have verified the effectiveness of the DPOMH-PPO algorithm in the test scenarios with different numbers of USVs.Moreover,the advantages of the proposed model are comprehensively analyzed from the aspects of algorithm performance,migration effect in task scenarios and self-organization capability after being damaged,the potential deployment and application of DPOMH-PPO in the real environment is verified.
基金supported by the National Natural Science Foundation of China(61573017)the Doctoral Innovation Found of Air Force Engineering University(KGD08101604)
文摘Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the near future. On the basisof analyzing the structure of the MCAV/UCAV cooperative engage-ment system, this paper divides the unique system into three hi-erarchical levels, respectively, i.e., mission level, task-cluster leveland task level. To solve the formation and adjustment problem ofthe latter two levels, three corresponding mathematical modelsare established. To solve these models, three algorithms calledquantum artificial bee colony （QABC） algorithm, greedy strategy（GS） and two-stage greedy strategy （TSGS） are proposed. Finally,a series of simulation experiments are designed to verify the effec-tiveness and superiority of the proposed algorithms.
基金supported by the National Natural Science Foundation of China (60873069 61171132)+3 种基金the Jiangsu Government Scholarship for Overseas Studies (JS-2010-K005)the Funding of Jiangsu Innovation Program for Graduate Education (CXZZ11 0219)the Open Project Program of Jiangsu Provincial Key Laboratory of Computer Information Processing Technology (KJS1023)the Applying Study Foundation of Nantong (BK2011062)
文摘Particle swarm optimization （PSO） is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been proven that computing minimal reduc- tion of decision tables is a non-derterministic polynomial （NP）-hard problem. A new cooperative extended attribute reduction algorithm named Co-PSAR based on improved PSO is proposed, in which the cooperative evolutionary strategy with suitable fitness func- tions is involved to learn a good hypothesis for accelerating the optimization of searching minimal attribute reduction. Experiments on Benchmark functions and University of California, Irvine （UCI） data sets, compared with other algorithms, verify the superiority of the Co-PSAR algorithm in terms of the convergence speed, efficiency and accuracy for the attribute reduction.
基金supported by the National Natural Science Foundation of China(61503407,61806219,61703426,61876189,61703412)the China Postdoctoral Science Foundation(2016 M602996)。
文摘The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.
基金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.
基金supported by the National High Technology Research and Development Program of China(863 Program)(2014AA2649)
文摘In order to efficiently mitigate error propagation and reduce computational complexity, this paper proposes a scheme for traditional cooperative networks, named as dual-threshold symbol selective demodulate-and-forward. In the scheme, two log likelihood ratio(LLR)-based thresholds are devised to measure the reliability of received signals for the relay and the destination, respectively. One of the threshold guarantees that the relay only forwards reliable symbols, thus less error will be propagated to the destination. The other threshold is used at the destination for determining the reliability of symbols received from the source.The destination will directly demodulate reliable symbols received from the source. Otherwise, when the symbols received from the source are not reliable, the maximum ratio combiner(MRC) is used to combine symbols received from the source and the relay.Closed-form expression of the bit error probability(BEP) of the proposed scheme is derived and analyzed under binary phase shift keying(BPSK) modulation. Then, the relationship and closed-form solutions of two LLR-based thresholds are derived. Simulation results prove that the theoretical BEP of the proposed scheme closely matches the simulated ones. The proposed scheme can achieve high performance with low computational complexity compared to existing schemes.
基金supported by the National Natural Science Foundation of China (61903036, 61822304)Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100)。
文摘Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably.
基金the Aeronautical Science Foundation of China(2020Z023053001).
文摘This paper studies a special defense game using unmanned aerial vehicle(UAV)swarm against a fast intruder.The fast intruder applies an offensive strategy based on the artificial potential field method and Apollonius circle to scout a certain destination.As defenders,the UAVs are arranged into three layers:the forward layer,the midfield layer and the back layer.The co-defense mechanism,including the role derivation method of UAV swarm and a guidance law based on the co-defense front point,is introduced for UAV swarm to co-detect the intruder.Besides,five formations are designed for comparative analysis when ten UAVs are applied.Through Monte Carlo experiments and ablation experiment,the effectiveness of the proposed co-defense method has been verified.
