Multi-UCAV on-line striking target allocation method of opposition-based genetic algorithm(GA)

A technology of target assignment and genetic algorithm, applied in the field of aircraft mission planning, which can solve the problems of long time consumption and low convergence

Active Publication Date: 2016-07-06
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to solve the problem of multi-UCAV online strike target allocation in modern weapon task planning, and to solve the problems of low convergence and lo

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
  • Multi-UCAV on-line striking target allocation method of opposition-based genetic algorithm(GA)
  • Multi-UCAV on-line striking target allocation method of opposition-based genetic algorithm(GA)
  • Multi-UCAV on-line striking target allocation method of opposition-based genetic algorithm(GA)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] Suppose a flight formation has 8 UCAVs, attacking 4 known targets, and each UCAV can only attack one target at most. In the case of known theoretical optimal allocation results, the average number of model calls needed to obtain the optimal allocation results is calculated by using the genetic algorithm and the improved genetic algorithm based on the opposite idea respectively. The current coordinates of all UCAVs and targets are shown in Table 1, and the schematic diagram is shown in figure 2 As shown, the speed of UCAV is set to 1. From left to right, the numbers of UAVs are 1-8, and the numbers of targets are 1-4. Obviously, the optimal distribution of weapon targets is 4→1, 5→2, 6→3, 7→4, that is, the optimal individual is (3456).

[0062] The current position of UCAV and target in the first embodiment of table 1

[0063]

[0064] Using the improved genetic algorithm based on the opposite idea to deal with the multi-UCAV online target allocation problem, the ...

Embodiment 2

[0077] In real situations, it is very time-consuming to obtain the optimal allocation of weapon targets through theoretical calculations, and it is difficult to meet the real-time requirements of battlefield decision-making. Therefore, when the theoretical optimal allocation results are unknown, set the maximum model The number of calls is 2000 times. The method of the present invention and the customized GA are used to solve the multi-UCAV online target allocation problem respectively, and the calculation results of the two are compared. Assuming that a flight formation has 8 UCAVs and attacks 4 known targets, each UCAV can only attack one target at most. The current positions of UCAVs and targets are shown in Table 3.

[0078] The current position of UCAV and target in the embodiment two of table 3

[0079]

[0080] Using the improved genetic algorithm based on the opposite idea to deal with the multi-UCAV online target allocation problem, the specific implementation steps ...

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 provides a multi-UCAV on-line striking target allocation method of an opposition-based genetic algorithm(GA). The multi-UCAV on-line striking target allocation method is characterized in that design variables capable of satisfying the constraint of the multi-UCAV on-line striking target allocation method of unequal dimension values can be designed, and the customized improvement of the standard genetic algorithm can be carried out by aiming at the multi-UCAV on-line striking target allocation problem, and then the opposition idea can be introduced into the genetic operation, and the diversity of the population can be increased. The method provided by the invention is advantageous in that the opposition idea processing mechanism and the genetic algorithm can be combined together, and the problems of the conventional algorithm such as locally optimal solution and long time during the solution process can be prevented, and therefore the provided method has the strong global convergence capability, and the problem of the prior art of the low efficiency during the solution of the multi-UCAV on-line striking target allocation can be solved.

Description

technical field [0001] The invention relates to a multi-UCAV online strike target allocation method based on an improved genetic algorithm based on the opposite idea, belonging to the field of aircraft task planning. Background technique [0002] Facing the increasingly complex modern battlefield environment, battlefield tasks are gradually developing into multiple and complex situations. A single unmanned combat aircraft (unmanned combat aerial vehicle, UCAV) can hardly complete the assigned combat missions, and multiple unmanned combat aircraft (UCAV) cooperate with each other. It has become an inevitable choice for UCAV combat use. The multi-UCAV online strike target allocation problem is the guarantee and basis for multi-UCAV cooperative operations. Its purpose is to assign attack targets for UCAV. It is a high-tech developed with modern information technology and is an important content of multi-UCAV mission planning technology research. One is a typical Weapon-Target ...

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): G05B13/04
CPCG05B13/04
Inventor 刘莉温永禄龙腾王祝
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap