CN104360910A - Equipment distribution method for detecting equipment network on basis of particle swarm algorithm - Google Patents

Equipment distribution method for detecting equipment network on basis of particle swarm algorithm Download PDF

Info

Publication number
CN104360910A
CN104360910A CN201410717815.1A CN201410717815A CN104360910A CN 104360910 A CN104360910 A CN 104360910A CN 201410717815 A CN201410717815 A CN 201410717815A CN 104360910 A CN104360910 A CN 104360910A
Authority
CN
China
Prior art keywords
particle
equipment
monitoring
monitoring task
time
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
Application number
CN201410717815.1A
Other languages
Chinese (zh)
Other versions
CN104360910B (en
Inventor
江海
刘静
张耀
程昊文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National Astronomical Observatories of CAS
Original Assignee
National Astronomical Observatories of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by National Astronomical Observatories of CAS filed Critical National Astronomical Observatories of CAS
Priority to CN201410717815.1A priority Critical patent/CN104360910B/en
Publication of CN104360910A publication Critical patent/CN104360910A/en
Application granted granted Critical
Publication of CN104360910B publication Critical patent/CN104360910B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to an equipment distribution method for a detecting equipment network on the basis of a particle swarm algorithm. The method comprises the following steps that 1, a monitoring task model among detecting equipment, a detecting target and a deterring time interval is built, detectable monitoring task sequences of equipment are generated, and in addition, simulation parameters are initialized; 2, the corresponding relationship between each particle and the detectable monitoring task sequences of the equipment is built, and in addition, the time interval of the detecting task is regulated according to elements of each particle; 3, the fitness function of each particle is calculated according to the mapping relationship between each particle and a monitoring task, and in addition, the local optimal solution and the global optimal solution of a particle swarm are updated; 4, whether the number of iterations reaches preset conditions or not is judged, if so, the monitoring task sequence corresponding to the global optimal particle is output, if not, the parameters of the particle swarm are updated, and the second to fourth steps are repeated until the conditions are met. The equipment distribution method has the advantages that the problem of task distribution when a plurality of pieces of detecting equipment are networked for monitoring a plurality of targets is effectively solved, and the optimization of the equipment work state of the detecting equipment network is realized.

Description

Based on the device allocation method of the detecting devices net of particle cluster algorithm
Technical field
The present invention relates to Space Object Detection technical field, relate more specifically to a kind of device allocation method of the detecting devices net based on particle cluster algorithm, the optimization of device resource when being applicable to the multiple extraterrestrial target of many equipment combined detection distributes.
Background technology
What detecting devices distribution technique solved is how to optimize the detection resource allocation problem distributing the multiple extraterrestrial target of multiple detecting devices networking combined detection.Over nearly ten or twenty year, extraterrestrial target quantity sharply increases, and causes great threat to the safety of spacecraft in-orbit.In order to ensure the safety of spacecraft in-orbit, detecting devices is on the increase, and needs each equipment of Optimized Operation, gives full play to the detection performance of each equipment, the more target in-orbit of detection.Being optimized scheduling to the detectable situation of all devices is a discrete combination problem, and when equipment and destination number increase, one-tenth geometric series increases and becomes a unsolvable problem of classic method by this optimization problem complexity.
Particle group optimizing (Particle Swarm Optimization, PSO) be a kind of new optimum theory occurred in recent years, the method to be looked for food migrating with clustering behavior and a kind of global random searching algorithm based on swarm intelligence of proposing (for example, see article " Particle swarm optimization " in process by simulation flock of birds, publish in Proceedings of the 1995IEEE International Conference on Neural Networks, 1995:1942-1948).
The continuity of particle cluster algorithm to optimization object function and problem definition does not have particular/special requirement, makes this algorithm application more extensive; There is no center control constraints, more have robustness; Adopt the information sharing mode of non-immediate to realize cooperation, have more extendibility; Random search essence, makes it more difficultly be absorbed in local optimum.Therefore, particle cluster algorithm is for complexity, and particularly the optimization computational problem of multimodal higher-dimension has very strong superiority.
The feature that particle cluster algorithm has easy understanding, easily realizes, all has stronger ability of searching optimum to non-linear, multiple peak problem, gets the attention when processing some optimization problems in scientific research and engineering practice.How being applied in the scheduling of detecting devices monitoring task will be the technical issues that need to address of the present invention.
Summary of the invention
In view of this, one of fundamental purpose of the present invention is to provide a kind of detecting devices networking equipment distribution method based on particle cluster algorithm, so that when to the scheduling of monitoring task resource, realize obtaining faster the monitoring task scheduling result of optimization, the computation complexity overcoming conventional combination method is high and the optimization process of many equipment multi-objective problem is consumed to the problem of a large amount of time and computational resource deficiency.
For achieving the above object, technical solution of the present invention is:
Based on a device allocation method for the detecting devices net of particle cluster algorithm, it is characterized in that: comprise the steps:
Step 1, according to the detection relation of detecting devices to extraterrestrial target, set up detecting devices collection, monitoring task model between detection of a target collection and detection time Interval Set, generate the detectable monitoring task sequence of equipment, and initialization simulation parameter;
Step 2, set up the corresponding relation of the task sequence that each particle and equipment can be monitored, and the time interval of element adjustment detection mission according to each particle;
Step 3, calculate the fitness function of each particle according to particle each described in step 2 and the mapping relations of monitoring task, and upgrade locally optimal solution and the globally optimal solution of described population;
Step 4, judge whether iterations reaches and preset threshold value, as satisfied condition, exporting the monitoring task sequence that the globally optimal solution that calculates according to step 3 is corresponding, otherwise upgrading population parameter, and jumping to step 2.
Wherein, in described step 1, the set of definition detecting devices is A={ α 1..., α m, detection of a target set is B=(β 1..., β n, detectable time interval set is ∑=(ε 1..., ε k, time interval ε k(1≤k≤K) is expressed as time period [s k, e k], the equipment that this time interval is corresponding and target are respectively α m, km, k∈ A) and β n, kn, k∈ B), the interval corresponding monitoring set of tasks of raw definition uphole equipment, the detection of a target and detection time is Ω 0={ ω 1..., ω k, wherein ω k=(α m, k, β n, k, κ k, η k), κ kand η kbe respectively monitoring task ω kstart time and end time, and definition particle vector X=(x 1..., x k), wherein x k(1≤k≤K) is expressed as the execution preferred number of a kth monitoring task, definition particle rapidity vector V=(v 1..., v k); And initialization simulation parameter: iterations is chosen for K, and generate 5K particle, a 5K particle rapidity and 5K monitoring set of tasks one_to_one corresponding, and carry out initialization, other parameter initialization is particular value.
Wherein, in described step 2, set up the corresponding relation of the task sequence that the element of each particle and detecting devices can be monitored, and comprise according to the step that the time interval of parameter to detection mission of each particle adjusts:
1. choose the monitoring task that the sequence number of the element that kth is large in a particle is corresponding, is set to the start time of this time interval the start time of monitoring task, wherein k is positive integer, increases progressively from 1,1≤k≤K;
2. determine to monitor job end time according to the requirement of the minimum detection duration of monitoring task;
3. upgrade the start time and the end time that there are the time interval of common factor with the time interval chosen, form the new monitoring task sequence corresponding with this particle, continue next element repeat step 1. ~ 3. until all elements of this particle has all processed;
4. continue to choose next particle repeat step 1. ~ 3., until all particle process complete.
Wherein, in described step 2, in time interval adjustment process, the condition of demand fulfillment is:
A, each radar equipment can only monitor a target in-orbit simultaneously;
B, each monitoring task must perform in corresponding time interval, monitoring task ω kthe time span of (1≤k≤K) can not be less than the shortest time requirement T (ω of task k), and arbitrary time interval belongs to and only belongs to the interval subset of pot life of some monitoring tasks;
C, target beta nmonitoring time length summation in (1≤n≤N) each time interval is not less than the shortest detection requirement μ of this target call n.
Wherein, fitness function F (A, B, the Ω of described particle t in step 3 t) computing method be:
F(A,B,Ω t)=D eff,t·D eqi,t(1)
Wherein D eff, tfor the monitoring task scheduling benefit that particle is corresponding, D eqi, tfor equipment use equilibrium degree in the monitoring task sequence that particle is corresponding, 1≤t≤5K, circular is as follows:
The monitoring task scheduling benefit D that a, particle t are corresponding eff, tbe defined as
D eff , t = Σ β n ∈ B ρ n · f ( Σ ω t , k ∈ Ω t φ ( ω t , k , β n ) ( η t , k - κ t , k ) , μ n ) - - - ( 2 )
In formula, ρ nfor the preferred number of target beta n monitoring; ω t, kit is the kth monitoring task in t monitoring series of task; φ (ω t, k, β n) be discriminant function, as monitoring task ω t, kbe used for monitoring objective β ntime φ (ω t, k, β n)=1, otherwise φ (ω t, k, β n)=0; κ t, kand η t, krepresent ω respectively t, kstart time and the end time; F (t, μ) represents monitoring task scheduling utility function, describes the integrated scheduling usefulness of actual execution time l under minimum monitoring time μ condition of target, is defined as
f ( l , &mu; ) = 0 l < &mu; 1 + &sigma; l - &mu; &mu; l &GreaterEqual; &mu; - - - ( 3 )
In formula, parameter σ is monitoring redundancy execution utilization coefficient, and span is [0,1];
Equipment use equilibrium degree D in the monitoring task sequence that b, particle t are corresponding eqi, tbe defined as
D eqi , t = ( &Pi; &theta; m > 0 ( 1 + &theta; m &CenterDot; U A ( &alpha; m , &Omega; t ) ) ) 1 M 0 ( &Pi; &theta; 0 > 0 ( 1 + &theta; m M 0 &CenterDot; ( 1 + &Sigma; &theta; i > 0 1 &theta; i - M 0 &theta; m ) ) ) 1 M 0 - - - ( 4 )
In formula, θ mm>=0) be the preferential coefficient of performance of uphole equipment, if θ m=0, then represent the utilization factor not needing to consider this equipment; M 0for equipment preferred number is greater than 0 equipment number, U am, Ω t) be at monitoring task Ω tdistribution method under equipment α mutilization factor, be defined as
U A ( &alpha; m , &Omega; t ) = sign ( &theta; m ) &CenterDot; &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; m ) ( &eta; t , k - &kappa; t , k ) &Sigma; &theta; i > 0 &alpha; i &Element; A &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; i ) ( &eta; t , k &kappa; t , k ) - - - ( 5 )
Wherein ψ (ω t, k, α m) be discriminant function, as monitoring task ω t, kby equipment α mψ (ω during monitoring t, k, α m)=1, otherwise ψ (ω t, k, α m)=0; Sign (.) is sign function, is defined as
sign ( x ) = 1 x > 0 0 x = 0 - 1 x < 0 - - - ( 6 )
Wherein, in step 4 described in preset threshold value be the max calculation that presets time condition.
Known based on technique scheme, method of the present invention compared with prior art advantage is: the present invention makes full use of the feature that particle cluster algorithm can realize from calculating combinatorial problem optimizing fast, particle cluster algorithm is incorporated in the distribution of detecting devices networking equipment, the Optimized Operation of the device resource to multiple detecting devices networking can be realized fast, greatly improve equipment allocative efficiency.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the detecting devices networking equipment distribution method based on particle cluster algorithm of the present invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in further detail.
The invention provides a kind of detecting devices networking equipment distribution method based on particle cluster algorithm, utilize particle cluster algorithm theory can realize the feature of combinatorial problem optimizing fast, particle cluster algorithm is incorporated in detecting devices networking Optimized Operation.As shown in Figure 1, be the implementing procedure figure of a kind of detecting devices networking equipment distribution method based on particle cluster algorithm of the present invention, specifically comprise following 4 steps:
(1) defining detecting devices set is A={ α 1..., α m, detection of a target set is B={ β 1..., β n, detectable time interval set is ∑={ ε 1..., ε k, time interval ε k(1≤k≤K) is expressed as time period [s k, e k], the equipment that this time interval is corresponding and target are respectively α m, km, k∈ A) and β n, kn, k∈ B), the interval corresponding monitoring set of tasks of definition uphole equipment, the detection of a target and detection time is Ω 0={ ω 1..., ω k, wherein ω k=(α m, k, β n, k, κ k, η k).Definition particle vector X=(x 1..., x k), wherein x k(1≤k≤K) is expressed as the execution preferred number of a kth monitoring task, definition particle rapidity vector V=(v 1..., v k).Other simulation parameter of initialization: monitoring task shortest length collection is { T 1..., T k, target detection the shortest monitoring duration collection is { μ 1..., μ k, iterations is chosen for K, generates 5K particle { X 1..., X 5K, a 5K particle rapidity { V 1..., V 5Kand 5K monitoring set of tasks { Ω 1..., Ω 5Kone_to_one corresponding, by t (1≤t≤5K) individual particle X twith speed V tbe initialized as X t = { x t , 1 0 , . . . , x t , K 0 } With V t = { v t , 1 0 , . . . , v t , K 0 } , Wherein with v t , k 0 ( 1 &le; k &le; K ) All be set to equally distributed random number between (0,1), and t (1≤t≤5K) individual monitoring series of task is initialized as Ω t0, the preferred number set { ρ of each target monitoring of initialization 1..., ρ n, the preferential coefficient of performance set { θ of initialization apparatus 1..., θ m;
(2) carry out adjustment according to the time interval of element to detection of each particle and upgrade monitoring task, in time interval adjustment process, need the several supposed premise conditions set:
A, each radar equipment can only detect a target in-orbit simultaneously;
The monitoring task of b, t (1≤t≤5K) individual particle must perform in corresponding time interval, monitoring task ω t, kthe time span of (1≤k≤K) can not be less than T k, and arbitrary time interval belongs to and only belongs to the interval subset of pot life of some monitoring tasks;
C, target beta nmonitoring time length summation in (1≤n≤N) each time interval is not less than the shortest detection requirement of this target call μ n.
Determine that the time interval of the element of each particle to detection carries out adjustment and upgrade monitoring task agent containing 4 steps:
1. the sequence number i of the element that kth is large in t particle is chosen s, kcorresponding time interval adjust, wherein t and k is positive integer, increases progressively from 1,1≤t≤5K, 1≤k≤K;
2. task is monitored the corresponding start time and the end time determination be divided into following three steps:
1) task is monitored start time be set to time interval start time, namely
k i t , k = s i t , k ;
2) job end time timing is really monitored, to ensure that this monitoring task execution time is long as far as possible on the one hand, after ensureing to distribute this monitoring task simultaneously, time interval as much as possible is had to carry out monitoring task in the time interval set of device conflict or goal conflict, so the end time of monitoring task is
&eta; i t , k = min { e i t , k , min { e h - T h | e h - T h &GreaterEqual; &kappa; h + T h &epsiv; h &Element; &Gamma; i t , k } } - - - ( 1 )
Wherein, for the time end time, represent monitoring series of task Ω tin with time interval there is the set of occuring simultaneously and belonging to the time interval of same equipment;
3) update time Interval Set in start time of all time intervals and end time.
3. upgrade the start time and the end time that there are the time interval of common factor with the time interval chosen, form the new monitoring task sequence corresponding with t particle, continue next element repeat step 1. ~ 3. until all elements of this particle has all processed;
4. continue to choose next particle repeat step 1. ~ 3., until all particle process complete.
(3) according to the mapping relations of each particle in step (2) with monitoring task, the implementation procedure calculating the fitness function of t (1≤t≤5K) individual particle is divided into four steps:
1. the monitoring task scheduling benefit D that this particle t is corresponding is calculated eff, t:
D eff , t = &Sigma; &beta; n &Element; B &rho; n &CenterDot; f ( &Sigma; &omega; t , k &Element; &Omega; t &phi; ( &omega; t , k , &beta; n ) ( &eta; t , k - &kappa; t , k ) , &mu; n ) - - - ( 2 )
In formula, ρ nfor target beta nthe preferred number of monitoring; φ (ω t, k, β n) be discriminant function, as monitoring task ω t, kbe used for monitoring objective β ntime φ (ω t, k, β n)=1, otherwise φ (ω t, k, β n)=0; F (t, μ) represents monitoring task scheduling utility function, and describe the actual execution time l of target, the integrated scheduling usefulness under minimum monitoring time μ condition, is defined as
f ( l , &mu; ) = 0 l < &mu; 1 + &sigma; l - &mu; &mu; l &GreaterEqual; &mu; - - - ( 3 )
In formula, parameter σ is monitoring redundancy execution utilization coefficient, and span is [0,1];
2. equipment use equilibrium degree D in monitoring task sequence corresponding to particle is calculated eqi, t:
D eqi , t = ( &Pi; &theta; m > 0 ( 1 + &theta; m &CenterDot; U A ( &alpha; m , &Omega; t ) ) ) 1 M 0 ( &Pi; &theta; 0 > 0 ( 1 + &theta; m M 0 &CenterDot; ( 1 + &Sigma; &theta; i > 0 1 &theta; i - M 0 &theta; m ) ) ) 1 M 0 - - - ( 4 )
In formula, θ mm>=0) be uphole equipment α m(1≤m≤M) preferential coefficient of performance, if ρ m=0, then represent the utilization factor not needing to consider this equipment; M 0for equipment preferred number is greater than 0 equipment number, U am, Ω t) be at monitoring task Ω tdistribution method under equipment α mutilization factor, be defined as
U A ( &alpha; m , &Omega; t ) = sign ( &theta; m ) &CenterDot; &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; m ) ( &eta; t , k - &kappa; t , k ) &Sigma; &theta; i > 0 &alpha; i &Element; A &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; i ) ( &eta; t , k &kappa; t , k ) - - - ( 5 )
Wherein ψ (ω t, k, α m) be discriminant function, as monitoring task ω t, kby equipment α mψ (ω during monitoring t, k, α m)=1, otherwise ψ (ω t, k, α m)=0; Sign (.) is sign function, is defined as
sign ( x ) = 1 x > 0 0 x = 0 - 1 x < 0 - - - ( 6 )
3. fitness value V α lue corresponding to this particle is calculated according to fitness function t, fitness function F (A, B, Ω t) be defined as:
Vαlue t=F(A,B,Ω t)=D eff·De qi(7)
4. according to the fitness value of all calculating particles, the particle X that in current iteration calculating, in all particles, fitness value is maximum is obtained iter, maxwith the monitoring series of task Ω of correspondence iter, max, and then count on the maximum particle X of fitness so far g, maxwith the monitoring series of task Ω of correspondence g, max, wherein X iter, maxand X g, maxbe respectively locally optimal solution and the globally optimal solution of population.
(4) according to the result of calculation of step (3), judge whether iterations iter reaches the threshold value preset, such as max calculation time condition, if do not met, upgrades speed and the particle element of t (1≤t≤5K) individual particle by following formula:
V t iter + 1 = &chi; ( V t iter + c 1 &times; r 1 &times; ( X iter , max - X t iter ) + c 2 &times; r 2 &times; ( X g , max - X t iter ) ) x t iter + 1 = X t iter + V t iter + 1 - - - ( 8 )
In formula, c 1and c 2for constant, generally get c 1=c 2=2.05, r 1and r 2be the random number between 0 ~ 1, χ is contraction factor, is defined as
&chi; = 2 | 2 - &xi; - &xi; 2 - 4 &delta; | - - - ( 9 )
Wherein ξ=c 1+ c 2>=4.
Then repeating step (2) ~ (4) until satisfy condition, then exporting monitoring task sequence corresponding to global optimum's particle as satisfied condition, the final Optimized Operation realized detecting devices networking monitoring task.
Below by emulation, the inventive method is verified.What emulate in experiment is two multiple targets in-orbit of detecting devices detection, equipment 1 is positioned at north latitude 40 degree of east longitudes 116 degree, equipment 2 is positioned at north latitude 30 degree of east longitudes 106 degree, investigative range is 60 ° ~ 180 °, orientation, 30 ° ~ 60 °, latitude, the detection of a target is that the target RCS of orbit altitude below 2000 kilometers is greater than 1m 2satellite in orbit, what orbital tracking was selected is the Two-type line that August 18, NASA provided, by pass by analyze obtain two equipment in 1800 seconds of UTC time 2014-08-1800:00:00 ~ 2014-08-1800:30:00 detectable target information respectively in table 1 and 2, have 43 targets can be detected, if each target cumulative time length is no less than 60 seconds, in each time interval, the time span of monitoring is no less than 60 seconds, the preferred number of target 25676 is set to 5, the preferred number of other 42 targets is all set to 1, the preferential coefficient of performance of two detecting devicess is 1, iteration of simulations number of times is set to 100 times.Table 3 and table 4 be not for optimize, and equipment 1 and equipment 2 directly carry out the result of following the tracks of according to time sequencing, and table 5 and table 6 are respectively the result of detection of the equipment 1 after networking optimization and equipment 2.
The detectable target information of table 1 equipment 1
The detectable target information of table 2 equipment 2
The detectable target information of table 3 subsequent detection equipment 1
The detectable target information of table 4 subsequent detection equipment 2
The detection information of equipment 1 after table 5 two equipment network optimizations
The detection information of equipment 2 after table 6 two equipment network optimizations
As can be seen from the contrast of table 3 above and table 5 and table 4 and table 6: detecting devices 1, do not optimize and adopt in chronological order detection time can only detect 12 targets, 19 targets can be detected after optimization, detecting devices 2 do not optimize and adopt in chronological order detection time can only detect 10 targets, 12 targets can be detected after optimization, illustrate that the detection performance of individual equipment has had obvious lifting; Consider two equipment, detectable 21 targets altogether can be found out before optimization, and 30 targets can be detected after optimizing, so be a kind of algorithm that can be used for actual multiple equipment network equipment and distribute based on the detecting devices networking equipment distribution method of particle cluster algorithm.
Above-described specific embodiment; object of the present invention, technical scheme and beneficial effect are further described; be understood that; the foregoing is only specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (6)

1., based on a device allocation method for the detecting devices net of particle cluster algorithm, it is characterized in that: comprise the steps:
Step 1, according to the detection relation of detecting devices to extraterrestrial target, set up detecting devices collection, monitoring task model between detection of a target collection and detection time Interval Set, generate the detectable monitoring task sequence of equipment, and initialization simulation parameter;
Step 2, set up the corresponding relation of the task sequence that each particle and equipment can be monitored, and the time interval of element adjustment detection mission according to each particle;
Step 3, calculate the fitness function of each particle according to particle each described in step 2 and the mapping relations of monitoring task, and upgrade locally optimal solution and the globally optimal solution of described population;
Step 4, judge whether iterations reaches and preset threshold value, as satisfied condition, exporting the monitoring task sequence that the globally optimal solution that calculates according to step 3 is corresponding, otherwise upgrading population parameter, and jumping to step 2.
2. the device allocation method of the detecting devices net based on particle cluster algorithm according to claim 1, is characterized in that, in described step 1, the set of definition detecting devices is A={ α 1..., α m, detection of a target set is B={ β 1..., β n, detectable time interval set is ∑={ ε 1..., ε k, time interval ε hbe expressed as time period [s k, e k], the equipment that this time interval is corresponding and target are respectively α m, km, k∈ A) and β n, kn, k∈ B), the interval corresponding monitoring set of tasks of definition uphole equipment, the detection of a target and detection time is Ω 0={ ω 1..., ω k, wherein 1≤k≤K, ω k=(α m, k, β n, k, k k, η k), k kand η kbe respectively monitoring task ω kstart time and end time, and definition particle vector X=(x 1..., x k), wherein x hbe expressed as the execution preferred number of a kth monitoring task, 1≤k≤K, definition particle rapidity vector V=(v 1..., v k); And initialization simulation parameter: iterations is chosen for K, and generate 5K particle, a 5K particle rapidity and 5K monitoring set of tasks one_to_one corresponding, and carry out initialization, other parameter initialization is particular value.
3. the device allocation method of the detecting devices net based on particle cluster algorithm according to claim 1, it is characterized in that, in described step 2, set up the corresponding relation of the task sequence that the element of each particle and detecting devices can be monitored, and comprise according to the step that the time interval of parameter to detection mission of each particle adjusts:
1. choose the monitoring task that the sequence number of the element that kth is large in a particle is corresponding, is set to the start time of this time interval the start time of monitoring task, wherein k is positive integer, increases progressively from 1,1≤k≤K;
2. determine to monitor job end time according to the requirement of the minimum detection duration of monitoring task;
3. upgrade the start time and the end time that there are the time interval of common factor with the time interval chosen, form the new monitoring task sequence corresponding with this particle, continue next element repeat step 1. ~ 3. until all elements of this particle has all processed;
4. continue to choose next particle repeat step 1. ~ 3., until all particle process complete.
4. the device allocation method of the detecting devices net based on particle cluster algorithm according to claim 1, is characterized in that, in described step 2, in time interval adjustment process, the condition of demand fulfillment is:
A, each radar equipment can only monitor a target in-orbit simultaneously;
B, each monitoring task must perform in corresponding time interval, monitoring task ω ktime span shortest time that can not be less than task require in (ω k), and arbitrary time interval belongs to and only belongs to the interval subset of pot life of some monitoring tasks, wherein k is positive integer, 1≤k≤K;
C, target beta nmonitoring time length summation in each time interval is not less than the shortest detection requirement μ of this target call n, wherein 1≤n≤N.
5. the device allocation method of the detecting devices net based on particle cluster algorithm according to claim 1, is characterized in that, in step 3 fitness function F (A, B, the Ω of described particle t t) computing method be:
F(A,B,Ω t)=D eff,t·D eqi,t(1)
Wherein D eff, tfor the monitoring task scheduling benefit that particle is corresponding, D eqi, tfor the monitoring task sequence that particle is corresponding
Equipment use equilibrium degree in row, 1≤t≤5K, circular is as follows:
The monitoring task scheduling benefit D that a, particle t are corresponding eff, tbe defined as
D eff , t = &Sigma; &beta; n &Element; B &rho; n &CenterDot; f ( &Sigma; &omega; t , k &Element; &Omega; t &phi; ( &omega; t , k , &beta; n ) ( &eta; t , k - k t , k ) , &mu; n ) - - - ( 2 )
In formula, ρ nfor target beta nthe preferred number of monitoring; ω t, kit is the kth monitoring task in t monitoring series of task; φ (ω t, k, β n) be discriminant function, as monitoring task ω t, kbe used for monitoring objective β ntime φ (ω t, k, β n)=1, otherwise φ (ω t, k, β n)=0; k t, kand η t, krepresent ω respectively t, kstart time and the end time; F (t, μ) represents monitoring task scheduling utility function, describes the integrated scheduling usefulness of actual execution time l under minimum monitoring time μ condition of target, is defined as
f ( l , &mu; ) = 0 l < &mu; 1 + &sigma; l - &mu; &mu; l &GreaterEqual; &mu; - - - ( 3 )
In formula, parameter σ is monitoring redundancy execution utilization coefficient, and span is [0,1];
Equipment use equilibrium degree D in the monitoring task sequence that b, particle t are corresponding eqi, tbe defined as
D eqi , t = ( &Pi; &theta; m > 0 ( 1 + &theta; m &CenterDot; U A ( &alpha; m , &Omega; t ) ) ) 1 M 0 ( &Pi; &theta; m > 0 ( 1 + &theta; m M 0 &CenterDot; ( 1 + &Sigma; &theta; i > 0 1 &theta; i - M 0 &theta; m ) ) ) 1 M 0 - - - ( 4 )
In formula, θ mm>=0) be the preferential coefficient of performance of uphole equipment, if θ m=0, then represent the utilization factor not needing to consider this equipment; M 0for equipment preferred number is greater than 0 equipment number, U am, Ω t) be at monitoring task Ω tdistribution method under equipment α mutilization factor, be defined as
U A ( &alpha; m , &Omega; t ) = sign ( &theta; m ) &CenterDot; &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; m ) ( &eta; t , k - k t , k ) &Sigma; &alpha; i &Element; A &theta; i > 0 &Sigma; &omega; t , k &Element; &Omega; t &psi; ( &omega; t , k , &alpha; i ) ( &eta; t , k - k t , k ) - - - ( 5 )
Wherein ψ (ω t, k, α m) be discriminant function, 1≤m≤M; As monitoring task ω t, kby equipment α mψ (ω during monitoring t, k, α m)=1, otherwise ψ (ω t, k, α m)=0; Sign (.) is sign function, is defined as
sign ( x ) = 1 x > 0 0 x = 0 - 1 x < 0 - - - ( 6 )
6. the device allocation method of the detecting devices net based on particle cluster algorithm according to claim 1, is characterized in that, presetting threshold value is in step 4 the max calculation time condition preset.
CN201410717815.1A 2014-12-01 2014-12-01 The device allocation method of detecting devices net based on particle cluster algorithm Active CN104360910B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410717815.1A CN104360910B (en) 2014-12-01 2014-12-01 The device allocation method of detecting devices net based on particle cluster algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410717815.1A CN104360910B (en) 2014-12-01 2014-12-01 The device allocation method of detecting devices net based on particle cluster algorithm

Publications (2)

Publication Number Publication Date
CN104360910A true CN104360910A (en) 2015-02-18
CN104360910B CN104360910B (en) 2018-08-28

Family

ID=52528174

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410717815.1A Active CN104360910B (en) 2014-12-01 2014-12-01 The device allocation method of detecting devices net based on particle cluster algorithm

Country Status (1)

Country Link
CN (1) CN104360910B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106569030A (en) * 2016-11-11 2017-04-19 广东电网有限责任公司电力科学研究院 Alarm threshold optimizing method and device in electric energy metering abnormity diagnosis
CN108459310A (en) * 2018-02-06 2018-08-28 西安四方星途测控技术有限公司 Method for reconstructing three-dimensional shape parameters of space target
CN109118064A (en) * 2018-07-25 2019-01-01 中国电子科技集团公司第二十八研究所 A kind of optimal resource allocation method for detection mission planning
CN109358964A (en) * 2018-09-21 2019-02-19 中建材信息技术股份有限公司 A kind of server cluster resource regulating method
CN112906299A (en) * 2021-02-05 2021-06-04 北京交通大学 Data calculation method and system for digital twin simulation of urban rail power supply system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6345240B1 (en) * 1998-08-24 2002-02-05 Agere Systems Guardian Corp. Device and method for parallel simulation task generation and distribution
CN101923673A (en) * 2010-04-30 2010-12-22 湖南大学 Automobile spare part loading optimization method based on improved secondary particle swarm algorithm
CN102208046A (en) * 2011-05-19 2011-10-05 山东大学 Binary system particle swarm optimization (BSPSO) algorithm-based chaotic time series prediction method
US20140095674A1 (en) * 2012-09-28 2014-04-03 Roman Talyansky Self-Management of Request-Centric Systems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6345240B1 (en) * 1998-08-24 2002-02-05 Agere Systems Guardian Corp. Device and method for parallel simulation task generation and distribution
CN101923673A (en) * 2010-04-30 2010-12-22 湖南大学 Automobile spare part loading optimization method based on improved secondary particle swarm algorithm
CN102208046A (en) * 2011-05-19 2011-10-05 山东大学 Binary system particle swarm optimization (BSPSO) algorithm-based chaotic time series prediction method
US20140095674A1 (en) * 2012-09-28 2014-04-03 Roman Talyansky Self-Management of Request-Centric Systems

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈宇: "基于免疫粒子群算法的多星观测调度研究", 《计算机仿真》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106569030A (en) * 2016-11-11 2017-04-19 广东电网有限责任公司电力科学研究院 Alarm threshold optimizing method and device in electric energy metering abnormity diagnosis
CN106569030B (en) * 2016-11-11 2019-04-09 广东电网有限责任公司电力科学研究院 Alarm threshold optimization method and device in a kind of electrical energy measurement abnormity diagnosis
CN108459310A (en) * 2018-02-06 2018-08-28 西安四方星途测控技术有限公司 Method for reconstructing three-dimensional shape parameters of space target
CN109118064A (en) * 2018-07-25 2019-01-01 中国电子科技集团公司第二十八研究所 A kind of optimal resource allocation method for detection mission planning
CN109358964A (en) * 2018-09-21 2019-02-19 中建材信息技术股份有限公司 A kind of server cluster resource regulating method
CN109358964B (en) * 2018-09-21 2022-02-11 中建材信息技术股份有限公司 Server cluster resource scheduling method
CN112906299A (en) * 2021-02-05 2021-06-04 北京交通大学 Data calculation method and system for digital twin simulation of urban rail power supply system
CN112906299B (en) * 2021-02-05 2023-10-13 北京交通大学 Digital twin simulation data calculation method and system of urban rail power supply system

Also Published As

Publication number Publication date
CN104360910B (en) 2018-08-28

Similar Documents

Publication Publication Date Title
Abdoos A new intelligent method based on combination of VMD and ELM for short term wind power forecasting
Behera et al. Solar photovoltaic power forecasting using optimized modified extreme learning machine technique
CN104360910A (en) Equipment distribution method for detecting equipment network on basis of particle swarm algorithm
CN110070226B (en) Photovoltaic power prediction method and system based on convolutional neural network and meta-learning
Chen et al. Lithium-ion batteries remaining useful life prediction based on BLS-RVM
Osório et al. Short-term wind power forecasting using adaptive neuro-fuzzy inference system combined with evolutionary particle swarm optimization, wavelet transform and mutual information
Majumder et al. Variational mode decomposition based low rank robust kernel extreme learning machine for solar irradiation forecasting
Liang et al. A multi-variable stacked long-short term memory network for wind speed forecasting
Lu et al. Adaptive JSPA in distributed colocated MIMO radar network for multiple targets tracking
CN104810826A (en) Bidirectional iteration parallel probability load flow calculation method combining Latin hypercube sampling
Akyurek et al. Tesla: Taylor expanded solar analog forecasting
Chen et al. Research on wind power prediction method based on convolutional neural network and genetic algorithm
Mirmomeni et al. Introducing adaptive neurofuzzy modeling with online learning method for prediction of time-varying solar and geomagnetic activity indices
El Shahat et al. An artificial neural network model for wind energy estimation
Corsetti et al. Recurrent neural networks for very short term energy resource planning in a microgrid
Agrawal et al. Transformer‐based time series prediction of the maximum power point for solar photovoltaic cells
Showkati et al. Short term load forecasting using echo state networks
Tartakovsky et al. Physics-informed machine learning method for forecasting and uncertainty quantification of partially observed and unobserved states in power grids
Li et al. Echo state network-based spatio-temporal model for solar irradiance estimation
Trashchenkov et al. Kernel density estimation for stochastic modeling of PV power output
Kerem et al. Wind power forecasting using a new and robust hybrid metaheuristic approach: a case study of multiple locations
CN107995632B (en) Passive sensing node deployment scheduling method for ensuring static target detection quality
CN113935174A (en) Space debris environment efficient evolution prediction and influence factor analysis method
Huang et al. Application-driven sensing data reconstruction and selection based on correlation mining and dynamic feedback
CN112001518A (en) Prediction and energy management method and system based on cloud computing

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant