CN107229286A - Consider manual intervention nobody have man-machine formation information distribution processing method - Google Patents
Consider manual intervention nobody have man-machine formation information distribution processing method Download PDFInfo
- Publication number
- CN107229286A CN107229286A CN201710415402.1A CN201710415402A CN107229286A CN 107229286 A CN107229286 A CN 107229286A CN 201710415402 A CN201710415402 A CN 201710415402A CN 107229286 A CN107229286 A CN 107229286A
- Authority
- CN
- China
- Prior art keywords
- bit stream
- mrow
- mission bit
- node
- mandatory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000009826 distribution Methods 0.000 title claims abstract description 86
- 230000015572 biosynthetic process Effects 0.000 title claims abstract description 20
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 37
- 238000005457 optimization Methods 0.000 claims abstract description 23
- 230000002068 genetic effect Effects 0.000 claims abstract description 20
- 210000000349 chromosome Anatomy 0.000 claims description 99
- 238000012545 processing Methods 0.000 claims description 37
- 108090000623 proteins and genes Proteins 0.000 claims description 29
- 238000004891 communication Methods 0.000 claims description 27
- 230000005540 biological transmission Effects 0.000 claims description 16
- 239000007787 solid Substances 0.000 claims description 9
- 230000035772 mutation Effects 0.000 claims description 7
- 238000012804 iterative process Methods 0.000 claims description 6
- 230000002759 chromosomal effect Effects 0.000 claims description 4
- 230000000763 evoking effect Effects 0.000 claims description 2
- 208000026686 chromosomal inheritance Diseases 0.000 claims 2
- 238000013519 translation Methods 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 8
- 150000001875 compounds Chemical class 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000001174 ascending effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 229940079593 drug Drugs 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000004043 dyeing Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000002834 transmittance Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/10—Simultaneous control of position or course in three dimensions
- G05D1/101—Simultaneous control of position or course in three dimensions specially adapted for aircraft
- G05D1/104—Simultaneous control of position or course in three dimensions specially adapted for aircraft involving a plurality of aircrafts, e.g. formation flying
Landscapes
- Engineering & Computer Science (AREA)
- Aviation & Aerospace Engineering (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
There is man-machine formation information distribution processing method the present invention relates to nobody of a kind of consideration manual intervention, this method includes：When the information to be distributed received is mandatory mission bit stream, interrupt model is called；Distribution and transitive attribute to each mandatory mission bit stream are initialized, and obtain initial solution；The current optimization aim of interrupt model is set to maximize to the distribution quantity of mandatory mission bit stream；Current interrupt model is solved, first scheme is obtained；Judge whether the distribution quantity of mandatory mission bit stream in first scheme is equal to the total quantity of mandatory mission bit stream in task pool；If so, being then set to the current optimization aim of interrupt model to minimize the total deadline for distributing mandatory mission bit stream, current interrupt model is solved using the second genetic algorithm, alternative plan is obtained.The present invention can have man-machine formation to receive multiple mandatory mission bit streams reasonably to be arranged to nobody, form optimal information distribution and translation sequence.
Description
Technical field
The present invention relates to nobody-have man-machine formation information processing technology field, more particularly, to one kind consider manual intervention
Nobody-have man-machine formation information distribution processing method.
Background technology
Nobody-there is man-machine formation to be performed in unison with task during, in the different stages to required information to be processed
Type, the quantity of information requirement, and the significance level of of information itself have certain difference, therefore have to mission bit stream
The distribution of effect from transmittance process, it is necessary to consider that mission bit stream may have different priority levels.Nobody-have man-machine coordination
Perform in task process, have a generic task information due to the timing requirements of itself, significance level or be entirely performed in unison with
Played a key effect in task process, it is necessary to nobody-have and be distributed processing immediately in man-machine system, can be by this generic task
Referred to as mandatory task, and by mandatory task nobody-have and be considered as priority level highest during man-machine cotasking
Task.
At present, nobody-there is man-machine formation to be performed in unison with task process, when nobody-have man-machine fleet system while connecing
Multiple mandatory mission bit streams are received, not a kind of method can appoint to the distribution transmission of above-mentioned multiple mandatory mission bit streams
Business is reasonably arranged, and is formed optimal information and is distributed and translation sequence.
The content of the invention
(1) technical problem solved
The present invention provide it is a kind of consider manual intervention nobody-have man-machine formation information distribution processing method, can be to strong
Property mission bit stream processed is reasonably arranged, as far as possible on the distribution to mandatory mission bit stream and the maximized basis of transmission quantity
The upper time for realizing distribution and transmission minimizes, it is to avoid to unmanned plane and having man-machine work compound to occasion a delay.
(2) technical scheme
The consideration manual intervention that the present invention is provided nobody-there is man-machine formation information distribution processing method to include：
Nobody-information to be distributed that receives of the task pool that has man-machine formation be mandatory mission bit stream when, call pre-
The interrupt model first set up；
The distribution of each mandatory mission bit stream is initialized with transitive attribute using coding method, initial solution is obtained；
The current optimization aim of the interrupt model is set to maximize mandatory task letter under default constraints
The distribution quantity of breath；And based on the initial solution, current interrupt model is solved using the first genetic algorithm, obtain pair
The first scheme of mandatory mission bit stream distribution and transmission；
Judge whether the distribution quantity of mandatory mission bit stream in the first scheme is mandatory equal in the task pool
The total quantity of mission bit stream；
If so, being then set to minimize distribution under the default constraints by force by the current optimization aim of interrupt model
Total deadline of property mission bit stream processed, current interrupt model is solved using the second genetic algorithm, obtained to forcing
Property mission bit stream distribution with transmission alternative plan；
The mandatory mission bit stream in task pool is distributed and transmitted according to the alternative plan.
Optionally, distribution of the use coding method to each mandatory mission bit stream is initialized with transitive attribute, is obtained
To initial solution, including：
Using coding method by the solution of the interrupt model be encoded on chromosome, the chromosome include with task pool
The one-to-one gene of mandatory mission bit stream to be distributed；
First mark of each gene on chromosome is set to 1, the first mark for being set to 1 characterizes the corresponding pressure of the gene
Property mission bit stream can be distributed and transmit；
The destination node of each mandatory mission bit stream is obtained, and for the generation one at random of each mandatory mission bit stream
The source node different from its destination node；
Judge whether each mandatory mission bit stream needs forwarding；Mandatory mission bit stream for needing forwarding, at random
Multiple different forward node are generated, forward-path is formed；For the mandatory mission bit stream that need not be forwarded, section is forwarded
Point is set to -1；
Read the time window of each mandatory mission bit stream；For each mandatory mission bit stream, in the time window
One moment point of interior random generation, and at the time of using the moment point as mandatory mission bit stream arrival destination node；It is right
In the mandatory mission bit stream for needing to forward, mandatory mission bit stream is extrapolated according to forward-path and reaches each forward node
Moment and from source node send at the time of；For the mandatory mission bit stream that need not be forwarded, mandatory task letter is extrapolated
Breath from source node send at the time of, and the forwarding moment of each forward node is set to -1；
By the first mark of each mandatory mission bit stream, source node, forward node, destination node, send from source node
Moment, distribution at the time of reach each forward node and at the time of reaching the destination node as the mandatory mission bit stream
With transitive attribute, distribution and the transitive attribute formation initial solution of each mandatory mission bit stream.
Optionally, circulation is performed and current interrupt model is solved using the first genetic algorithm, described first is judged
Whether the distribution quantity of mandatory mission bit stream is equal to the behaviour of the total quantity of mandatory mission bit stream in the task pool in scheme
Make and judge whether cycle-index reaches the operation of preset times, until solving mandatory task in the first scheme after operation
The total quantity or cycle-index that the distribution quantity of information is equal to mandatory mission bit stream in the task pool reach preset times；
If cycle-index reaches the preset times, the first scheme after operation is solved to task pool according to last time
In mandatory mission bit stream be distributed and transmit.
Optionally, it is described that current interrupt model is solved using the first genetic algorithm, including：
By to maximize the distribution quantity of mandatory mission bit stream as the object function of the interrupt model of current optimization aim
As current fitness function, the fitness function value of chromosome in population is calculated；
The chromosome of fitness function value highest predetermined number in being selected using roulette wheel selection from parent colony
It is genetic in progeny population；
Single-point crossover operation two-by-two is carried out to the chromosome in population；
The chromosome obtained to crossover operation carries out resetting variation processing；
First is carried out to the chromosome that replacement variation processing is obtained and updates operation, specially by fitness in progeny population most
The chromosomal of the second minimum predetermined number of fitness in the chromosome and progeny population of the first low predetermined number, is formed
New population；
It regard the corresponding solution of the new population as the first scheme.
Optionally, before described pair resets chromosome progress the first renewal operation that variation processing is obtained, methods described
Also include：To resetting whether the corresponding distribution of gene on the chromosome after variation processing meets the default constraint with transitive attribute
Condition；
If so, then performing described first updates operation；
Otherwise, perform described first after being adjusted to the fitness function value for resetting variation processing after stain colour solid and update behaviour
Make.
Optionally, the chromosome obtained to crossover operation carries out resetting variation processing, including：
A random number between 0 and 1 is generated, if the random number is less than default mutation probability, according to institute
State the generation method generation item chromosome of initial solution；
Randomly choose item chromosome in progeny population, and with the chromosome of the generation according to the initial solution substitute with
The chromosome of machine selection, other chromosomes keep constant.
Optionally, it is described that current interrupt model is solved using the second genetic algorithm, including multiple iterative process,
Until iterations reaches preset times, the corresponding solution of final population is regard as the alternative plan；
Wherein, each iterative process includes：
The mesh of interrupt model of the total deadline of mandatory mission bit stream as current optimization aim will be distributed to minimize
Scalar functions calculate the fitness function value of chromosome in population as current fitness function；
The chromosome of fitness function value highest predetermined number in being selected using roulette wheel selection from parent colony
It is genetic in progeny population；
Single-point crossover operation two-by-two is carried out to the chromosome in population；
The chromosome obtained to crossover operation carries out deleting forward node variation processing；
The chromosome obtained to deleting forward node variation processing carries out second and updates operation, is specially by progeny population
The chromosome of the predetermined number of fitness highest second in the chromosome and progeny population of the predetermined number of fitness highest first
Combination, forms new population.
Optionally, the chromosome obtained to crossover operation carries out deleting forward node variation processing, including：
A random number between 0 and 1 is generated, if the random number is less than default mutation probability, random choosing
A gene in chromosome is selected, and the forward node of the corresponding mandatory mission bit stream of randomly selected gene is set to -1,
And it is set to -1 at the time of mandatory mission bit stream is reached into each forward node.
Optionally, before described pair is deleted chromosome progress the second renewal operation that forward node variation processing is obtained,
Methods described also includes：
To deleting whether the corresponding distribution of gene on the chromosome after forward node variation processing meets institute with transitive attribute
State default constraints；
If so, then performing described second updates operation；
Otherwise, performed after being adjusted to the fitness function value for deleting the chromosome after forward node variation processing described
Second updates operation.
Optionally, the interrupt model using maximized under default constraints the distribution quantity of mandatory mission bit stream as
Currently the object function of optimization aim is：
In formula, F1 is the distribution quantity of mandatory mission bit stream；T represents any one information to be distributed, TaRepresent to force
Property mission bit stream；Decision variable1 or 0 is taken, takes 1 expression information t to be distributed to be sent to node j from node i, takes 0 to represent to treat point
Photos and sending messages t is not sent to node j from node i.
Optionally, the interrupt model distributes the total of mandatory mission bit stream to be minimized under the default constraints
Deadline is that the object function of current optimization aim is：
In formula, F2 is the total deadline for distributing mandatory mission bit stream；T represents any one information to be distributed, TaTable
Show mandatory mission bit stream；Decision variable1 or 0 is taken, takes 1 expression information t to be distributed to be sent to node j from node i, takes 0 table
Show that information t to be distributed is not sent to node j from node i；V={ 1,2 ..., m } represents communication network topology interior joint set, m tables
Show communication network topology total node number；Represent that information t to be distributed is delivered to the propagation delay time of node j generations from node i；
Represent that information t to be distributed is delivered to the propagation delay of node j generations from node i；NaFor mandatory mission bit stream in task pool
Quantity.
Optionally, the default constraints includes：
ETt≤lt,t∈Ta
ETt≥et,t∈Ta
ETt-STt≤D,t∈Ta
In formula, ETtAt the time of representing that information t to be distributed is actually reached information sink；STtRepresent information t to be distributed from information source
Actually start delivery time；V={ 1,2 ..., m } represents communication network topology interior joint set, and m represents that communication network topology is total
Nodes；Represent that information t to be distributed is delivered to the propagation delay time of node j generations from node i；Represent information t to be distributed from
Node i is delivered to the propagation delay of node j generations；TaRepresent mandatory mission bit stream；ltRepresent that information t to be distributed is reached at the latest
The time of information sink；etRepresent information t to be distributed earliest information sink arrival times；D represents acceptable in communication network topology
Maximum delay；TWtRepresent the bandwidth required for information t to be distributed；NWijRepresent directed edge in communication network topology<i,j>Institute's energy
The maximum bandwidth born；BvThe maximum amount of data that node v can be provided is represented, v represents any node in communication network topology,
v∈V；Decision variable1 or 0 is taken, wherein, take 1 expression information t to be distributed to be sent to node j from node i, take 0 expression to be distributed
Information t is not sent to node j from node i.
(3) beneficial effect
The consideration manual intervention that the present invention is provided nobody-have man-machine formation information distribution processing method, first with maximum
The distribution quantity for changing mandatory mission bit stream is optimization aim, after the target is realized, then distributes mandatory task to minimize
Total deadline of information is target, realizes and all distributions are carried out to mandatory mission bit stream with being realized immediately on the basis of transmission
Distribution and transmission, it is ensured that mission bit stream it is ageing, it is to avoid to unmanned plane and thering is man-machine work compound to occasion a delay.
Brief description of the drawings
, below will be to embodiment or existing in order to illustrate more clearly of the embodiment of the present disclosure or technical scheme of the prior art
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some disclosed embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these figures.
Fig. 1 show in one embodiment of the invention consider manual intervention nobody-have man-machine formation information distribution processor side
The part schematic flow sheet of method；
Fig. 2 shows the schematic diagram of the chromosome that one is made up of 5 genes in one embodiment of the invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present disclosure, the technical scheme in the embodiment of the present disclosure is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the disclosure, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of disclosure protection.
In a first aspect, the present invention provide it is a kind of consider manual intervention nobody-have man-machine formation information distribution processing method,
As shown in figure 1, including：
S1, the information to be distributed that task pool is received be mandatory mission bit stream when, call the interruption mould pre-established
Type；
It will be appreciated that so-called mandatory mission bit stream is, it is necessary to vertical in whole collaborative processes with key effect
The mission bit stream performed.For example：Strike mission, the integrated task of scouting attack, firepower assess task.Appoint performing attack
When business, scouting attack integration task, unmanned plane will be seen that the target information of attack and photograph the information such as image and transmits immediately
It is man-machine to having, then by there is man-machine commander's unmanned plane of issuing an order to go to perform attack strike.Firepower assesses task and is divided into firepower guiding
School is penetrated to be assessed with Strike.It is to enter Strike target area using unmanned plane that firepower guiding school, which is penetrated, shoots respective regions
Image information, is transferred to commander and assists observation point of impact, amendment shooting departure, improves Strike accuracy, reduction bullet
Medicine is consumed.After Strike assessment refers to that early stage strike terminates, unmanned plane enters Strike target area, and help is observed firepower and beaten
Effect is hit, important evidence is provided for lower walking is dynamic.
Wherein, interrupt model can also be referred to as BRE-IDD models.
S2, the distribution using coding method to each mandatory mission bit stream and transitive attribute are initialized, and obtain initial solution；
S3, the current optimization aim of the interrupt model is set to maximize mandatory task under default constraints
The distribution quantity of information；And based on the initial solution, current interrupt model is solved using the first genetic algorithm, obtained
First scheme with transmitting is distributed to mandatory mission bit stream；
It will be appreciated that the target of Current interrupt model is to maximize mandatory mission bit stream under default constraints
Distribute quantity.
S4, judge mandatory mission bit stream in the first scheme distribution quantity whether be equal to the task pool in force
The total quantity of property mission bit stream；
S5, if so, then by the current optimization aim of interrupt model be set under the default constraints minimize point
The total deadline for sending out mission bit stream mandatory, current interrupt model is solved using the second genetic algorithm, obtained pair
The alternative plan of mandatory mission bit stream distribution and transmission；
If it will be appreciated that the distribution quantity of mandatory mission bit stream is mandatory equal in the task pool in first scheme
The total quantity of mission bit stream, illustrates to realize the target for the distribution quantity for maximizing mandatory mission bit stream, will now interrupt mould
The optimization aim of type is set to minimize total deadline of the mandatory mission bit stream of distribution, that is, is realizing mandatory of maximization
On the basis of the distribution quantity for information of being engaged in, strive for realizing the total deadline for minimizing the mandatory mission bit stream of distribution.
S6, according to the alternative plan the mandatory mission bit stream in task pool is distributed and transmitted.
The information distribution processing method that the present invention is provided, first to maximize the distribution quantity of mandatory mission bit stream to be excellent
Change target, after the target is realized, then using total deadline of the mandatory mission bit stream of minimum distribution as target, realize to strong
Property mission bit stream processed carries out all distributions with realizing distribution immediately and transmission on the basis of transmission, it is ensured that the timeliness of mission bit stream
Property, it is to avoid to unmanned plane and thering is man-machine work compound to occasion a delay.
To make it clear, being illustrated below to the parameters of formula being related in various：
Represented herein with digraph G (V, E, W) unmanned plane/have it is man-machine between all available communication network topologies, will
Unmanned plane/have the man-machine node being described as in communication network topology, concrete model parameter is as follows：
V={ 1,2 ..., m } represents communication network topology interior joint set, and m represents communication network topology total node number.
E=<i,j>| i, j ∈ V, i ≠ j } oriented line set is represented, wherein<i,j>Represent communication network topology interior joint i
To node j directed edge；
W={ wij| i, j ∈ V } represent figure in every directed edge weights set, wherein wiJ represent node i to node j it
Between Euclidean distance.
BvThe maximum amount of data that node v can be provided is represented, wherein, v represents any node in communication network topology, v
∈V；
T represents information aggregate to be distributed, and n represents the number of element in set, and t represents any one information to be distributed, t ∈
T；Wherein TaRepresent mandatory mission bit stream, TbRepresent importance level information, TcRepresent general level information, TdRepresent low priority letter
Breath；
[et,lt] represent that information t to be distributed needs to reach information sink, e in this time windowtRepresent earliest arrival time, lt
Represent arrival time at the latest；
STtRepresent information t to be distributed delivery time, ET since information source is actualtRepresent that information t to be distributed is actually reached
At the time of information sink；
SNtRepresent information t to be distributed actual information source, ENtExpression needs to receive information t to be distributed information sink；
Represent that information t to be distributed is delivered to the propagation delay time of node j generations from node i；Represent information t to be distributed
The propagation delay of node j generations is delivered to from node i；
D represents acceptable maximum delay in communication network topology；
TWtRepresent the bandwidth required for information t to be distributed；
NWijRepresent directed edge in communication network topology<i,j>The maximum bandwidth that can bear；
PtRepresent information t to be distributed priority, Pt=1 represents low priority task, Pt=2 represent general level task, Pt
=3 represent importance level task, Pt=4 represent interrupt class task；
HtRepresent obtainable income after completion information t to be distributed task；
GtRepresent information t to be distributed weighted value；
CtRepresent information t to be distributed issuable disturbance cost；
Decision variable1 or 0 is taken, wherein, take 1 expression information t to be distributed to be sent to node j from node i, take 0 expression to treat
Distribution information t is not sent to node j from node i.
In the specific implementation, the object function of the interrupt model called in S1 can be represented with following formula (1)：
Wherein, MaxF1 is the distribution quantity for maximizing mandatory mission bit stream；MinF2 distributes mandatory to minimize
The total deadline for information of being engaged in, in the different stages, using different object functions, realize different optimization aims.
In the specific implementation, calling the default constraints of interrupt model can be arranged as required to, such as time window
Constraint, delay constraint, bandwidth constraint, information source constraint, access unique constraints etc., wherein so-called time windows constraints are mandatory
Mission bit stream need to be completed in preset time window distribution transmission, delay constraint for the mandatory mission bit stream propagation delay time and
Propagation delay is no more than the maximum delay of communication network topology, and bandwidth constraint is the pressure that can transmit simultaneously in communication link
Property mission bit stream data volume sum is without departing from the maximum bandwidth that communication network topology can bear, and information source is constrained to information source and sent
Deliverability of the mandatory mission bit stream data volume without departing from information source, it is each mandatory task letter to access unique constraints
Cease only one of which information source, each mandatory mission bit stream only one of which information sink, the same pressure of any one node forwarding
Property mission bit stream number of times be less than or equal to 1.
Above-mentioned constraints can be represented using following formula：
Time windows constraints：
ETt≤lt,t∈Ta (3)
ETt≥et,t∈Ta (4)
Delay constraint：
ETt-STt≤D,t∈Ta (5)
Bandwidth constraint：
Information source is constrained：
Access unique constraints：
In addition,
In the specific implementation, it is initial using distribution and transitive attribute of the coding method to each mandatory mission bit stream in S2
Change, obtaining the process of initial solution can comprise the steps：
S21, the solution of the interrupt model is encoded on chromosome, the chromosome using coding method included and task
The one-to-one gene of mandatory mission bit stream to be distributed in pond；
It will be appreciated that the quantity of mandatory mission bit stream is identical with the number of gene on chromosome, a gene pairs should
One mandatory mission bit stream.
For example, the quantity n of information to be distributed is made into the intragentic quantity of chromosome, gene is by the way of multi-component system
Encoded, m represents the node total number amount in communication network topology, basic coded system is as follows：
Gene=(Flag, Node1,Node2,...,Nodem,Time1,Time2,…,Timem)
Wherein, Flag represents whether information to be distributed can be distributed, Node1,Node2,...NodemRepresent information to be distributed
The node passed through during forwarding, Node1Represent the information source of information to be distributed, NodemThe information sink of information to be distributed is represented,
Time1,Time2,…,TimemRepresent forwarding time of the information to be distributed in corresponding node, Time1Represent information to be distributed from letter
Breath source starts delivery time, TimemAt the time of representing that information border to be distributed reaches information sink.
S22, by chromosome each gene first mark be set to 1, be set to 1 first mark characterize the gene it is corresponding
Mandatory mission bit stream is that can be distributed and transmit；
It will be appreciated that the first mark here is above-mentioned Flag, the first mark is set to the corresponding pressure of 1 mark
Property mission bit stream can be allocated and transmit.
S23, the destination node Node for obtaining each mandatory mission bit streamm, and for each mandatory mission bit stream with
Machine generates a source node Node different from its destination node1；
It will be appreciated that because destination node is different from source node, therefore Node1≠Nodem。
S24, judge each mandatory mission bit stream whether need forwarding；For the mandatory mission bit stream for needing to forward,
Multiple different forward node are generated at random, form forward-path；For the mandatory mission bit stream that need not be forwarded, by its turn
Hair node is set to -1；
It will be appreciated that for the mandatory mission bit stream that need not be forwarded, making Node2=Node3=...=Nodem-1
=-1.
It will be appreciated that for the mandatory mission bit stream for needing to forward, random forwarding number of times c<=m-2, will give birth at random
Into c forward node number record to Node2…,Nodem-1, and ensure Node1 ≠ Node2≠…≠Nodem。
S25, the time window for reading each mandatory mission bit stream；For each mandatory mission bit stream, when described
Between one moment point of generation at random in window, and using the moment point as the mandatory mission bit stream reach the destination node when
Carve；For the mandatory mission bit stream for needing to forward, mandatory mission bit stream is extrapolated according to forward-path and reaches each forwarding
At the time of node and from source node send at the time of；For the mandatory mission bit stream that need not be forwarded, extrapolate mandatory
Mission bit stream from source node send at the time of, and the forwarding moment of each forward node is set to -1；
S26, by the first mark of each mandatory mission bit stream, source node, forward node, destination node, from source node send out
As the mandatory mission bit stream at the time of going out, at the time of reach each forward node and at the time of reaching the destination node
Distribution and transitive attribute, distribution and the transitive attribute formation initial solution of each mandatory mission bit stream.
For example, as shown in Fig. 2 forming a chromosome by 5 genes, by taking first gene as an example, (1,1, -1,
2,9.5, -1,12.5) represent that the information source for being 1 from numbering of first information to be distributed is sent to the information sink that numbering is 2, it is middle
Without forwarding.The transmission time be the 9.5th second arrival time be the 10.5th second.
In the specific implementation, the above-mentioned S3 and S4 of execution can be circulated, after S4 has been performed every time, to performing whether number of times reaches
Judged to preset times, that is to say, that circulation perform current interrupt model is solved using the first genetic algorithm,
Judge whether the distribution quantity of mandatory mission bit stream in the first scheme is equal to mandatory mission bit stream in the task pool
Total quantity operation and judge whether cycle-index reaches the operation of preset times, until solve operation after first scheme
In mandatory mission bit stream distribution quantity be equal to the task pool in mandatory mission bit stream total quantity or cycle-index
Reach preset times；If cycle-index reaches the preset times, the first scheme pair after operation is solved according to last time
Mandatory mission bit stream in task pool is distributed and transmitted.
It will be appreciated that circulation performs S3, S4, if the judged result in S4 is yes, S5 is performed, using what is obtained in S5
Alternative plan is distributed and transmitted to mandatory mission bit stream；If if the judged result in S4 is no, judging to perform S3's
Whether number of times reaches preset times, if being not reaching to preset times, and S3, S4 are performed again；If having reached preset times, move back
Go out circulation, the first scheme obtained during last time is circulated is distributed and passed to mandatory mission bit stream as final scheme
Pass.Here by way of circulation or iteration, fitness highest chromosome is finally searched out as optimal solution.
In the specific implementation, the process solved in S3 using the first genetic algorithm to current interrupt model can be wrapped
Include：
S31, by maximize the distribution quantity of mandatory mission bit stream as the target of the interrupt model of current optimization aim
Function calculates the fitness function value of chromosome in population as current fitness function；
It will be appreciated that can be by fitness function fitness=Z*Count+ (1-Z) * Time, wherein Z is between 0 He
Variable between 1.As Z=1, interrupt model is to maximize the distribution quantity of mandatory mission bit stream as current optimization aim；
As Z=0, interrupt model distributes total deadline of mandatory mission bit stream to minimize as optimization aim.In S3, Z=
1.Count is the total quantity of mandatory mission bit stream in task pool, and Time transmits the total of mandatory mission bit stream to complete distribution
Time sum.
S32, selected using roulette wheel selection from parent colony in fitness function value highest predetermined number dye
Colour solid is genetic in progeny population；
It will be appreciated that the basic thought of so-called roulette wheel selection is：The selected probability of each chromosome is fitted with it
Response functional value size is directly proportional.The fitness function value fitness of chromosome is calculated according to fitness function, dyeing is calculated
Ratio relativefitness=fitness./sum shared by individual fitness summation of the body individual in population
(fitness), as be selected heredity to follow-on probability, ratio is bigger, then be chosen heredity to follow-on probability just
It is bigger.
S33, single-point crossover operation two-by-two is carried out to the chromosome in population；
It will be appreciated that using single-point interleaved mode, that is, a crosspoint is randomly generated, successively will be two neighboring in population
The part that chromosome is located at after the point is exchanged with each other, and generates two new chromosomes
S34, the chromosome obtained to crossover operation carry out resetting variation processing；
S35, the chromosome obtained to resetting variation processing carry out first and update operation, are specially that will be adapted in progeny population
The chromosomal of the second minimum predetermined number of fitness in the chromosome and progeny population of the first minimum predetermined number of degree,
Form new population；
For example, the progeny population after variation is arranged by the ascending order of fitness value, SonNum dye before taking out
Colour solid, is arranged by the descending of fitness value parent colony, FatherNum chromosome after taking-up, constitutes new population.
S36, it regard the corresponding solution of the new population as the first scheme.
Here, by the operation such as being selected chromosome, being intersected, made a variation, it regard obtained chromosome as first scheme.
In the specific implementation, can also be to resetting the corresponding distribution of gene on the chromosome after variation processing before S35
The default constraints whether is met with transitive attribute；
If so, then performing described first updates operation；
Otherwise, perform described first after being adjusted to the fitness function value for resetting variation processing after stain colour solid and update behaviour
Make.
Need to meet the constraint such as the bandwidth of communication network topology, time delay, time window and information source in view of information to be distributed,
Therefore constraint checking also is carried out to chromosome here.For failing the chromosome by constraint checking, in its fitness function value
On increase on demand or subtract penalty factor, degree of adapting it to functional value diminishes or become greatly, is unsatisfactory in selection operation with removing
The chromosome of given constraint.
In the specific implementation, the process that the chromosome obtained in S34 to crossover operation reset variation processing can be wrapped
Include：
S341, one random number between 0 and 1 of generation, if the random number is less than default mutation probability, root
According to the generation method generation item chromosome Newchrom of the initial solution；
Wherein, default mutation probability is between zero and one.
S342, randomly choose item chromosome in progeny population, and with the chromosome of the generation according to the initial solution
Newchrom substitutes randomly selected chromosome, and other chromosomes keep constant.
In the specific implementation, carrying out solution to current interrupt model using the second genetic algorithm in above-mentioned S5 can include
Multiple iterative process, until iterations reaches preset times, regard the corresponding solution of final population as the alternative plan；Its
In, each iterative process includes：
S51, will be to minimize total deadline of the mandatory mission bit stream of distribution as the interrupt model of current optimization aim
Object function as current fitness function, calculate the fitness function value of chromosome in population；
It will be appreciated that in S5, Z=0.
S52, selected using roulette wheel selection from parent colony in fitness function value highest predetermined number dye
Colour solid is genetic in progeny population；
S53, single-point crossover operation two-by-two is carried out to the chromosome in population；
S54, the chromosome obtained to crossover operation carry out deleting forward node variation processing；
S55, the chromosome obtained to deleting forward node variation processing carry out second and update operation, are specially by filial generation group
In body in the chromosome and progeny population of the predetermined number of fitness highest first predetermined number of fitness highest second dye
Colour solid is combined, and forms new population.
For example, the progeny population after variation is arranged by the descending of fitness value, SonNum dye before taking out
Colour solid, is arranged by the ascending order of fitness value parent colony, FatherNum chromosome after taking-up, constitutes new population.
Here, by the operation such as being selected chromosome, being intersected, made a variation, it regard obtained chromosome as alternative plan.
Wherein, the chromosome obtained in S54 to crossover operation, which carries out the variation processing of deletion forward node, to be included：Generation
One random number between 0 and 1, if the random number is less than in default mutation probability, random selection chromosome
One gene, and the forward node of the corresponding mandatory mission bit stream of randomly selected gene is set to -1, and by mandatory
Business information is set to -1 at the time of reaching each forward node.
In the specific implementation, chromosome progress the second renewal operation that forward node variation processing is obtained is deleted at described pair
Before, methods described can also include：
To deleting whether the corresponding distribution of gene on the chromosome after forward node variation processing meets institute with transitive attribute
State default constraints；
If so, then performing described second updates operation；
Otherwise, performed after being adjusted to the fitness function value for deleting the chromosome after forward node variation processing described
Second updates operation.
Here, whether the corresponding distribution of gene and transitive attribute are judged to delete on the chromosome after forward node variation processing
Meet the default constraints, actually a kind of constraint checking, to ensure that the corresponding scheme of chromosome meets default constraint
Condition.
In summary, the present invention provide consideration manual intervention nobody-have man-machine formation information distribution processing method, can
Reasonably to be arranged mandatory mission bit stream, maximized as far as possible in the distribution to mandatory mission bit stream with transmission quantity
On the basis of realize that the time of distribution and transmission minimizes, it is to avoid to unmanned plane and thering is man-machine work compound to occasion a delay.
Finally it should be noted that：Various embodiments above is rather than right only to the technical scheme for illustrating embodiments of the invention
It is limited；Although embodiments of the invention are described in detail with reference to foregoing embodiments, the ordinary skill of this area
Personnel should be understood：It can still modify to the technical scheme described in foregoing embodiments, or to which part
Or all technical characteristic carries out equivalent substitution；And these modifications or replacement, do not make the essence disengaging of appropriate technical solution
The scope of each embodiment technical scheme of embodiments of the invention.
Claims (10)
1. it is a kind of consider manual intervention nobody-have man-machine formation information distribution processing method, it is characterised in that including：
Nobody-information to be distributed that there is the task pool in man-machine formation to receive be mandatory mission bit stream when, call in advance
The interrupt model of foundation；
The distribution of each mandatory mission bit stream is initialized with transitive attribute using coding method, initial solution is obtained；
The current optimization aim of the interrupt model is set to maximize mandatory mission bit stream under default constraints
Distribute quantity；And based on the initial solution, current interrupt model is solved using the first genetic algorithm, obtain to forcing
Property mission bit stream distribution with transmission first scheme；
Judge whether the distribution quantity of mandatory mission bit stream in the first scheme is equal to mandatory task in the task pool
The total quantity of information；
If so, it is mandatory that the current optimization aim of interrupt model then is set into the minimum distribution under the default constraints
Total deadline of mission bit stream, current interrupt model is solved using the second genetic algorithm, obtained to mandatory
The alternative plan of information of being engaged in distribution and transmission；
The mandatory mission bit stream in task pool is distributed and transmitted according to the alternative plan.
2. according to the method described in claim 1, it is characterised in that the use coding method is to each mandatory mission bit stream
Distribution and transitive attribute initialize, obtain initial solution, including：
The solution of the interrupt model, which is encoded on chromosome, the chromosome, using coding method is included and is treated in task pool point
The one-to-one gene of mandatory mission bit stream of hair；
By on chromosome each gene first mark be set to 1, be set to 1 first mark characterize the gene it is corresponding mandatory
Business information is that can be distributed and transmit；
The destination node of each mandatory mission bit stream is obtained, and one and its are generated at random for each mandatory mission bit stream
The different source node of destination node；
Judge whether each mandatory mission bit stream needs forwarding；For the mandatory mission bit stream for needing to forward, random generation
Multiple different forward node, form forward-path；For the mandatory mission bit stream that need not be forwarded, it is forwarded node and puts
For -1；
Read the time window of each mandatory mission bit stream；For each mandatory mission bit stream, in the time window with
Machine generates a moment point, and at the time of using the moment point as mandatory mission bit stream arrival destination node；For needing
The mandatory mission bit stream to be forwarded, at the time of extrapolating mandatory mission bit stream according to forward-path and reach each forward node
And from source node send at the time of；For the mandatory mission bit stream that need not be forwarded, extrapolate mandatory mission bit stream from
At the time of source node is sent, and the forwarding moment of each forward node is set to -1；
By the first mark of each mandatory mission bit stream, source node, forward node, destination node, from source node send at the time of,
Distribution as the mandatory mission bit stream and biography at the time of reaching each forward node and at the time of reaching the destination node
Attribute is passed, distribution and the transitive attribute formation initial solution of each mandatory mission bit stream.
3. according to the method described in claim 1, it is characterised in that
Circulation is performed and current interrupt model is solved using the first genetic algorithm, judges mandatory in the first scheme
The operation and judgement whether the distribution quantity of mission bit stream is equal to the total quantity of mandatory mission bit stream in the task pool are followed
Whether ring number of times reaches the operation of preset times, until solving the distribution number of mandatory mission bit stream in the first scheme after operation
The total quantity or cycle-index that amount is equal to mandatory mission bit stream in the task pool reach preset times；
If cycle-index reaches the preset times, the first scheme after operation is solved in task pool according to last time
Mandatory mission bit stream is distributed and transmitted.
4. according to the method described in claim 1, it is characterised in that described to use the first genetic algorithm to current interrupt model
Solved, including：
By using maximize the distribution quantity of mandatory mission bit stream as the interrupt model of current optimization aim object function as
Current fitness function, calculates the fitness function value of chromosome in population；
The chromosomal inheritance of fitness function value highest predetermined number in being selected using roulette wheel selection from parent colony
Into progeny population；
Single-point crossover operation two-by-two is carried out to the chromosome in population；
The chromosome obtained to crossover operation carries out resetting variation processing；
The chromosome obtained to resetting variation processing carries out first and updates operation, is specially that fitness in progeny population is minimum
The chromosomal of the second minimum predetermined number of fitness in the chromosome and progeny population of first predetermined number, is formed newly
Population；
It regard the corresponding solution of the new population as the first scheme.
5. method according to claim 4, it is characterised in that
Before described pair resets chromosome progress the first renewal operation that variation processing is obtained, methods described also includes：Counterweight
Put whether the corresponding distribution of gene on the chromosome after variation processing meets the default constraints with transitive attribute；If so,
Then perform described first and update operation；Otherwise, held after being adjusted to the fitness function value for resetting variation processing after stain colour solid
Row described first updates operation；
And/or, the chromosome obtained to crossover operation carries out resetting variation processing, including：Generation one between 0 and 1 it
Between random number, if the random number be less than default mutation probability, according to the generation method of the initial solution generate one
Chromosome；Randomly choose item chromosome in progeny population, and with the chromosome of the generation according to the initial solution substitute with
The chromosome of machine selection, other chromosomes keep constant.
6. according to the method described in claim 1, it is characterised in that described to use the second genetic algorithm to current interrupt model
Solved, including multiple iterative process, until iterations reaches preset times, it regard the corresponding solution of final population as institute
State alternative plan；
Wherein, each iterative process includes：
The target letter of interrupt model of the total deadline of mandatory mission bit stream as current optimization aim will be distributed to minimize
Number calculates the fitness function value of chromosome in population as current fitness function；
The chromosomal inheritance of fitness function value highest predetermined number in being selected using roulette wheel selection from parent colony
Into progeny population；
Single-point crossover operation two-by-two is carried out to the chromosome in population；
The chromosome obtained to crossover operation carries out deleting forward node variation processing；
The chromosome obtained to deleting forward node variation processing carries out second and updates operation, is specially that will be adapted in progeny population
The chromosomal of the predetermined number of fitness highest second in the chromosome and progeny population of the predetermined number of highest first is spent,
Form new population.
7. method according to claim 6, it is characterised in that
The chromosome obtained to crossover operation carries out deleting forward node variation processing, including：Generation one is between 0 and 1
Between random number, if the random number be less than default mutation probability, random selection chromosome in a gene, and will
The forward node of the corresponding mandatory mission bit stream of randomly selected gene is set to -1, and mandatory mission bit stream is reached into each
- 1 is set at the time of forward node；
And/or, before described pair is deleted chromosome progress the second renewal operation that forward node variation processing is obtained, the side
Method also includes：To deleting whether the corresponding distribution of gene on the chromosome after forward node variation processing meets institute with transitive attribute
State default constraints；If so, then performing described second updates operation；Otherwise, to deleting the dye after forward node variation processing
The fitness function value of colour solid performs described second and updates operation after being adjusted.
8. according to any described method of claim 1~7, it is characterised in that the interrupt model is with default constraints
The distribution quantity of the lower mandatory mission bit stream of maximization is that the object function of current optimization aim is：
<mrow>
<mi>M</mi>
<mi>a</mi>
<mi>x</mi>
<mi>F</mi>
<mn>1</mn>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
</mrow>
</munder>
<msubsup>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
</mrow>
In formula, F1 is the distribution quantity of mandatory mission bit stream；T represents any one information to be distributed, TaRepresent mandatory task
Information；Decision variable1 or 0 is taken, takes 1 expression information t to be distributed to be sent to node j from node i, 0 expression information t to be distributed is taken
Node j is not sent to from node i.
9. according to any described method of claim 1~7, it is characterised in that the interrupt model is with the default constraint
Under the conditions of to minimize total deadline of the mandatory mission bit stream of distribution be that the object function of current optimization aim is：
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>M</mi>
<mi>i</mi>
<mi>n</mi>
<mi>F</mi>
<mn>2</mn>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
</mrow>
</munder>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>V</mi>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>&CenterDot;</mo>
<msubsup>
<mi>ct</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>&CenterDot;</mo>
<msubsup>
<mi>ft</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
<mtd>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
</mrow>
</munder>
<msubsup>
<mi>x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>=</mo>
<msup>
<mi>N</mi>
<mi>a</mi>
</msup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
In formula, F2 is the total deadline for distributing mandatory mission bit stream；T represents any one information to be distributed, TaRepresent to force
Property mission bit stream；Decision variable1 or 0 is taken, takes 1 expression information t to be distributed to be sent to node j from node i, takes 0 to represent to treat point
Photos and sending messages t is not sent to node j from node i；V={ 1,2 ..., m } represents communication network topology interior joint set, and m represents communication
Network topology total node number；Represent that information t to be distributed is delivered to the propagation delay time of node j generations from node i；Expression is treated
Distribution information t is delivered to the propagation delay of node j generations from node i；NaFor the quantity of mandatory mission bit stream in task pool.
10. according to any described method of claim 1~7, it is characterised in that the default constraints includes：
<mrow>
<msub>
<mi>ET</mi>
<mi>t</mi>
</msub>
<mo>=</mo>
<msub>
<mi>ST</mi>
<mi>t</mi>
</msub>
<mo>+</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>V</mi>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<msubsup>
<mi>ct</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>ft</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
</mrow>
ETt≤lt,t∈Ta
ETt≥et,t∈Ta
ETt-STt≤D,t∈Ta
<mrow>
<msubsup>
<mi>&Sigma;x</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<msub>
<mi>TW</mi>
<mi>t</mi>
</msub>
<mo>&le;</mo>
<msub>
<mi>NW</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>,</mo>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>V</mi>
<mo>,</mo>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
</mrow>
<mrow>
<mi>&Sigma;</mi>
<mi>&Sigma;</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>v</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>&CenterDot;</mo>
<msub>
<mi>TW</mi>
<mi>t</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>&le;</mo>
<msub>
<mi>B</mi>
<mi>v</mi>
</msub>
<mo>,</mo>
<mi>v</mi>
<mo>&Element;</mo>
<mi>V</mi>
</mrow>
<mrow>
<msubsup>
<mi>&Sigma;x</mi>
<mrow>
<mi>v</mi>
<mi>j</mi>
</mrow>
<mi>t</mi>
</msubsup>
<mo>&le;</mo>
<mn>1</mn>
<mo>,</mo>
<mi>t</mi>
<mo>&Element;</mo>
<msup>
<mi>T</mi>
<mi>a</mi>
</msup>
<mo>,</mo>
<mi>v</mi>
<mo>&Element;</mo>
<mi>V</mi>
</mrow>
In formula, ETtAt the time of representing that information t to be distributed is actually reached information sink；STtRepresent that information t to be distributed is actual from information source
Start delivery time；V={ 1,2 ..., m } represents communication network topology interior joint set, and m represents the total node of communication network topology
Number；Represent that information t to be distributed is delivered to the propagation delay time of node j generations from node i；Represent information t to be distributed from node
I is delivered to the propagation delay of node j generations；TaRepresent mandatory mission bit stream；ltRepresent that information t to be distributed reaches information at the latest
The time of place；etRepresent information t to be distributed earliest information sink arrival times；D represents acceptable maximum in communication network topology
Time delay；TWtRepresent the bandwidth required for information t to be distributed；NWijRepresent directed edge in communication network topology<i,j>It can bear
Maximum bandwidth；BvThe maximum amount of data that node v can be provided is represented, v represents any node in communication network topology, v ∈
V；Decision variable1 or 0 is taken, wherein, take 1 expression information t to be distributed to be sent to node j from node i, take 0 expression letter to be distributed
Breath t is not sent to node j from node i.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710415402.1A CN107229286B (en) | 2017-06-05 | 2017-06-05 | Unmanned-manned-organized formation information distribution processing method considering manual intervention |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710415402.1A CN107229286B (en) | 2017-06-05 | 2017-06-05 | Unmanned-manned-organized formation information distribution processing method considering manual intervention |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107229286A true CN107229286A (en) | 2017-10-03 |
| CN107229286B CN107229286B (en) | 2020-07-07 |
Family
ID=59934746
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710415402.1A Active CN107229286B (en) | 2017-06-05 | 2017-06-05 | Unmanned-manned-organized formation information distribution processing method considering manual intervention |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107229286B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110674917A (en) * | 2019-10-14 | 2020-01-10 | 电子科技大学 | Long-time differential deployment method for mobile radar monitoring platform under maneuvering constraint |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192064A (en) * | 2006-11-24 | 2008-06-04 | 中国科学院沈阳自动化研究所 | Autonomous flight control system of small unmanned helicopter |
| US20110006164A1 (en) * | 2008-01-15 | 2011-01-13 | Maertensson Johan | system for automatic or pilot controlled landing of air vehicle |
| CN103744290A (en) * | 2013-12-30 | 2014-04-23 | 合肥工业大学 | Hierarchical target allocation method for multiple unmanned aerial vehicle formations |
| CN104931056A (en) * | 2015-06-23 | 2015-09-23 | 西北工业大学 | Coding method for planning three-dimensional flight paths by aid of genetic algorithms |
| CN106503832A (en) * | 2016-09-29 | 2017-03-15 | 合肥工业大学 | Unmanned someone's cooperative information distribution transmission optimization method and system |
| CN106600147A (en) * | 2016-12-15 | 2017-04-26 | 合肥工业大学 | Resolvable task oriented task assigning method and apparatus for multiple unmanned aerial vehicles |
-
2017
- 2017-06-05 CN CN201710415402.1A patent/CN107229286B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192064A (en) * | 2006-11-24 | 2008-06-04 | 中国科学院沈阳自动化研究所 | Autonomous flight control system of small unmanned helicopter |
| US20110006164A1 (en) * | 2008-01-15 | 2011-01-13 | Maertensson Johan | system for automatic or pilot controlled landing of air vehicle |
| CN103744290A (en) * | 2013-12-30 | 2014-04-23 | 合肥工业大学 | Hierarchical target allocation method for multiple unmanned aerial vehicle formations |
| CN104931056A (en) * | 2015-06-23 | 2015-09-23 | 西北工业大学 | Coding method for planning three-dimensional flight paths by aid of genetic algorithms |
| CN106503832A (en) * | 2016-09-29 | 2017-03-15 | 合肥工业大学 | Unmanned someone's cooperative information distribution transmission optimization method and system |
| CN106600147A (en) * | 2016-12-15 | 2017-04-26 | 合肥工业大学 | Resolvable task oriented task assigning method and apparatus for multiple unmanned aerial vehicles |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110674917A (en) * | 2019-10-14 | 2020-01-10 | 电子科技大学 | Long-time differential deployment method for mobile radar monitoring platform under maneuvering constraint |
| CN110674917B (en) * | 2019-10-14 | 2022-06-24 | 电子科技大学 | Long-time differential deployment method of mobile radar monitoring platform under maneuvering constraint |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107229286B (en) | 2020-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106487005B (en) | A kind of Electric power network planning method considering T-D tariff | |
| CN106600147B (en) | Towards the multiple no-manned plane method for allocating tasks and device of decomposable asymmetric choice net task | |
| CN107168366A (en) | Unmanned plane formation adaptive information distribution processing method | |
| CN101777990B (en) | Method for selecting multi-objective immune optimization multicast router path | |
| CN108880886B (en) | Method for planning protection communication network of cross-regional power system | |
| Abdelaziz | Genetic algorithm-based power transmission expansion planning | |
| CN104618134B (en) | A kind of multistage light splitting passive optical network optimization method of power distribution communication net | |
| CN108416441A (en) | A kind of naval vessel opposite bank strike Algorithm of Firepower Allocation based on genetic algorithm | |
| CN101118611A (en) | Business process model resource configuring optimizing method based on inheritance algorithm | |
| CN108494678A (en) | Alternate routing configuration method based on genetic algorithm and system | |
| CN106161440A (en) | Based on D S evidence and the multi-area optical network trust model of theory of games | |
| CN108809860B (en) | Network node resource allocation method based on service reliability | |
| CN107229286A (en) | Consider manual intervention nobody have man-machine formation information distribution processing method | |
| CN106658639A (en) | QG-OLSR routing method based on quantum genetic strategy | |
| CN107241273A (en) | A kind of communications ring network structure method to set up based on genetic algorithm | |
| CN104392317B (en) | A kind of project scheduling method based on hereditary cultural gene algorithm | |
| CN114677218A (en) | Off-link transaction method based on payment knot | |
| CN107203221A (en) | Unmanned plane and there are online information distribution method and the device in man-machine composite formation | |
| CN102624596B (en) | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network | |
| CN107229285A (en) | Unmanned plane formation information distribution weight planing method, computer-readable recording medium | |
| CN115963731B (en) | Command control system network structure optimization method based on improved genetic algorithm | |
| CN107247461A (en) | Consider bursty interference nobody have man-machine formation information distribution processing method | |
| CN107168365A (en) | Nobody has the dynamic distribution processing method of man-machine formation information | |
| CN106980324A (en) | Unmanned plane formation dynamic self-adapting information distribution processing method | |
| CN103685020B (en) | A kind of light multicast tree minimum cost method for routing based on genetic algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |