Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Dynamic allocation method for confrontation units

A technology of dynamic allocation and units, applied in neural learning methods, biological neural network models, design optimization/simulation, etc., can solve problems such as mission failure, shooting down, and solidification of combat unit allocation modes, and achieve a wide range of applications

Active Publication Date: 2021-03-09
中国人民解放军军事科学院评估论证研究中心 +1
View PDF8 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In order to simplify the control, the current grouping is generally a fixed group designated in advance. The fixed grouping has relatively large disadvantages. For example, some of them use a red unit as a group. During this mission, the attacking unit of the blue team may be shot down, and if only one red team is sent to perform this mission, it will still be shot down, resulting in the failure of the mission
In some cases, multiple red units form a group, and the number of red units in each group is the same. At this time, the members of the group when passing through the area with strong firepower of the blue side are the same as the members of the group when passing through the area with weak firepower of the blue side. cannot be done effectively
Generally speaking, in the current digital simulation battlefield, the allocation mode of confrontation units is relatively fixed, and corresponding strategies cannot be adopted according to changes in the external environment

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Dynamic allocation method for confrontation units
  • Dynamic allocation method for confrontation units
  • Dynamic allocation method for confrontation units

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0021] Embodiment 1: A dynamic allocation method for adversarial units.

[0022] In the digital battlefield environment, there are two opposing parties. The following describes the dynamic allocation method of opposing units provided by the embodiment of the present invention by taking the red team as one of the opposing parties and the blue team as the other opposing party as an example. figure 1 A schematic diagram of a neural network structure for implementing a method for dynamic allocation of confrontation units provided by an embodiment of the present invention.

[0023] see figure 2 , an embodiment of the present invention provides a dynamic allocation method for confrontation units, which is used in a digital battlefield environment, and the method includes the following steps:

[0024] Step S1, obtain confrontation information in the digital battlefield environment, the confrontation information includes: attribute information of n confrontation units, attribute inf...

Embodiment 2

[0058] Embodiment 2: An apparatus for dynamic allocation of adversarial units using the allocation method of Embodiment 1.

[0059] The embodiment of the present invention provides a dynamic allocation device for confrontation units, which is used in a digital battlefield environment, which includes: an acquisition module, a preprocessing module, an output module, a sampling module and a circulation module.

[0060] Specifically, the acquisition module is used to acquire confrontation information in the digital battlefield environment. The confrontation information includes: attribute information of n confrontation units, attribute information of several attacking units, and attribute information of several target units, and the confrontation unit is used to execute The adversarial task belongs to one of the opposing parties, the attacking unit is used to hinder the adversary unit from performing the adversarial task, both the attacking unit and the target unit belong to the ot...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a dynamic allocation method for confrontation units, and the method specifically comprises the steps: obtaining confrontation information in a digital battlefield environment,and preprocessing the confrontation information to obtain preprocessing information, using a trained recurrent neural network model for processing the grouping start vector as the initial state and the preprocessing information as the initial input to obtain first-step output, and using the attention model for processing the attribute information of the first-step output and the n adversarial units and the grouping end vector of the grouping end unit; sampling the normalization result according to a preset random sampling rule to obtain a sampling result; and repeating the above steps until the sampling result of this time is a component corresponding to the grouping ending unit. The grouping information obtained by the method is closer to the digital battlefield environment, is beneficialto completing confrontation tasks, and can adapt to the change of the situation of the digital battlefield.

Description

technical field [0001] The invention belongs to the technical field of digital battlefield simulation, and in particular relates to a dynamic allocation method for confrontation units. Background technique [0002] In the digital simulation battlefield environment, there are two opposing sides, and one of the opposing sides will launch a confrontation task against the other. In order to complete the confrontation task, the party will group its own units that can perform the confrontation task, generally divided into several groups, and members of the same group will perform the same or similar actions. In the following, the grouping is explained by taking the red team as one of the opposing parties and the blue team as the other opposing team. [0003] When the confrontation task is to penetrate the defense, the red team will often send several fighter jets to penetrate the defense at the same time; when the confrontation task is to approach and reconnaissance the blue team...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F30/27G06N3/02G06N3/08
CPCG06N3/02G06N3/08G06F30/27
Inventor 马贤明齐智敏张海林王全东黄谦陈敏皮雄军高和顺
Owner 中国人民解放军军事科学院评估论证研究中心
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products