CN108333583B - Resource allocation method based on dual-target optimization of phased array radar search and tracking - Google Patents

Resource allocation method based on dual-target optimization of phased array radar search and tracking Download PDF

Info

Publication number
CN108333583B
CN108333583B CN201810057487.5A CN201810057487A CN108333583B CN 108333583 B CN108333583 B CN 108333583B CN 201810057487 A CN201810057487 A CN 201810057487A CN 108333583 B CN108333583 B CN 108333583B
Authority
CN
China
Prior art keywords
allocation
search
during
sub
array radar
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.)
Active
Application number
CN201810057487.5A
Other languages
Chinese (zh)
Other versions
CN108333583A (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.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN201810057487.5A priority Critical patent/CN108333583B/en
Publication of CN108333583A publication Critical patent/CN108333583A/en
Application granted granted Critical
Publication of CN108333583B publication Critical patent/CN108333583B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S13/00Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
    • G01S13/66Radar-tracking systems; Analogous systems
    • G01S13/72Radar-tracking systems; Analogous systems for two-dimensional tracking, e.g. combination of angle and range tracking, track-while-scan radar
    • G01S13/723Radar-tracking systems; Analogous systems for two-dimensional tracking, e.g. combination of angle and range tracking, track-while-scan radar by using numerical data
    • G01S13/726Multiple target tracking
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S7/00Details of systems according to groups G01S13/00, G01S15/00, G01S17/00
    • G01S7/02Details of systems according to groups G01S13/00, G01S15/00, G01S17/00 of systems according to group G01S13/00

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Radar Systems Or Details Thereof (AREA)

Abstract

The invention discloses a resource allocation method based on phased array radar searching and tracking dual-target optimization, which belongs to the technical field of radar and mainly comprises the following steps: setting search area existence Q of time-controlled array radar distributed for the kth timekThe search area of the phased array radar is divided into N when the k-th distribution is carried outkA plurality of non-overlapping search sectors; let K be the kth distribution, K is more than or equal to 1 and less than or equal to K, the initial value of K is 1, and K is an even number greater than 0; obtaining the phased array radar allocation N during the 1 st allocation period1Optimal search time resources for non-overlapping search sectors
Figure DDA0001554226170000011
Phased array radar allocation to N during allocation up to KthKOptimal search time resources for non-overlapping search sectors
Figure DDA0001554226170000012
And phased array radar allocation to Q during the 1 st allocation1Tracking time resource column vector optimal solution of each target
Figure DDA0001554226170000013
Phased array radar allocation to Q during the Kth allocationKTracking time resource column vector optimal solution of each target
Figure DDA0001554226170000014
And recording as a resource allocation result based on phased array radar searching and tracking dual-target optimization.

Description

Resource allocation method based on dual-target optimization of phased array radar search and tracking
Technical Field
The invention belongs to the technical field of radars, and particularly relates to a resource allocation method based on phased array radar searching and tracking dual-target optimization, which is suitable for resource allocation under the condition of limited time resource budget and improves the searching capability of a phased array radar and the tracking precision of a target to the maximum extent.
Background
Recently, advances in technology have enabled the development of agile, multi-tasking phased array radar systems; generally, a phased array radar uses an electronically steered array antenna and thus has extremely high beam flexibility, a characteristic that enables the phased array radar to perform multiple tasks; in fact, different radar functions may have competing demands on system resources, and therefore require the use of automated techniques to allocate resources depending on the capabilities of the radars and their goals; for radar search and tracking (SAT) applications, if one phased array radar detects targets with insufficient time resources, multiple low detectable targets may still not be found; at the same time, if a phased array radar does not have enough time resources to illuminate the previously tracked target, a discontinuous trajectory may result.
Heretofore, many approaches have been applied to the problem of resource allocation, whether a search function or a tracking function or both functions act together; for radar search applications, the challenge is to expand the radar surveillance area and improve the probability of target detection while using as few resources as possible; for target tracking, one may seek to minimize the total radar resources needed to track a target by optimizing the tracking-revisit interval, target signal strength, and detection threshold, and existing work, i.e., resource allocation schemes designed for SAT applications, can be broadly divided into two categories, rule-based and optimization-based; in rule-based schemes, a series of rules are formulated according to some operation requirements or radar features, and although the methods are very effective, the methods are not optimal in Bayesian theory and unpredictable behaviors can occur; another approach is to compute the SAT task by using a single cost function; the radar resource allocation problem may be formulated as a mathematical optimization scheme, and typically the cost function is a weighted sum of metrics corresponding to search capability and tracking accuracy, e.g., probability of detecting a target, tracking bayesian cralmelo lower bound (BCRLB), and expected measured signal-to-noise ratio (SNR); however, the disadvantage of these methods is the selection of weights and the meaningless aggregation of non-corresponding metrics.
Disclosure of Invention
In view of the problems in the prior art, the present invention is directed to a resource allocation method based on dual target search and tracking optimization for a phased array radar, which can solve the problem of resource allocation in a limited illumination time budget and simultaneously improve the search capability of the phased array radar and the tracking accuracy of a target to the maximum extent.
In view of the above problems with the prior art, it is an object of the present invention to design the SAT task resource allocation scheme as a dual target constrained optimization problem and to determine its well-known pareto subset (BK-PS) using the pareto theory. The resource allocation scheme employs two cost functions: (i) emphasizing that the target search capability is maximized in terms of multi-search sector search minimum signal-to-noise ratio (worst case search signal-to-noise ratio (WCS-SNR)); (ii) emphasizing multi-target tracking mean square error minimization in terms of a worst-case tracking Bayesian Cramer lower bound (WCT-BCRLB); in order to discuss the multiple balance between the two targets, a pareto optimal solution set of the two-target problem needs to be found; however, for many dual-objective problems, because the number of solutions in a solution set is large, determining the entire pareto optimal set is practically impossible; thus, a practical approach to dual target optimization is to calculate the BK-PS and represent the pareto optimal set with BK-PS as much as possible, with which one can find a suitable compromise between SAT tasks and select a resource allocation scheme accordingly to meet the specific application requirements.
In order to achieve the technical purpose, the invention is realized by adopting the following technical scheme.
A resource allocation method based on phased array radar searching and tracking dual-target optimization comprises the following steps:
step 1, initialization: order to
Figure GDA0003105725120000021
Is as follows
Figure GDA0003105725120000022
The number of the sub-distribution is equal to the number of the sub-distribution,
Figure GDA0003105725120000023
is set to an initial value of 1,
Figure GDA0003105725120000024
an even number greater than 0; is set to
Figure GDA0003105725120000025
Search area existence of time-controlled array radar in sub-distribution
Figure GDA0003105725120000026
An object, and
Figure GDA0003105725120000027
the search area of the sub-distributed time-controlled array radar is divided into
Figure GDA0003105725120000028
A plurality of non-overlapping search sectors;
step 2, determining
Figure GDA0003105725120000029
Time phased array radar in sub-distribution
Figure GDA00031057251200000210
Search model and method for searching sector
Figure GDA00031057251200000211
During the sub-distribution period
Figure GDA00031057251200000212
A tracking model of the individual target; wherein,
Figure GDA00031057251200000213
is shown as
Figure GDA00031057251200000214
Distributing the number of targets in a search area of the time-controlled array radar in a secondary mode;
Figure GDA00031057251200000215
is shown as
Figure GDA00031057251200000216
The time-controlled array radar searches the total number of sectors in the time distribution;
step 3, according to
Figure GDA00031057251200000217
Time phased array radar in sub-distribution
Figure GDA00031057251200000218
A search model of the search sector, get
Figure GDA00031057251200000219
Searching for objective function and second order of resource allocation scheme during secondary allocation
Figure GDA00031057251200000220
Searching a conversion objective function of the resource allocation scheme during the secondary allocation period;
step 4, according to
Figure GDA00031057251200000221
During the sub-distribution period
Figure GDA00031057251200000222
A tracking model of the object, determining
Figure GDA00031057251200000223
Tracking a target standard function of a resource allocation scheme during the secondary allocation;
step 5, according to
Figure GDA00031057251200000224
Search for transfer objective function and the second of resource allocation scheme during sub-allocation
Figure GDA00031057251200000225
Tracking a target criteria function of the resource allocation scheme during the sub-allocation period to obtain a second
Figure GDA00031057251200000226
A mathematical optimization model of a dual target resource allocation scheme during secondary allocation;
step 6, solving
Figure GDA00031057251200000227
The mathematical optimization model of the double-target resource allocation scheme in the secondary allocation period respectively obtains
Figure GDA00031057251200000228
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000229
Optimal search time resources for non-overlapping search sectors
Figure GDA00031057251200000230
And a first
Figure GDA00031057251200000231
Phased array radar allocation during sub-allocation
Figure GDA0003105725120000031
Tracking time resource column vector optimal solution of each target
Figure GDA0003105725120000032
Step 7, let
Figure GDA0003105725120000033
Adds 1 to the value of (1), returns to step 2 until the phased array radar assignment during the 1 st assignment is obtained
Figure GDA0003105725120000034
Optimal search time resources for non-overlapping search sectors
Figure GDA0003105725120000035
To the first
Figure GDA0003105725120000036
Phased array radar allocation during sub-allocation
Figure GDA0003105725120000037
Optimal search time resources for non-overlapping search sectors
Figure GDA0003105725120000038
And phased array radar assignment during the 1 st assignment
Figure GDA0003105725120000039
Tracking time resource column vector optimal solution of each target
Figure GDA00031057251200000310
To the first
Figure GDA00031057251200000311
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000312
Tracking time resource column vector optimal solution of each target
Figure GDA00031057251200000313
And recording the resource allocation result as a resource allocation result based on dual target searching and tracking of the phased array radar.
The invention has the beneficial effects that:
firstly, the method utilizes the unique structure of a dual-target constraint optimization problem, and can obtain a pareto subset BK-PS by solving a salient pole small maximum optimization (CMO) problem in parallel; in previous studies, in order to obtain the pareto subset BK-PS, researchers developed many methods such as the weighted sum method, the ant colony optimization algorithm, and the genetic algorithm; the method of the invention develops a parallel minimization scheme to research the pareto subset BK-PS by utilizing the unique structure of the dual-objective optimization problem, so that the method of the invention is used as an alternative method for obtaining BK-PS, different pareto solutions can be obtained by solving a plurality of dual-objective problems with different SAT requirements in parallel, each complex dual-objective problem can be divided into two CMO problems, one for a search task and the other for a tracking task, and the solutions of search resource allocation (S-RA) problems corresponding to different SAT requirements are proportional.
Secondly, for different SAT parameters, the minimum search resource allocation problem only needs to be solved once, and as the target function of target tracking resource allocation is nonlinear, the method can obtain a pareto subset BK-PS with a base number of M by solving M +1 CMO problems in parallel; the result shows that the infinitesimal maximum radar search resource allocation problem generates a linear programming model, so that the problem can be solved easily by a famous linear programming method; for the target tracking resource allocation scheme, the generated minimum maximum problem consists of a set of separable monotonically decreasing convex functions, and a minimum maximum solution algorithm can be used for solving the T-RA problem.
Drawings
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
FIG. 1 is a flow chart of a resource allocation method based on dual target optimization for phased array radar search and tracking according to the present invention;
FIG. 2 is a schematic diagram of quantizing the search area of a phased array radar to non-overlapping sectors;
FIG. 3 is a schematic diagram of target deployment within a detection range of a phased array radar;
FIG. 4(a) is a schematic diagram comparing the performance of the resource-averaging allocation scheme with the pareto-based dual-target-optimized resource allocation scheme during the 5 th allocation;
fig. 4(b) is a schematic diagram comparing the performance of the resource average allocation scheme with the pareto-based dual target optimized resource allocation scheme during the 15 th allocation.
Detailed Description
Referring to fig. 1, it is a flowchart of a resource allocation method based on dual target optimization of phased array radar search and tracking according to the present invention; the resource allocation method based on the phased array radar searching and tracking dual-target optimization comprises the following steps:
step 1, initialization: order to
Figure GDA0003105725120000041
Is as follows
Figure GDA0003105725120000042
The number of the sub-distribution is equal to the number of the sub-distribution,
Figure GDA0003105725120000043
is set to an initial value of 1,
Figure GDA0003105725120000044
an even number greater than 0; is set to
Figure GDA0003105725120000045
Search area existence of time-controlled array radar in sub-distribution
Figure GDA0003105725120000046
An object, and
Figure GDA0003105725120000047
the search area of the sub-distributed time-controlled array radar is divided into
Figure GDA0003105725120000048
Non-overlapping search sectors.
Specifically, a phased array radar is determined, and the south-plus-south direction 93km and the west-plus-45 km of the phased array radar are taken as the origin points
Figure GDA0003105725120000049
And establishing a plane rectangular coordinate system by taking the north direction as the Y axis and the east direction as the X axis.
As shown in FIG. 2, let
Figure GDA00031057251200000410
Is as follows
Figure GDA00031057251200000411
The number of the sub-distribution is equal to the number of the sub-distribution,
Figure GDA00031057251200000412
is set to an initial value of 1,
Figure GDA00031057251200000413
is an even number greater than 0, in the present embodiment
Figure GDA00031057251200000414
A value of 20; is set to
Figure GDA00031057251200000415
Search area existence of time-controlled array radar in sub-distribution
Figure GDA00031057251200000416
Object, in the present embodiment
Figure GDA00031057251200000417
The value is 5; and a first
Figure GDA00031057251200000418
The search area of the sub-distributed time-controlled array radar is divided into
Figure GDA00031057251200000419
Non-overlapping search sectors
Figure GDA00031057251200000420
Front side
Figure GDA00031057251200000421
The search regions of the sub-distributed time phased array radar are respectively divided into
Figure GDA00031057251200000422
A number of non-overlapping search sectors that are,rear end
Figure GDA00031057251200000423
The search regions of the sub-distributed time phased array radar are respectively divided into
Figure GDA00031057251200000424
A plurality of non-overlapping search sectors; in this example
Figure GDA00031057251200000425
Step 2, determining
Figure GDA00031057251200000426
Time phased array radar in sub-distribution
Figure GDA00031057251200000427
Search model and method for searching sector
Figure GDA00031057251200000428
During the sub-distribution period
Figure GDA00031057251200000429
A tracking model of the individual target; wherein,
Figure GDA00031057251200000430
is shown as
Figure GDA00031057251200000431
Distributing the number of targets in a search area of the time-controlled array radar in a secondary mode;
Figure GDA00031057251200000432
is shown as
Figure GDA00031057251200000433
And searching the total number of sectors by the phased array radar in the sub-distribution.
Specifically, in order to find an undetected target, the phased array radar needs to allocate its time resources to different search sectors; to further obtainTo the first
Figure GDA00031057251200000434
Time phased array radar in sub-distribution
Figure GDA00031057251200000435
Search sector
Figure GDA00031057251200000436
The search model of (2) is:
Figure GDA00031057251200000437
wherein,
Figure GDA00031057251200000438
a represents an intermediate variable which is,
Figure GDA00031057251200000439
is shown as
Figure GDA00031057251200000440
Time-controlled array radar allocation to the second
Figure GDA0003105725120000051
Search sector
Figure GDA0003105725120000052
The time resources of the search of (2),
Figure GDA0003105725120000053
is shown as
Figure GDA0003105725120000054
Time phased array radar in sub-distribution
Figure GDA0003105725120000055
Search sector
Figure GDA0003105725120000056
The target search signal-to-noise ratio of (c),
Figure GDA0003105725120000057
represents the average transmit power of the phased array radar,
Figure GDA0003105725120000058
indicating the set effective receive aperture of the phased array radar antenna,
Figure GDA0003105725120000059
is shown as
Figure GDA00031057251200000510
Time phased array radar in sub-distribution
Figure GDA00031057251200000511
Search sector
Figure GDA00031057251200000512
The cross-sectional area of scattering of the target,
Figure GDA00031057251200000513
which represents the boltzmann constant, represents,
Figure GDA00031057251200000514
indicating the set phased array radar temperature,
Figure GDA00031057251200000515
the loss of the phased array radar is shown,
Figure GDA00031057251200000516
is shown as
Figure GDA00031057251200000517
Time-controlled array radar scanned by sub-distribution
Figure GDA00031057251200000518
Search sector
Figure GDA00031057251200000519
Angle of (2), in the present embodiment
Figure GDA00031057251200000520
Taking the empirical value of the raw material to be tested,
Figure GDA00031057251200000521
the empirical values of (A) are 6 °, 8 °, 12 °, 16 °;
Figure GDA00031057251200000522
is shown as
Figure GDA00031057251200000523
Time phased array radar in sub-distribution
Figure GDA00031057251200000524
Search sector
Figure GDA00031057251200000525
Target distance search value of, in the present embodiment
Figure GDA00031057251200000526
Taking the empirical value of the raw material to be tested,
Figure GDA00031057251200000527
the empirical values of (A) are 200km, 240km, 295km, 300km and 310 km;
Figure GDA00031057251200000528
can be directly measured according to prior information.
Is set to
Figure GDA00031057251200000529
Number of targets during sub-allocation
Figure GDA00031057251200000530
Is known, in this embodiment
Figure GDA00031057251200000531
Will be first
Figure GDA00031057251200000532
During the sub-distribution period
Figure GDA00031057251200000533
The state vector of each object is recorded as
Figure GDA00031057251200000534
Which represents the transpose of the row vector,
Figure GDA00031057251200000535
is shown as
Figure GDA00031057251200000536
During the sub-distribution period
Figure GDA00031057251200000537
The X-axis directional position of the individual target,
Figure GDA00031057251200000538
is shown as
Figure GDA00031057251200000539
During the sub-distribution period
Figure GDA00031057251200000540
The Y-axis directional position of the individual target,
Figure GDA00031057251200000541
is shown as
Figure GDA00031057251200000542
During the sub-distribution period
Figure GDA00031057251200000543
The velocity of the individual target in the direction of the X-axis,
Figure GDA00031057251200000544
is shown as
Figure GDA00031057251200000545
During the sub-distribution period
Figure GDA00031057251200000546
The speed of the object along the Y-axis direction with the constraint of the first
Figure GDA00031057251200000547
During the sub-distribution period
Figure GDA00031057251200000548
State vector of individual target
Figure GDA00031057251200000549
Dimension of (2)
Figure GDA00031057251200000550
In this example
Figure GDA00031057251200000551
Is shown as
Figure GDA00031057251200000552
And distributing the number of targets in the search area of the phased array radar in time.
Then, first
Figure GDA00031057251200000553
During the sub-distribution period
Figure GDA00031057251200000554
The tracking model for each target is as follows:
Figure GDA00031057251200000555
wherein,
Figure GDA00031057251200000556
is shown as
Figure GDA00031057251200000557
During the sub-distribution period
Figure GDA00031057251200000558
The process noise of the individual target is,
Figure GDA00031057251200000559
is shown as
Figure GDA00031057251200000560
During the sub-distribution period
Figure GDA00031057251200000561
The state vector of the individual objects is,
Figure GDA00031057251200000562
is as follows
Figure GDA00031057251200000563
During the sub-distribution period
Figure GDA00031057251200000564
The transformation matrix of the individual objects is,
Figure GDA00031057251200000565
the expression of the kronecker operator,
Figure GDA00031057251200000566
representing a 2 x 2 dimensional identity matrix, assuming the process is noisy
Figure GDA00031057251200000567
Subject to a mean-zero Gaussian process that is noisy
Figure GDA00031057251200000568
Has a covariance matrix of
Figure GDA00031057251200000569
Indicating the duration of each dispensing period, in this embodiment
Figure GDA00031057251200000570
When in use
Figure GDA00031057251200000571
The 0 th allocation period when the value is 1
Figure GDA00031057251200000572
The state vector of the individual target is noted as
Figure GDA00031057251200000573
Initial state vector of individual target
Figure GDA0003105725120000061
First, the
Figure GDA0003105725120000062
Process noise of initial state vector of individual target
Figure GDA0003105725120000063
Is as follows
Figure GDA0003105725120000064
The process of each target is noisy with respect to the random number during initial assignment.
First, the
Figure GDA0003105725120000065
During the sub-distribution period
Figure GDA0003105725120000066
The measured value of each target is
Figure GDA0003105725120000067
The expression is as follows:
Figure GDA0003105725120000068
in the formula (3)
Figure GDA0003105725120000069
Wherein,
Figure GDA00031057251200000610
is shown as
Figure GDA00031057251200000611
During the sub-distribution period
Figure GDA00031057251200000612
State vector of individual target
Figure GDA00031057251200000613
Is/are as follows
Figure GDA00031057251200000614
The dimensional non-linear distance and orientation measurement functions,
Figure GDA00031057251200000659
representing the coordinates of the phased array radar in a planar rectangular coordinate system,
Figure GDA00031057251200000661
the position of the phased array radar in the X-axis direction in a plane rectangular coordinate system is represented,
Figure GDA00031057251200000660
the position of the phased array radar in the Y-axis direction in a plane rectangular coordinate system is represented,
Figure GDA00031057251200000615
is shown as
Figure GDA00031057251200000616
During the sub-distribution period
Figure GDA00031057251200000617
The position information of the individual objects is determined,
Figure GDA00031057251200000618
is shown as
Figure GDA00031057251200000619
During the sub-distribution period
Figure GDA00031057251200000620
The radial distance of an individual target from the phased array radar,
Figure GDA00031057251200000621
is shown as
Figure GDA00031057251200000622
During the sub-distribution period
Figure GDA00031057251200000623
The X-axis directional position of the individual target,
Figure GDA00031057251200000624
is shown as
Figure GDA00031057251200000625
During the sub-distribution period
Figure GDA00031057251200000626
Y-axis position of individual target, superscript
Figure GDA00031057251200000627
Indicating transpose and arctan for arctan.
Will be first
Figure GDA00031057251200000628
During the sub-distribution period
Figure GDA00031057251200000629
The error of each target is recorded as
Figure GDA00031057251200000630
Set error
Figure GDA00031057251200000631
Is mean zero uncoupledResultant measurement error of
Figure GDA00031057251200000632
During the sub-distribution period
Figure GDA00031057251200000633
Error of individual target
Figure GDA00031057251200000634
Is a diagonal covariance matrix of
Figure GDA00031057251200000635
Figure GDA00031057251200000636
Wherein,
Figure GDA00031057251200000637
is shown as
Figure GDA00031057251200000638
During the sub-distribution period
Figure GDA00031057251200000639
The range of each target estimates the lower boundary of the cramer-circle of mean square error,
Figure GDA00031057251200000640
is shown as
Figure GDA00031057251200000641
During the sub-distribution period
Figure GDA00031057251200000642
The lower boundary of the Cramer-Rao bound of the mean square error of the azimuth information estimation of each target is respectively as follows:
Figure GDA00031057251200000643
wherein,
Figure GDA00031057251200000644
the speed of light is indicated and is,
Figure GDA00031057251200000645
it is shown that the set constant is,
Figure GDA00031057251200000646
is shown as
Figure GDA00031057251200000647
During the sub-distribution period
Figure GDA00031057251200000648
The expected measured echo signal to noise ratio (signal-to-noise ratio) for an individual target,
Figure GDA00031057251200000649
is shown as
Figure GDA00031057251200000650
During the sub-distribution period
Figure GDA00031057251200000651
The reflectivity of the individual target is such that,
Figure GDA00031057251200000652
is shown as
Figure GDA00031057251200000653
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200000654
The tracking time resources of the individual targets,
Figure GDA00031057251200000655
is shown as
Figure GDA00031057251200000656
During the sub-distribution period
Figure GDA00031057251200000657
The radial distance of an individual target to the phased array radar,
Figure GDA00031057251200000658
is shown as
Figure GDA0003105725120000071
The-3 dB bandwidth of the electromagnetic wave signals transmitted by the phased array radar during the sub-distribution period is marked with the-1 to represent inversion,
Figure GDA0003105725120000072
is shown as
Figure GDA0003105725120000073
-3dB beamwidth of the phased array radar antenna during the secondary allocation; in this example
Figure GDA0003105725120000074
Due to the fact that
Figure GDA0003105725120000075
During the sub-distribution period
Figure GDA0003105725120000076
Cramer-Rao bound lower bound of mean squared error of range estimates for individual targets
Figure GDA0003105725120000077
First, the
Figure GDA0003105725120000078
During the sub-distribution period
Figure GDA0003105725120000079
Cramer-Rao bound lower bound of mean square error of azimuth information estimation of individual targets
Figure GDA00031057251200000710
Electromagnetic wave signal-3 dB bandwidth
Figure GDA00031057251200000711
-3dB beamwidth
Figure GDA00031057251200000712
Sum signal to noise ratio
Figure GDA00031057251200000713
All with tracking time resources
Figure GDA00031057251200000714
Is inversely proportional, therefore will be
Figure GDA00031057251200000715
During the sub-distribution period
Figure GDA00031057251200000716
Error of individual target
Figure GDA00031057251200000717
The diagonal covariance matrix of (A) extracts common factors
Figure GDA00031057251200000718
The post rewrite is:
Figure GDA00031057251200000719
wherein,
Figure GDA00031057251200000720
is shown as
Figure GDA00031057251200000721
During the sub-distribution period
Figure GDA00031057251200000722
The remaining matrix of the individual objects is,
Figure GDA00031057251200000723
step 3, according to
Figure GDA00031057251200000724
Time phased array radar in sub-distribution
Figure GDA00031057251200000725
A search model of the search sector, get
Figure GDA00031057251200000726
Searching for objective function and second order of resource allocation scheme during secondary allocation
Figure GDA00031057251200000727
The conversion objective function of the resource allocation scheme is searched during the secondary allocation.
Specifically, for the second
Figure GDA00031057251200000728
During the sub-distribution period
Figure GDA00031057251200000729
The search sectors are not overlapped, and the search resource allocation of the phased array radar aims to optimally allocate search time resources to a plurality of areas and maximize the search signal-to-noise ratio under the worst condition; by using
Figure GDA00031057251200000730
Is shown as
Figure GDA00031057251200000731
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000732
Search time column vectors of non-overlapping search sectors, a
Figure GDA00031057251200000733
The objective function of searching the resource allocation scheme during the secondary allocation is:
Figure GDA00031057251200000734
wherein,
Figure GDA00031057251200000735
is shown as
Figure GDA00031057251200000736
During the sub-distribution period
Figure GDA00031057251200000737
A set of non-overlapping search sector numbers,
Figure GDA00031057251200000738
Figure GDA00031057251200000739
a constraint condition is expressed in terms of the number of the elements,
Figure GDA00031057251200000740
is shown as
Figure GDA00031057251200000741
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000742
The total search time resources of the non-overlapping search sectors,
Figure GDA00031057251200000743
is shown as
Figure GDA00031057251200000744
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200000745
Search time resources of the respective search sectors; the first constraint in equation (8) indicates that
Figure GDA00031057251200000746
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000747
The total search time resources of the non-overlapping search sectors are
Figure GDA00031057251200000748
The second constraint states that
Figure GDA00031057251200000749
The search time resources allocated to each search sector by phased array radar during the sub-allocation are limited by a minimum value, i.e. the second
Figure GDA00031057251200000750
The search time resources allocated to each search sector by the phased array radar during the sub-allocation are greater than or equal to 0.
As is readily known, a maximized object type can be converted into a minimized object type by inversion; therefore, the search resource allocation problem of equation (8) can be newly formulated as the second
Figure GDA0003105725120000081
Search for the transfer objective function of the resource allocation scheme during the secondary allocation:
Figure GDA0003105725120000082
wherein,
Figure GDA0003105725120000083
is shown as
Figure GDA0003105725120000084
The convex function during the sub-allocation period,
Figure GDA0003105725120000085
is shown as
Figure GDA0003105725120000086
Search sector 1 to search sector 1 during sub-allocation
Figure GDA0003105725120000087
The search sectors search the accumulated sum of time resources, alpha represents an intermediate variable,
Figure GDA0003105725120000088
representation calculation
Figure GDA0003105725120000089
The minimum value of (a) is determined,
Figure GDA00031057251200000810
representing a set of computations
Figure GDA00031057251200000811
Ratio of each search sector in the search
Figure GDA00031057251200000812
Then obtain
Figure GDA00031057251200000813
A ratio is then compared
Figure GDA00031057251200000814
The ratio value is then used to select the maximum value operation.
Step 4, according to
Figure GDA00031057251200000815
During the sub-distribution period
Figure GDA00031057251200000816
A tracking model of the object, determining
Figure GDA00031057251200000817
An objective criteria function of the resource allocation scheme is tracked during the secondary allocation.
Specifically, for multi-target tracking, the time resources can be optimized according to the previous tracking informationThe tracking performance of a plurality of targets under the worst condition is improved; here, WCT-BCRLB is used as a standard function, and a target function of a target tracking resource allocation problem is made to be the second
Figure GDA00031057251200000818
Target criteria function for tracking resource allocation scheme during sub-allocation:
Figure GDA00031057251200000819
wherein,
Figure GDA00031057251200000820
is shown as
Figure GDA00031057251200000821
During the sub-distribution period
Figure GDA00031057251200000822
A set of object numbers, each object number being,
Figure GDA00031057251200000823
is shown as
Figure GDA00031057251200000824
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000825
A tracking time resource column vector for each target,
Figure GDA00031057251200000826
is shown as
Figure GDA00031057251200000827
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200000828
The tracking time resources of the individual targets,
Figure GDA00031057251200000829
is shown as
Figure GDA00031057251200000830
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000831
Total tracking time resources of the individual targets;
Figure GDA00031057251200000832
expression solution
Figure GDA00031057251200000833
The minimum value of (a) is determined,
Figure GDA00031057251200000834
representing normalized worst case
Figure GDA00031057251200000835
During the sub-distribution period
Figure GDA00031057251200000836
Tracking a Bayesian Claritrol lower bound convex function of each target; the first constraint indicates
Figure GDA00031057251200000837
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000838
The total tracking time resource of each target is
Figure GDA00031057251200000839
And the second constraint denotes
Figure GDA00031057251200000840
The tracking time resources allocated to each target by the phased array radar during the secondary allocation are limited by a minimum value, i.e. the second
Figure GDA00031057251200000841
The tracking time resource allocated to each target by the phased array radar during the secondary allocation period is greater than or equal to 0; the normalized worst case first
Figure GDA00031057251200000842
During the sub-distribution period
Figure GDA00031057251200000843
Tracking Bayesian Claritrol lower bound convex function of each target
Figure GDA0003105725120000091
The expression is as follows:
Figure GDA0003105725120000092
wherein,
Figure GDA0003105725120000093
representation matrix
Figure GDA0003105725120000094
And Λ represents a standardized matrix, and shows that the elements of the bayesian cramer lower bound matrix are on different scales, and the expression is as follows:
Figure GDA0003105725120000096
Figure GDA0003105725120000097
indicating the duration of each dispensing period, in this embodiment
Figure GDA0003105725120000098
Representation collection
Figure GDA0003105725120000099
Each of the other eyeThe marks correspond to
Figure GDA00031057251200000910
A medium maximum value;
Figure GDA00031057251200000911
is shown as
Figure GDA00031057251200000912
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200000913
Tracking time resource of individual target
Figure GDA00031057251200000914
The Bayesian Clarithrome lower bound matrix of (2) has the expression:
Figure GDA00031057251200000915
wherein,
Figure GDA00031057251200000916
is shown as
Figure GDA00031057251200000917
During the sub-distribution period
Figure GDA00031057251200000918
A predicted Bayesian information matrix of the observed state of each target,
Figure GDA00031057251200000919
obtained by the following formula:
Figure GDA00031057251200000920
wherein,
Figure GDA00031057251200000921
is to show to
Figure GDA00031057251200000922
During the sub-distribution period
Figure GDA00031057251200000923
State vector of individual target
Figure GDA00031057251200000924
Is/are as follows
Figure GDA00031057251200000925
Dimensional non-linear distance and orientation measurement function
Figure GDA00031057251200000926
Is transferred to
Figure GDA00031057251200000927
With respect to state vectors
Figure GDA00031057251200000928
Δ represents the amount of change of the measured value,
Figure GDA00031057251200000929
is shown as
Figure GDA00031057251200000930
During the sub-distribution period
Figure GDA00031057251200000931
The state vector of the individual objects is,
Figure GDA00031057251200000932
is shown as
Figure GDA00031057251200000933
During the sub-distribution period
Figure GDA00031057251200000934
Of a single object
Figure GDA00031057251200000935
A matrix of the Wijacobi is formed,
Figure GDA00031057251200000936
it is shown that the set constant is,
Figure GDA00031057251200000937
show that
Figure GDA00031057251200000938
Value of
Figure GDA00031057251200000939
In (1),
Figure GDA00031057251200000940
to represent
Figure GDA00031057251200000941
Is given a value of
Figure GDA00031057251200000942
Calculating the value of the point; when in use
Figure GDA00031057251200000943
First 0 time during the dispensing
Figure GDA00031057251200000944
State vector of individual target
Figure GDA00031057251200000945
Is shown as
Figure GDA00031057251200000946
During the sub-distribution period
Figure GDA00031057251200000947
Process noise of individual target
Figure GDA00031057251200000948
The covariance matrix of (a) is determined,
Figure GDA00031057251200000949
is as follows
Figure GDA00031057251200000950
During the sub-distribution period
Figure GDA00031057251200000951
The transformation matrix of the individual objects is,
Figure GDA00031057251200000952
is shown as
Figure GDA00031057251200000953
Phased array radar allocation during sub-allocation
Figure GDA00031057251200000954
A tracking time resource column vector for each target,
Figure GDA00031057251200000955
is shown as
Figure GDA00031057251200000956
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200000957
The tracking time resources of the individual targets,
Figure GDA00031057251200000958
is shown as
Figure GDA00031057251200000959
During the sub-distribution period
Figure GDA00031057251200000960
The remaining matrix of each object, superscript-1, represents the inversion,
Figure GDA00031057251200000961
representing a row vector transpose.
Step 5, according to
Figure GDA00031057251200000962
Search for transfer objective function and the second of resource allocation scheme during sub-allocation
Figure GDA00031057251200000963
Tracking a target criteria function of the resource allocation scheme during the sub-allocation period to obtain a second
Figure GDA00031057251200000964
A mathematical optimization model of a dual target resource allocation scheme during secondary allocation.
In particular, the capabilities of phased array radars present a significant challenge to radar resource managers, which must determine during each assignment whether the radar should search for new targets or track existing targets; under the ideal condition, the maximization of the searching capability and the multi-target tracking precision are two mutually conflicting targets and must be considered simultaneously; thus, first
Figure GDA0003105725120000101
The mathematical model of a dual target resource allocation scheme for phased array radar integrated SAT application during sub-allocation can be written as:
Figure GDA0003105725120000102
wherein,
Figure GDA0003105725120000103
showing obtained
Figure GDA0003105725120000104
And
Figure GDA0003105725120000105
at the same time make
Figure GDA0003105725120000106
And
Figure GDA0003105725120000107
the size of the particles is minimized and,
Figure GDA0003105725120000108
is shown as
Figure GDA0003105725120000109
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001010
The total search time resources of the non-overlapping search sectors,
Figure GDA00031057251200001011
is shown as
Figure GDA00031057251200001012
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001013
The total tracking time resources of the individual targets,
Figure GDA00031057251200001014
is shown as
Figure GDA00031057251200001015
Integrating the total time resources of phased array radar search and tracking applications during the secondary allocation; the last constraint is indicated in
Figure GDA00031057251200001016
The total resource of the integrated phased array radar search and tracking application during the sub-allocation is
Figure GDA00031057251200001017
Is shown as
Figure GDA00031057251200001018
The duty cycle during the sub-dispensing period,
Figure GDA00031057251200001019
is shown as
Figure GDA00031057251200001020
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200001021
The search time resources of each search sector,
Figure GDA00031057251200001022
is shown as
Figure GDA00031057251200001023
During the second allocation period phased array radar is allocated to the second
Figure GDA00031057251200001024
The tracking time resources of the individual targets,
Figure GDA00031057251200001025
is shown as
Figure GDA00031057251200001026
The convex function during the sub-allocation period,
Figure GDA00031057251200001027
representing normalized worst case
Figure GDA00031057251200001028
During the sub-distribution period
Figure GDA00031057251200001029
The tracked Bayesian Clarithrome lower bound convex function of each target,
Figure GDA00031057251200001030
is shown as
Figure GDA00031057251200001031
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001032
A search time column vector of non-overlapping search sectors,
Figure GDA00031057251200001033
is shown as
Figure GDA00031057251200001034
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001035
A tracking time resource column vector for each target.
Will be first
Figure GDA00031057251200001036
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001037
Search time column vector of non-overlapping search sectors
Figure GDA00031057251200001038
And a first
Figure GDA00031057251200001039
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001040
Tracking time resource column vector of individual targets
Figure GDA00031057251200001041
Integrated into a single vector, denoted
Figure GDA00031057251200001042
Dimension vector
Figure GDA00031057251200001043
Representing a row vector transpose; further obtain the first
Figure GDA00031057251200001044
The mathematical optimization model of the dual-target resource allocation scheme during the secondary allocation period is as follows:
Figure GDA0003105725120000111
wherein,
Figure GDA0003105725120000112
is shown as
Figure GDA00031057251200001128
The convex function during the sub-allocation period,
Figure GDA0003105725120000113
representing normalized worst case
Figure GDA00031057251200001127
During the sub-distribution period
Figure GDA00031057251200001126
The tracked Bayesian Clarithrome lower bound convex function of each target,
Figure GDA0003105725120000114
is expressed as length of
Figure GDA00031057251200001129
And before
Figure GDA00031057251200001130
A row vector with 1 element and zero elements,
Figure GDA0003105725120000115
is expressed as length of
Figure GDA00031057251200001131
And from the second
Figure GDA00031057251200001132
Element to element
Figure GDA00031057251200001133
A row vector with 1 element and 0 elements,
Figure GDA0003105725120000116
representing row vectors
Figure GDA0003105725120000117
To middle
Figure GDA00031057251200001134
An element; the first constraint indicates
Figure GDA00031057251200001135
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001136
The total search time resources of the non-overlapping search sectors are
Figure GDA00031057251200001124
First, the
Figure GDA00031057251200001125
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001123
The total tracking time resource of each target is
Figure GDA00031057251200001122
The second constraint indicates
Figure GDA00031057251200001160
The searching time of each searching sector and the tracking time of each target in the secondary distribution period are both more than or equal to 0; the last constraint indicates
Figure GDA00031057251200001137
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001121
Total search time resources for non-overlapping search sectors
Figure GDA00031057251200001117
And a first
Figure GDA00031057251200001139
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001138
Total tracking time resource of each target
Figure GDA00031057251200001118
Is a sum of
Figure GDA00031057251200001119
The total time resource of the integrated phased array radar search and tracking application during the sub-allocation is
Figure GDA00031057251200001120
Step 6, solving
Figure GDA00031057251200001140
The mathematical optimization model of the double-target resource allocation scheme in the secondary allocation period respectively obtains
Figure GDA00031057251200001142
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001141
Optimal search time resources for non-overlapping search sectors
Figure GDA0003105725120000118
And a first
Figure GDA00031057251200001143
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001144
Tracking time resource column vector optimal solution of each target
Figure GDA0003105725120000119
The substep of step 6 is:
6.1 in order to obtain pareto subsets (the solutions obtained by different overall search budget solutions (9) are mutually independent, and the solutions obtained by different overall tracking budget solution problems (10) are mutually independent); is set to
Figure GDA00031057251200001145
During the sub-distribution period
Figure GDA00031057251200001146
Total search budget and
Figure GDA00031057251200001147
an overall tracking budget, in this embodiment
Figure GDA00031057251200001148
From 1 st total search budget to
Figure GDA00031057251200001149
The total search budget satisfies:
Figure GDA00031057251200001110
wherein
Figure GDA00031057251200001111
Is shown as
Figure GDA00031057251200001150
During the sub-distribution period
Figure GDA00031057251200001151
Total search budget, will
Figure GDA00031057251200001152
During the sub-distribution period
Figure GDA00031057251200001153
Total tracking budget as
Figure GDA00031057251200001112
And the first
Figure GDA00031057251200001154
During the sub-distribution period
Figure GDA00031057251200001155
Total search budget
Figure GDA00031057251200001113
And a first
Figure GDA00031057251200001156
During the sub-distribution period
Figure GDA00031057251200001157
Total tracking budget
Figure GDA00031057251200001114
Satisfies the following conditions:
Figure GDA00031057251200001115
wherein
Figure GDA00031057251200001158
Is shown as
Figure GDA00031057251200001159
The total time resources of the phased array radar search and tracking application are integrated during the secondary allocation.
6.2 according to the first
Figure GDA00031057251200001230
During the sub-distribution period
Figure GDA00031057251200001231
Total search budget
Figure GDA0003105725120000121
And linear programming to solve equation (9)
Figure GDA00031057251200001232
During the sub-distribution period
Figure GDA00031057251200001233
Total search budget
Figure GDA0003105725120000122
Substituting the right side of the first constraint condition in the formula (9) to obtain the second constraint condition according to a linear programming method
Figure GDA00031057251200001234
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001235
Search time vector pair of non-overlapping search sectors
Figure GDA00031057251200001236
Optimal solution for individual search budget resource allocation
Figure GDA0003105725120000123
According to the first
Figure GDA00031057251200001237
During the sub-distribution period
Figure GDA00031057251200001238
Total tracking budget
Figure GDA0003105725120000124
And maximum and minimum solution algorithm solving equation (10), i.e. the first
Figure GDA00031057251200001239
During the sub-distribution period
Figure GDA00031057251200001240
Total tracking budget
Figure GDA0003105725120000125
Substituting the right side of the first constraint condition in the step (10), and obtaining the second constraint condition according to a maximum and minimum solution algorithm
Figure GDA00031057251200001242
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001241
Tracking time resource column vector pair of individual targets
Figure GDA00031057251200001243
Optimal solution for individual total tracking budget resource allocation
Figure GDA0003105725120000126
Subscript
Figure GDA00031057251200001244
Is shown as
Figure GDA00031057251200001245
Sub-distribution period, subscript
Figure GDA00031057251200001275
Denotes a search, subscript
Figure GDA00031057251200001276
Denotes trace, subscript
Figure GDA00031057251200001277
Representing an optimal solution; will be the first
Figure GDA00031057251200001246
Total searchOptimal solution for allocation of cable budget resources
Figure GDA0003105725120000127
And the said first
Figure GDA00031057251200001247
Optimal solution for individual total tracking budget resource allocation
Figure GDA0003105725120000128
Form two target resources
Figure GDA00031057251200001248
The second of the sub-distribution (equation (16))
Figure GDA00031057251200001249
Pareto optimal solution
Figure GDA0003105725120000129
Figure GDA00031057251200001210
(parallel minimization scheme) in which superscripts are applied
Figure GDA00031057251200001250
Second to indicate transposed, dual target resource allocation
Figure GDA00031057251200001251
Pareto optimal solution
Figure GDA00031057251200001211
Included
Figure GDA00031057251200001252
And (4) each element.
6.3 order
Figure GDA00031057251200001253
Are respectively 1 to
Figure GDA00031057251200001255
Repeatedly executing 6.2 until obtaining the second target resource
Figure GDA00031057251200001254
First pareto optimal solution of sub-distribution
Figure GDA00031057251200001212
To the two target resources
Figure GDA00031057251200001256
Second of the sub distribution
Figure GDA00031057251200001257
Pareto optimal solution
Figure GDA00031057251200001213
Is expressed as a base number
Figure GDA00031057251200001258
Pareto subsets of
Figure GDA00031057251200001259
Due to the fact that for the first
Figure GDA00031057251200001260
Any two different total search budgets during sub-allocation
Figure GDA00031057251200001215
And
Figure GDA00031057251200001216
upper label
Figure GDA00031057251200001270
Is shown as
Figure GDA00031057251200001271
Individual total search budget, superscript
Figure GDA00031057251200001267
Is shown as
Figure GDA00031057251200001268
The total search budget for the search is,
Figure GDA00031057251200001266
is shown as
Figure GDA00031057251200001261
During the sub-distribution period
Figure GDA00031057251200001269
The total search budget for the search is,
Figure GDA00031057251200001218
is shown as
Figure GDA00031057251200001262
During the sub-distribution period
Figure GDA00031057251200001274
Total search budget, of
Figure GDA00031057251200001263
During the sub-distribution period
Figure GDA00031057251200001272
Optimal solution for individual search budget resource allocation
Figure GDA00031057251200001219
And a first
Figure GDA00031057251200001264
During the sub-distribution period
Figure GDA00031057251200001273
Optimal solution for individual search budget resource allocation
Figure GDA00031057251200001220
Has the following relationship
Figure GDA00031057251200001221
Therefore, it is caused by
Figure GDA00031057251200001265
One of the total search budgets during the sub-allocation and the optimal solution sum of the search budget resource allocation
Figure GDA00031057251200001222
The proportional relationship between the total search budgets can be obtained
Figure GDA00031057251200001223
The total search budget is related to the solution of equation (9) respectively.
According to the cardinality of
Figure GDA00031057251200001224
Pareto subsets of
Figure GDA00031057251200001225
The calculation base is
Figure GDA00031057251200001226
Pareto subsets of
Figure GDA00031057251200001227
The function value of each optimal solution in the system is defined as the base number
Figure GDA00031057251200001228
Pareto subsets of
Figure GDA00031057251200001229
The function value of each optimal solution is respectively marked as a pareto point, and then the second solution is obtained
Figure GDA00031057251200001351
Pareto point set of time-controlled array radar for sub-distribution
Figure GDA0003105725120000131
Figure GDA0003105725120000132
Figure GDA0003105725120000133
Figure GDA0003105725120000134
(just before calculation)
Figure GDA00031057251200001336
One element), a represents an intermediate variable,
Figure GDA00031057251200001337
is shown as
Figure GDA00031057251200001352
Time phased array radar in sub-distribution
Figure GDA00031057251200001373
Search sector
Figure GDA00031057251200001339
Is calculated from the target distance of (a) to the target distance search value,
Figure GDA00031057251200001338
is shown as
Figure GDA00031057251200001353
Time-controlled array radar scanned by sub-distribution
Figure GDA00031057251200001371
Search sector
Figure GDA00031057251200001340
The angle of (a) is determined,
Figure GDA00031057251200001341
is shown as
Figure GDA00031057251200001354
During the sub-distribution period
Figure GDA00031057251200001342
A set of non-overlapping search sector numbers,
Figure GDA00031057251200001343
is shown as
Figure GDA00031057251200001355
Sub-distribution phase-controlled array radar 1 st pareto optimal solution
Figure GDA0003105725120000136
The function value of (a) is determined,
Figure GDA0003105725120000137
is shown as
Figure GDA00031057251200001356
Time phased array radar with sub-distribution
Figure GDA00031057251200001370
Pareto optimal solution
Figure GDA0003105725120000138
The function value of (a) is determined,
Figure GDA0003105725120000139
is shown as
Figure GDA00031057251200001357
Time phased array radar with sub-distribution
Figure GDA00031057251200001372
Pareto optimal solution
Figure GDA00031057251200001310
The function value of (1).
By using the first
Figure GDA00031057251200001358
During the sub-distribution periodConvex function of
Figure GDA00031057251200001311
Monotonicity of, i.e.
Figure GDA00031057251200001312
Figure GDA00031057251200001313
Indicating two target resources
Figure GDA00031057251200001359
Sub-assigned [ gamma ] pareto optimal solution
Figure GDA00031057251200001314
The function value of (a) is determined,
Figure GDA00031057251200001315
indicating two target resources
Figure GDA00031057251200001360
Pareto optimal solution of the beta of the sub-distribution
Figure GDA00031057251200001316
The function value of (a) is determined,
Figure GDA00031057251200001317
Figure GDA00031057251200001318
is shown as
Figure GDA00031057251200001361
The optimal solution for the beta total search budget resource allocation during the secondary allocation,
Figure GDA00031057251200001319
represents the optimal solution for the beta total tracking budget resource allocation,
Figure GDA00031057251200001320
is shown as
Figure GDA00031057251200001362
The optimal solution for the gamma th overall search budget resource allocation during the sub-allocation,
Figure GDA00031057251200001321
an optimal solution representing the gamma total tracking budget resource allocation; the upper level t represents the transpose,
Figure GDA00031057251200001344
is shown as
Figure GDA00031057251200001346
During the sub-distribution period
Figure GDA00031057251200001345
The worst-case search signal-to-noise ratio in the non-overlapping search sectors,
Figure GDA00031057251200001347
and
Figure GDA00031057251200001323
are the function values of two adjacent pareto optimal solutions.
From two pareto optimal solutions
Figure GDA00031057251200001324
And
Figure GDA00031057251200001325
two total search budgets can be derived
Figure GDA00031057251200001326
And
Figure GDA00031057251200001327
Figure GDA00031057251200001328
is shown as
Figure GDA00031057251200001363
The beta total search budget during the secondary allocation period is the second of the dual target resources
Figure GDA00031057251200001364
Pareto optimal solution of the beta of the sub-distribution
Figure GDA00031057251200001329
Middle front
Figure GDA00031057251200001365
A cumulative sum of the elements;
Figure GDA00031057251200001330
is shown as
Figure GDA00031057251200001366
The gamma total search budget during the sub-allocation period is the second of the dual target resources
Figure GDA00031057251200001367
Sub-assigned [ gamma ] pareto optimal solution
Figure GDA00031057251200001331
Middle front
Figure GDA00031057251200001348
A cumulative sum of the elements; budget for two total searches
Figure GDA00031057251200001332
And
Figure GDA00031057251200001333
using a dichotomy to obtain
Figure GDA00031057251200001368
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001349
Maximum of non-overlapping search sectorsOptimal total search time resources
Figure GDA00031057251200001334
And a first
Figure GDA00031057251200001369
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001350
Optimal total tracking time resource of each target
Figure GDA00031057251200001335
The optimal total search time resource
Figure GDA0003105725120000141
Substitute into
Figure GDA00031057251200001428
Searching the conversion objective function of the resource allocation scheme during the sub-allocation period, and solving by using a linear programming method to obtain the second
Figure GDA00031057251200001429
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001418
Optimal search time resources for non-overlapping search sectors
Figure GDA0003105725120000142
The optimal total tracking time resource
Figure GDA0003105725120000143
Substitute into
Figure GDA00031057251200001430
Tracking the target standard function of the resource allocation scheme during the sub-allocation period, and obtaining the first time by utilizing a minimum maximum solution algorithm
Figure GDA00031057251200001431
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001419
Tracking time resource column vector optimal solution of each target
Figure GDA0003105725120000144
Wherein,
Figure GDA0003105725120000145
is the first
Figure GDA00031057251200001432
The optimal search resource allocation result during the sub-allocation,
Figure GDA0003105725120000146
is the first
Figure GDA00031057251200001433
Optimal target tracking resource allocation results during sub-allocation, the first
Figure GDA00031057251200001434
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001420
Optimal total search time resources for non-overlapping search sectors
Figure GDA0003105725120000147
And the said first
Figure GDA00031057251200001435
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001421
Optimal total tracking time resource of each target
Figure GDA0003105725120000148
As a sum of
Figure GDA00031057251200001436
Total time resources for integrated phased array radar search and tracking applications during sub-allocation
Figure GDA00031057251200001422
The method comprises the following specific steps:
6a) separately setting iteration indexes
Figure GDA00031057251200001449
And a stop threshold ε of 10-3And is provided with
Figure GDA00031057251200001437
Searching for lower bounds of resources during secondary allocation
Figure GDA0003105725120000149
And a first
Figure GDA00031057251200001438
Searching for upper bounds of resources during secondary allocation
Figure GDA00031057251200001410
Figure GDA00031057251200001411
Is shown as
Figure GDA00031057251200001439
The beta total search budget during the secondary allocation,
Figure GDA00031057251200001412
is shown as
Figure GDA00031057251200001440
A gamma total search budget during the secondary allocation; wherein, gamma is beta +1,
Figure GDA00031057251200001448
is shown as
Figure GDA00031057251200001441
The total search budget number or the total tracking budget number set in the secondary allocation period.
6b) According to the first
Figure GDA00031057251200001442
Searching for lower bounds of resources during secondary allocation
Figure GDA00031057251200001455
And a first
Figure GDA00031057251200001443
Searching for upper bounds of resources during secondary allocation
Figure GDA00031057251200001456
Calculate the first
Figure GDA00031057251200001453
After the second iteration
Figure GDA00031057251200001444
Total search resources for phased array radar during secondary allocation
Figure GDA00031057251200001423
Then use the first
Figure GDA00031057251200001454
After the second iteration
Figure GDA00031057251200001445
Total search resources for phased array radar during secondary allocation
Figure GDA00031057251200001424
And linear programming method to solve
Figure GDA00031057251200001446
Searching resource allocation during secondary allocationConverting the objective function of the scheme to obtain
Figure GDA00031057251200001450
After the second iteration
Figure GDA00031057251200001447
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001425
Search time column vector optimal solution for non-overlapping search sectors
Figure GDA00031057251200001413
6c) If it is not
Figure GDA00031057251200001414
Updating
Figure GDA00031057251200001426
Order to
Figure GDA00031057251200001451
Add 1 to the value of (6 b); otherwise 6d) is executed.
6d) If it is not
Figure GDA00031057251200001415
Updating
Figure GDA00031057251200001427
Order to
Figure GDA00031057251200001452
Add 1 to the value of (6 b); otherwise 6e) is executed.
6e) If it is not
Figure GDA00031057251200001416
Get
Figure GDA00031057251200001417
Search for the optimal solution for resource allocation as
Figure GDA00031057251200001520
Is shown as
Figure GDA00031057251200001530
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001531
The optimal search time resources of the non-overlapping search sectors,
Figure GDA0003105725120000153
is shown as
Figure GDA00031057251200001543
After the second iteration
Figure GDA00031057251200001532
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001521
The search time vector optimal solution of the non-overlapping search sectors.
6f) Calculate the first
Figure GDA00031057251200001533
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001522
Optimal total tracking time resource of each target
Figure GDA0003105725120000154
Figure GDA0003105725120000155
Wherein,
Figure GDA00031057251200001523
is shown as
Figure GDA00031057251200001534
The total resources of the integrated phased array radar search and tracking application during the sub-allocation,
Figure GDA00031057251200001524
is shown as
Figure GDA00031057251200001535
The duty cycle during the sub-dispensing period,
Figure GDA00031057251200001525
indicating the duration of each dispensing period, in this embodiment
Figure GDA00031057251200001526
6g) The optimal total tracking time resource
Figure GDA0003105725120000156
Substitute into
Figure GDA00031057251200001536
Tracking the target standard function of the resource allocation scheme during the sub-allocation period, and obtaining the first time by utilizing a minimum maximum solution algorithm
Figure GDA00031057251200001537
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001527
Tracking time resource column vector optimal solution of each target
Figure GDA0003105725120000157
Step 7, let
Figure GDA00031057251200001538
Adds 1 to the value of (1), returns to step 2 until the phased array radar assignment during the 1 st assignment is obtained
Figure GDA00031057251200001539
Of non-overlapping search sectorsOptimal search time resource
Figure GDA0003105725120000158
To the first
Figure GDA00031057251200001540
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001528
Optimal search time resources for non-overlapping search sectors
Figure GDA0003105725120000159
And phased array radar assignment during the 1 st assignment
Figure GDA00031057251200001541
Tracking time resource column vector optimal solution of each target
Figure GDA00031057251200001510
To the first
Figure GDA00031057251200001542
Phased array radar allocation during sub-allocation
Figure GDA00031057251200001529
Tracking time resource column vector optimal solution of each target
Figure GDA00031057251200001511
Recording as a resource allocation result based on phased array radar searching and tracking dual-target optimization; this example is to get
Figure GDA00031057251200001512
The invention makes a resource allocation scheme into a dual-target optimization framework, and obtains a cardinal number of the resource allocation scheme according to a parallel minimization scheme
Figure GDA00031057251200001513
Pareto subsets of (a); then using linear programmingThe method and the minimum and maximum solution algorithm effectively solve the problem of dual-target resource allocation.
The effects of the present invention are further verified and explained by the following simulations.
1. Simulation parameters:
the fixed position of the phased array radar is (93,45) km, and the effective signal bandwidth and the half-power beam width are respectively set to be
Figure GDA00031057251200001514
And
Figure GDA00031057251200001515
the total time resource is
Figure GDA00031057251200001516
The simulation was performed using a 20 dispense period, with the duration of each dispense being set to
Figure GDA00031057251200001517
In practice, phased array radars may have different search requirements. Thus, two types of search models are considered
Figure GDA00031057251200001518
And
Figure GDA00031057251200001519
to describe two different search requirements, see tables I and II for details, Table I is a model
Figure GDA00031057251200001618
Table II is a model of the search parameters for each sector in
Figure GDA00031057251200001619
Of the search parameter per sector.
The first 10 dispensing periods
Figure GDA00031057251200001612
Phased array radar adopts a first search model
Figure GDA00031057251200001620
Wherein the number of sectors is set to
Figure GDA0003105725120000168
During the last 10 dispensing sessions
Figure GDA0003105725120000169
The phased array radar adopts a second search model
Figure GDA00031057251200001621
The number of sectors is
Figure GDA00031057251200001610
TABLE I
Sector number 1 2 3 4 5 6 7 8
Ri,k(km) 240 240 240 300 200 300 310 295
θi,k() 8 8 8 8 8 6 8 12
TABLE II
Sector number 1 2 3 4 5 6
Ri,k(km) 240 240 240 300 200 300
θi,k() 8 8 16 8 8 8
In the simulation, the number of targets to be tracked is set to
Figure GDA00031057251200001613
Each target state parameter is given in table III.
TABLE III
Eye mark number 1 2 3 4 5
Location (Km) (3,55) (-23,85) (233,60) (300,30) (52,80)
Speed (m/s) (300,0) (100,-150) (200,-200) (10,-200) (200,100)
Initial Range (m) 127.28 126.32 169.19 86.45 122.09
Target reflectivity 2 0.8 1.5 1 1
Referring to fig. 3, a schematic diagram of target deployment in a detection range of a phased array radar; figure 3 shows the angular distribution of these targets with respect to the radar system.
To obtain a base number of
Figure GDA00031057251200001616
The pareto sub-set of (a),
Figure GDA00031057251200001617
individual search time budget setting
Figure GDA0003105725120000161
For a given
Figure GDA0003105725120000162
Figure GDA0003105725120000163
Denotes a reference solution (solution of the resource equal allocation scheme) in which
Figure GDA0003105725120000164
Figure GDA0003105725120000165
Is shown as having
Figure GDA00031057251200001611
A vector of all 1 columns of the elements,
Figure GDA0003105725120000166
is shown as
Figure GDA00031057251200001614
During the sub-distribution period
Figure GDA00031057251200001615
The total resource budget is solved by a resource equal allocation scheme,
Figure GDA0003105725120000167
is shown as
Figure GDA0003105725120000174
During the sub-distribution period
Figure GDA0003105725120000176
The total search resource budget is a solution to the search resource even allocation scheme,
Figure GDA0003105725120000171
is shown as
Figure GDA0003105725120000175
During the sub-distribution period
Figure GDA0003105725120000177
The total tracking resource budget adopts the solution of the tracking resource average allocation scheme, and the reference set is
Figure GDA0003105725120000172
The objective function value of each reference solution is called the reference result, the curve formed by the reference results is called the reference curve, and the same pareto subset
Figure GDA0003105725120000173
The objective function value of each pareto solution is called a pareto result, and a curve formed by the pareto results is called a pareto curve.
2. Simulation content:
the invention aims at the resource average allocation scheme and the allocation result of the dual-target optimization resource allocation scheme based on the pareto theory to compare simulation experiments.
3. And (3) simulation result analysis:
the results of FIG. 4(a) show that the demand model was searched
Figure GDA0003105725120000178
For the worst case search signal-to-noise ratio and the worst case tracking bayesian cramer lower bound, the pareto curve is significantly better than the reference curve; the results of FIG. 4(b) show that the demand model was searched
Figure GDA0003105725120000179
For the worst case search signal-to-noise ratio and the worst case lower bound of the Bayesian-Cramer-Role boundary, PaThe cumulative-over curve is obviously superior to the reference curve; with the pareto curve, the best search and tracking performance can be easily obtained using the dichotomy for any mission requirements.
In conclusion, the simulation experiment verifies the correctness, the effectiveness and the reliability of the method.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (7)

1. A resource allocation method based on phased array radar searching and tracking dual-target optimization is characterized by comprising the following steps:
step 1, initialization: order to
Figure FDA0003105725110000011
Is as follows
Figure FDA0003105725110000012
The number of the sub-distribution is equal to the number of the sub-distribution,
Figure FDA0003105725110000013
is set to an initial value of 1,
Figure FDA0003105725110000014
an even number greater than 0; is set to
Figure FDA0003105725110000015
Search area existence of time-controlled array radar in sub-distribution
Figure FDA00031057251100000147
An object, and
Figure FDA0003105725110000016
time control of sub-distributionThe search area of the array radar is divided into
Figure FDA0003105725110000017
A plurality of non-overlapping search sectors;
step 2, determining
Figure FDA0003105725110000018
Time phased array radar in sub-distribution
Figure FDA0003105725110000019
Search model and method for searching sector
Figure FDA00031057251100000110
During the sub-distribution period
Figure FDA00031057251100000111
A tracking model of the individual target; wherein,
Figure FDA00031057251100000112
is shown as
Figure FDA00031057251100000113
Distributing the number of targets in a search area of the time-controlled array radar in a secondary mode;
Figure FDA00031057251100000114
is shown as
Figure FDA00031057251100000115
The time-controlled array radar searches the total number of sectors in the time distribution;
step 3, according to
Figure FDA00031057251100000116
Time phased array radar in sub-distribution
Figure FDA00031057251100000117
A search model of the search sector, get
Figure FDA00031057251100000118
Searching for objective function and second order of resource allocation scheme during secondary allocation
Figure FDA00031057251100000119
Searching a conversion objective function of the resource allocation scheme during the secondary allocation period;
step 4, according to
Figure FDA00031057251100000120
During the sub-distribution period
Figure FDA00031057251100000121
A tracking model of the object, determining
Figure FDA00031057251100000122
Tracking a target standard function of a resource allocation scheme during the secondary allocation;
step 5, according to
Figure FDA00031057251100000123
Search for transfer objective function and the second of resource allocation scheme during sub-allocation
Figure FDA00031057251100000124
Tracking a target criteria function of the resource allocation scheme during the sub-allocation period to obtain a second
Figure FDA00031057251100000125
A mathematical optimization model of a dual target resource allocation scheme during secondary allocation;
step 6, solving
Figure FDA00031057251100000126
The mathematical optimization model of the double-target resource allocation scheme in the secondary allocation period respectively obtains
Figure FDA00031057251100000127
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000128
Optimal search time resources for non-overlapping search sectors
Figure FDA00031057251100000129
And a first
Figure FDA00031057251100000130
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000131
Tracking time resource column vector optimal solution of each target
Figure FDA00031057251100000132
Step 7, let
Figure FDA00031057251100000133
Adds 1 to the value of (1), returns to step 2 until the phased array radar assignment during the 1 st assignment is obtained
Figure FDA00031057251100000134
Optimal search time resources for non-overlapping search sectors
Figure FDA00031057251100000135
To the first
Figure FDA00031057251100000136
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000137
Optimal search time for non-overlapping search sectors(Resource)
Figure FDA00031057251100000138
And phased array radar assignment during the 1 st assignment
Figure FDA00031057251100000139
Tracking time resource column vector optimal solution of each target
Figure FDA00031057251100000140
To the first
Figure FDA00031057251100000141
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000142
Tracking time resource column vector optimal solution of each target
Figure FDA00031057251100000143
And recording the resource allocation result as a resource allocation result based on dual target searching and tracking of the phased array radar.
2. The method for resource allocation based on dual target optimization for phased array radar search and tracking as claimed in claim 1, wherein in step 2, the first step
Figure FDA00031057251100000144
Time phased array radar in sub-distribution
Figure FDA00031057251100000145
The search model for each search sector is:
Figure FDA00031057251100000146
wherein, alpha represents an intermediate variable,
Figure FDA0003105725110000021
is shown as
Figure FDA0003105725110000022
Time-controlled array radar allocation to the second
Figure FDA0003105725110000023
Search sector
Figure FDA0003105725110000024
The time resources of the search of (2),
Figure FDA0003105725110000025
is shown as
Figure FDA0003105725110000026
Time phased array radar in sub-distribution
Figure FDA0003105725110000027
Search sector
Figure FDA0003105725110000028
The target search signal-to-noise ratio of (c),
Figure FDA0003105725110000029
represents the average transmit power of the phased array radar,
Figure FDA00031057251100000210
indicating the set effective receive aperture of the phased array radar antenna,
Figure FDA00031057251100000211
is shown as
Figure FDA00031057251100000212
Time phased array radar in sub-distribution
Figure FDA00031057251100000213
Search sector
Figure FDA00031057251100000214
The cross-sectional area of scattering of the target,
Figure FDA00031057251100000215
which represents the boltzmann constant, represents,
Figure FDA00031057251100000216
indicating the set phased array radar temperature,
Figure FDA00031057251100000217
the loss of the phased array radar is shown,
Figure FDA00031057251100000218
is shown as
Figure FDA00031057251100000219
Time-controlled array radar scanned by sub-distribution
Figure FDA00031057251100000220
Search sector
Figure FDA00031057251100000221
The angle of (a) is determined,
Figure FDA00031057251100000222
is shown as
Figure FDA00031057251100000223
Time phased array radar in sub-distribution
Figure FDA00031057251100000224
Search sector
Figure FDA00031057251100000225
The target distance search value of (1);
the first mentioned
Figure FDA00031057251100000226
During the sub-distribution period
Figure FDA00031057251100000227
The tracking model of each target is as follows:
Figure FDA00031057251100000228
wherein,
Figure FDA00031057251100000229
is shown as
Figure FDA00031057251100000230
During the sub-distribution period
Figure FDA00031057251100000231
The process noise of the individual target is,
Figure FDA00031057251100000232
is shown as
Figure FDA00031057251100000233
During the sub-distribution period
Figure FDA00031057251100000234
The state vector of the individual objects is,
Figure FDA00031057251100000235
is as follows
Figure FDA00031057251100000236
During the sub-distribution period
Figure FDA00031057251100000237
The transformation matrix of the individual objects is,
Figure FDA00031057251100000238
the expression of the kronecker operator,
Figure FDA00031057251100000239
representing a 2 x 2 dimensional identity matrix,
Figure FDA00031057251100000240
indicating the duration of each dispense.
3. The method for resource allocation based on dual target optimization for phased array radar search and tracking as claimed in claim 1, wherein in step 3, the first step
Figure FDA00031057251100000241
The objective function of searching the resource allocation scheme during the secondary allocation is:
Figure FDA00031057251100000242
wherein,
Figure FDA00031057251100000243
is shown as
Figure FDA00031057251100000244
During the sub-distribution period
Figure FDA00031057251100000245
A set of non-overlapping search sector numbers,
Figure FDA00031057251100000246
Figure FDA00031057251100000247
a constraint condition is expressed in terms of the number of the elements,
Figure FDA00031057251100000248
is shown as
Figure FDA00031057251100000249
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000250
The total search time resources of the non-overlapping search sectors,
Figure FDA00031057251100000251
is shown as
Figure FDA00031057251100000252
During the second allocation period phased array radar is allocated to the second
Figure FDA00031057251100000253
The search time resources of each search sector,
Figure FDA00031057251100000254
is shown as
Figure FDA00031057251100000255
Time phased array radar in sub-distribution
Figure FDA00031057251100000256
Search sector
Figure FDA00031057251100000257
The target search signal-to-noise ratio of (c),
Figure FDA00031057251100000258
is shown as
Figure FDA00031057251100000259
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000260
A search time column vector of non-overlapping search sectors,
Figure FDA00031057251100000261
upper label
Figure FDA00031057251100000262
The transpose is represented by,
Figure FDA00031057251100000263
the first mentioned
Figure FDA00031057251100000264
The transfer objective function for searching the resource allocation scheme during the secondary allocation is:
Figure FDA0003105725110000031
wherein,
Figure FDA0003105725110000032
is shown as
Figure FDA0003105725110000033
The convex function during the sub-allocation period,
Figure FDA0003105725110000034
is shown as
Figure FDA0003105725110000035
Search sector 1 to search sector 1 during sub-allocation
Figure FDA0003105725110000036
The accumulated sum of the search time resources of each search sector, wherein alpha represents an intermediate variable;
Figure FDA0003105725110000037
is shown as
Figure FDA0003105725110000038
Time phased array radar in sub-distribution
Figure FDA0003105725110000039
Search sector
Figure FDA00031057251100000310
Is calculated from the target distance of (a) to the target distance search value,
Figure FDA00031057251100000311
is shown as
Figure FDA00031057251100000312
Time-controlled array radar scanned by sub-distribution
Figure FDA00031057251100000313
Search sector
Figure FDA00031057251100000314
The angle of (d);
Figure FDA00031057251100000315
representation calculation
Figure FDA00031057251100000316
The minimum value of (a) is determined,
Figure FDA00031057251100000317
representing a set of computations
Figure FDA00031057251100000318
Ratio of each search sector in the search
Figure FDA00031057251100000319
Then obtain
Figure FDA00031057251100000320
A ratio is then compared
Figure FDA00031057251100000321
The ratio value is then used to select the maximum value operation.
4. The method for resource allocation based on dual target optimization for phased array radar search and tracking as claimed in claim 1, wherein in step 4, the first step
Figure FDA00031057251100000322
The objective criteria function for tracking the resource allocation scheme during the secondary allocation is:
Figure FDA00031057251100000323
wherein,
Figure FDA00031057251100000324
is shown as
Figure FDA00031057251100000325
During the sub-distribution period
Figure FDA00031057251100000326
A set of object numbers, each object number being,
Figure FDA00031057251100000327
is shown as
Figure FDA00031057251100000328
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000329
A tracking time resource column vector for each target,
Figure FDA00031057251100000330
upper label
Figure FDA00031057251100000331
The transpose is represented by,
Figure FDA00031057251100000332
is shown as
Figure FDA00031057251100000333
During the second allocation period phased array radar is allocated to the second
Figure FDA00031057251100000334
The tracking time resources of the individual targets,
Figure FDA00031057251100000335
is shown as
Figure FDA00031057251100000336
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000337
Total tracking time resources of the individual targets;
Figure FDA00031057251100000338
expression solution
Figure FDA00031057251100000339
The minimum value of (a) is determined,
Figure FDA00031057251100000340
representing normalized worst case
Figure FDA00031057251100000341
During the sub-distribution period
Figure FDA00031057251100000342
And tracking a Bayesian Claritrol Laurve lower bound convex function of each target.
5. The method for resource allocation based on dual target optimization for phased array radar search and tracking as claimed in claim 1, wherein in step 5, the first step
Figure FDA00031057251100000343
The mathematical optimization model of the double-target resource allocation scheme during the secondary allocation period comprises the following processes:
firstly, first, the
Figure FDA00031057251100000344
The mathematical model of the dual target resource allocation scheme during the secondary allocation is represented as:
Figure FDA00031057251100000345
wherein,
Figure FDA0003105725110000041
showing obtained
Figure FDA0003105725110000042
And
Figure FDA0003105725110000043
at the same time make
Figure FDA0003105725110000044
And
Figure FDA0003105725110000045
the size of the particles is minimized and,
Figure FDA0003105725110000046
is shown as
Figure FDA0003105725110000047
Phased array radar allocation during sub-allocation
Figure FDA0003105725110000048
The total search time resources of the non-overlapping search sectors,
Figure FDA0003105725110000049
is shown as
Figure FDA00031057251100000410
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000411
The total tracking time resources of the individual targets,
Figure FDA00031057251100000412
is shown as
Figure FDA00031057251100000413
The total time resources of the integrated phased array radar search and tracking application during the sub-allocation,
Figure FDA00031057251100000414
is shown as
Figure FDA00031057251100000415
The duty cycle during the sub-dispensing period,
Figure FDA00031057251100000416
is shown as
Figure FDA00031057251100000417
During the second allocation period phased array radar is allocated to the second
Figure FDA00031057251100000418
The search time resources of each search sector,
Figure FDA00031057251100000419
is shown as
Figure FDA00031057251100000420
During the second allocation period phased array radar is allocated to the second
Figure FDA00031057251100000421
The tracking time resources of the individual targets,
Figure FDA00031057251100000422
is shown as
Figure FDA00031057251100000423
The convex function during the sub-allocation period,
Figure FDA00031057251100000424
representing normalized worst case
Figure FDA00031057251100000425
During the sub-distribution period
Figure FDA00031057251100000426
The tracked Bayesian Clarithrome lower bound convex function of each target,
Figure FDA00031057251100000427
is shown as
Figure FDA00031057251100000428
Is divided into sub-divisionsAllocation of phased array radar to allocation periods
Figure FDA00031057251100000429
A search time column vector of non-overlapping search sectors,
Figure FDA00031057251100000430
is shown as
Figure FDA00031057251100000431
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000432
A tracking time resource column vector for each target;
then it will be
Figure FDA00031057251100000433
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000434
Search time vector of non-overlapping search sectors
Figure FDA00031057251100000435
And a first
Figure FDA00031057251100000436
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000437
Tracking time resource column vector of individual targets
Figure FDA00031057251100000438
Integrated into a single vector, denoted
Figure FDA00031057251100000439
Dimension vector
Figure FDA00031057251100000440
Representing a row vector transpose; thereby obtaining the first
Figure FDA00031057251100000441
The mathematical optimization model of the dual-target resource allocation scheme during the secondary allocation period is as follows:
Figure FDA00031057251100000442
wherein,
Figure FDA00031057251100000443
is shown as
Figure FDA00031057251100000444
The convex function during the sub-allocation period,
Figure FDA00031057251100000445
representing normalized worst case
Figure FDA00031057251100000446
During the sub-distribution period
Figure FDA00031057251100000447
The tracked Bayesian Clarithrome lower bound convex function of each target,
Figure FDA00031057251100000448
is expressed as length of
Figure FDA00031057251100000449
And before
Figure FDA00031057251100000450
A row vector with 1 element and zero elements,
Figure FDA00031057251100000451
is expressed as length of
Figure FDA00031057251100000452
And from the second
Figure FDA00031057251100000453
Element to element
Figure FDA00031057251100000454
A row vector with 1 element and 0 elements,
Figure FDA00031057251100000455
representing row vectors
Figure FDA00031057251100000456
To middle
Figure FDA00031057251100000457
The number of the elements is one,
Figure FDA00031057251100000458
is shown as
Figure FDA00031057251100000459
The total time resources of the phased array radar search and tracking application are integrated during the secondary allocation.
6. The method for resource allocation based on dual target optimization for phased array radar search and tracking as claimed in claim 1, wherein in step 6, the first step
Figure FDA00031057251100000460
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000461
Optimal search time resources for non-overlapping search sectors
Figure FDA0003105725110000051
And a first
Figure FDA0003105725110000052
Phased array radar allocation during sub-allocation
Figure FDA0003105725110000053
Tracking time resource column vector optimal solution of each target
Figure FDA0003105725110000054
The obtaining process comprises the following steps:
6a) separately setting iteration indexes
Figure FDA0003105725110000055
And a stop threshold epsilon, and setting
Figure FDA0003105725110000056
Searching for lower bounds of resources during secondary allocation
Figure FDA0003105725110000057
And a first
Figure FDA0003105725110000058
Searching for upper bounds of resources during secondary allocation
Figure FDA0003105725110000059
Is shown as
Figure FDA00031057251100000510
The beta total search budget during the secondary allocation,
Figure FDA00031057251100000511
is shown as
Figure FDA00031057251100000512
A gamma total search budget during the secondary allocation; wherein, gamma is beta +1,
Figure FDA00031057251100000513
is shown as
Figure FDA00031057251100000514
The total search budget number or the total tracking budget number set in the secondary allocation period;
6b) according to the first
Figure FDA00031057251100000515
Searching for lower bounds of resources during secondary allocation
Figure FDA00031057251100000516
And a first
Figure FDA00031057251100000517
Searching for upper bounds of resources during secondary allocation
Figure FDA00031057251100000518
Calculate the first
Figure FDA00031057251100000519
After the second iteration
Figure FDA00031057251100000520
Total search resources for phased array radar during secondary allocation
Figure FDA00031057251100000521
Then use the first
Figure FDA00031057251100000522
After the second iteration
Figure FDA00031057251100000523
Total search resources for phased array radar during secondary allocation
Figure FDA00031057251100000524
And linear programming method to solve
Figure FDA00031057251100000525
Searching a conversion objective function of the resource allocation scheme during the sub-allocation period to obtain a first step
Figure FDA00031057251100000526
After the second iteration
Figure FDA00031057251100000527
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000528
Search time column vector optimal solution for non-overlapping search sectors
Figure FDA00031057251100000529
6c) If it is not
Figure FDA00031057251100000530
Updating
Figure FDA00031057251100000531
Order to
Figure FDA00031057251100000532
Add 1 to the value of (6 b); otherwise 6d) is executed,
Figure FDA00031057251100000533
is shown as
Figure FDA00031057251100000534
After the second iteration
Figure FDA00031057251100000535
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000536
Function values of the search time vector optimal solution of the non-overlapping search sectors;
Figure FDA00031057251100000537
is shown as
Figure FDA00031057251100000538
During the sub-distribution period
Figure FDA00031057251100000539
Worst case search signal-to-noise ratios in non-overlapping search sectors; a represents an intermediate variable which is,
Figure FDA00031057251100000540
is shown as
Figure FDA00031057251100000541
Time phased array radar in sub-distribution
Figure FDA00031057251100000542
Search sector
Figure FDA00031057251100000543
Is calculated from the target distance of (a) to the target distance search value,
Figure FDA00031057251100000544
is shown as
Figure FDA00031057251100000545
Time-controlled array radar scanned by sub-distribution
Figure FDA00031057251100000546
Search sector
Figure FDA00031057251100000547
The angle of (d);
6d) if it is not
Figure FDA00031057251100000548
Updating
Figure FDA00031057251100000549
Order to
Figure FDA00031057251100000550
Add 1 to the value of (6 b); otherwise 6e) is executed;
6e) if it is not
Figure FDA00031057251100000551
Get
Figure FDA00031057251100000552
Search for the optimal solution for resource allocation as
Figure FDA00031057251100000553
Is shown as
Figure FDA00031057251100000554
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000555
The optimal search time resources of the non-overlapping search sectors,
Figure FDA00031057251100000556
is shown as
Figure FDA00031057251100000557
After the second iteration
Figure FDA00031057251100000558
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000559
Search time vector optimal solutions of non-overlapping search sectors;
6f) calculate the first
Figure FDA00031057251100000560
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000561
Optimal total tracking time resource of each target
Figure FDA00031057251100000562
Figure FDA00031057251100000563
Wherein,
Figure FDA00031057251100000564
is shown as
Figure FDA00031057251100000565
The total resources of the integrated phased array radar search and tracking application during the sub-allocation,
Figure FDA0003105725110000061
is shown as
Figure FDA0003105725110000062
The duty cycle during the sub-dispensing period,
Figure FDA0003105725110000063
indicating the duration of each dispensing period;
6g) tracking time resources according to the optimal total tracking time resources
Figure FDA0003105725110000064
And minimum maximum solution method
Figure FDA0003105725110000065
Tracking a target criteria function of the resource allocation scheme during the sub-allocation period to obtain a second
Figure FDA0003105725110000066
Phased array radar allocation during sub-allocation
Figure FDA0003105725110000067
Tracking time resource column vector optimal solution of each target
Figure FDA0003105725110000068
7. The method for resource allocation based on dual target optimization for phased array radar search and tracking according to claim 6, wherein in 6(a), the method comprises
Figure FDA0003105725110000069
Is shown as
Figure FDA00031057251100000610
Beta total search budget during secondary allocation and the
Figure FDA00031057251100000611
Is shown as
Figure FDA00031057251100000612
A γ th total search budget during the secondary allocation, further comprising:
Figure FDA00031057251100000613
is shown as
Figure FDA00031057251100000614
The beta total search budget during the secondary allocation period is the second of the dual target resources
Figure FDA00031057251100000615
Pareto optimal solution of the beta of the sub-distribution
Figure FDA00031057251100000616
Middle front
Figure FDA00031057251100000617
A cumulative sum of the elements;
Figure FDA00031057251100000618
represents the gamma total search budget during the kth allocation, is the second target resource
Figure FDA00031057251100000619
Sub-assigned [ gamma ] pareto optimal solution
Figure FDA00031057251100000620
Middle front
Figure FDA00031057251100000662
A cumulative sum of the elements;
the two target resources are treated as
Figure FDA00031057251100000621
Second of the sub distribution
Figure FDA00031057251100000622
The pareto optimal solution is recorded as
Figure FDA00031057251100000623
The obtaining process comprises the following steps:
6.1 setting of
Figure FDA00031057251100000624
Sub-distribution periodThere is a
Figure FDA00031057251100000625
Total search budget and
Figure FDA00031057251100000626
total tracking budget from 1 st total search budget to
Figure FDA00031057251100000627
The total search budget satisfies:
Figure FDA00031057251100000628
wherein
Figure FDA00031057251100000629
Is shown as
Figure FDA00031057251100000630
During the sub-distribution period
Figure FDA00031057251100000631
Total search budget, will
Figure FDA00031057251100000632
During the sub-distribution period
Figure FDA00031057251100000633
Total tracking budget as
Figure FDA00031057251100000634
And the first
Figure FDA00031057251100000635
During the sub-distribution period
Figure FDA00031057251100000636
Total search budget
Figure FDA00031057251100000637
And a first
Figure FDA00031057251100000638
During the sub-distribution period
Figure FDA00031057251100000639
Total tracking budget
Figure FDA00031057251100000640
Satisfies the following conditions:
Figure FDA00031057251100000641
wherein
Figure FDA00031057251100000642
Is shown as
Figure FDA00031057251100000643
Integrating the total time resources of phased array radar search and tracking applications during the secondary allocation;
6.2 according to the first
Figure FDA00031057251100000644
During the sub-distribution period
Figure FDA00031057251100000645
Total search budget
Figure FDA00031057251100000646
And linear programming method to solve
Figure FDA00031057251100000647
Searching a conversion objective function of the resource allocation scheme during the sub-allocation period to obtain a first step
Figure FDA00031057251100000648
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000649
Search time vector pair of non-overlapping search sectors
Figure FDA00031057251100000650
Optimal solution for individual search budget resource allocation
Figure FDA00031057251100000651
According to the first
Figure FDA00031057251100000652
During the sub-distribution period
Figure FDA00031057251100000653
Total tracking budget
Figure FDA00031057251100000654
And maximum and minimum solution algorithm solving
Figure FDA00031057251100000655
Tracking a target criteria function of the resource allocation scheme during the sub-allocation period to obtain a second
Figure FDA00031057251100000656
Phased array radar allocation during sub-allocation
Figure FDA00031057251100000657
Tracking time resource column vector pair of individual targets
Figure FDA00031057251100000658
Optimal solution for individual total tracking budget resource allocation
Figure FDA00031057251100000659
Will be the first
Figure FDA00031057251100000660
Optimal solution for individual search budget resource allocation
Figure FDA00031057251100000661
And the said first
Figure FDA0003105725110000071
Optimal solution for individual total tracking budget resource allocation
Figure FDA0003105725110000072
Form two target resources
Figure FDA0003105725110000073
Second of the sub distribution
Figure FDA0003105725110000074
Pareto optimal solution
Figure FDA0003105725110000075
Upper label
Figure FDA0003105725110000076
Second to indicate transposed, dual target resource allocation
Figure FDA0003105725110000077
Pareto optimal solution
Figure FDA0003105725110000078
Included
Figure FDA0003105725110000079
And (4) each element.
CN201810057487.5A 2018-01-22 2018-01-22 Resource allocation method based on dual-target optimization of phased array radar search and tracking Active CN108333583B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810057487.5A CN108333583B (en) 2018-01-22 2018-01-22 Resource allocation method based on dual-target optimization of phased array radar search and tracking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810057487.5A CN108333583B (en) 2018-01-22 2018-01-22 Resource allocation method based on dual-target optimization of phased array radar search and tracking

Publications (2)

Publication Number Publication Date
CN108333583A CN108333583A (en) 2018-07-27
CN108333583B true CN108333583B (en) 2021-08-03

Family

ID=62926491

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810057487.5A Active CN108333583B (en) 2018-01-22 2018-01-22 Resource allocation method based on dual-target optimization of phased array radar search and tracking

Country Status (1)

Country Link
CN (1) CN108333583B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112034448B (en) * 2020-08-10 2022-11-04 西安电子科技大学 Networking radar resource allocation optimization method based on tracking precision and resource limitation

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7555383B2 (en) * 2003-05-28 2009-06-30 Northrop Grumman Corporation Target acquisition and tracking system
CN104077488A (en) * 2014-07-05 2014-10-01 中国船舶重工集团公司第七二四研究所 Rotary phased array radar sliding window resource scheduling technique based on sectors
CN105046412A (en) * 2015-06-29 2015-11-11 中国船舶重工集团公司第七二四研究所 Passive phased array radar multistation joint resource scheduling and distribution method
CN106199579A (en) * 2016-06-22 2016-12-07 中国人民解放军信息工程大学 Distributed MIMO radar target tracking precision method for joint optimization of resources
CN106990399A (en) * 2017-05-11 2017-07-28 西安电子科技大学 Radar network system power and bandwidth combined distributing method for target following
CN107167798A (en) * 2017-05-05 2017-09-15 电子科技大学 Based on the cognitive tracking of the controllable many radars of tracking accuracy
CN107450070A (en) * 2017-04-14 2017-12-08 电子科技大学 Phased-array radar wave beam and residence time combined distributing method based on target following

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8634982B2 (en) * 2009-08-19 2014-01-21 Raytheon Company System and method for resource allocation and management

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7555383B2 (en) * 2003-05-28 2009-06-30 Northrop Grumman Corporation Target acquisition and tracking system
CN104077488A (en) * 2014-07-05 2014-10-01 中国船舶重工集团公司第七二四研究所 Rotary phased array radar sliding window resource scheduling technique based on sectors
CN105046412A (en) * 2015-06-29 2015-11-11 中国船舶重工集团公司第七二四研究所 Passive phased array radar multistation joint resource scheduling and distribution method
CN106199579A (en) * 2016-06-22 2016-12-07 中国人民解放军信息工程大学 Distributed MIMO radar target tracking precision method for joint optimization of resources
CN107450070A (en) * 2017-04-14 2017-12-08 电子科技大学 Phased-array radar wave beam and residence time combined distributing method based on target following
CN107167798A (en) * 2017-05-05 2017-09-15 电子科技大学 Based on the cognitive tracking of the controllable many radars of tracking accuracy
CN106990399A (en) * 2017-05-11 2017-07-28 西安电子科技大学 Radar network system power and bandwidth combined distributing method for target following

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Simultaneous Multibeam Resource Allocation Scheme for Multiple Target Tracking;Junkun Yan等;《IEEE Transactions on Signal Processing》;20150326;第3110-3122页 *
相控阵雷达多目标跟踪模式波束资源管理与优化研究;牛俊翔;《中国优秀硕士学位论文全文数据库信息科技辑》;20170315;第43-60页 *

Also Published As

Publication number Publication date
CN108333583A (en) 2018-07-27

Similar Documents

Publication Publication Date Title
Yan et al. Joint beam selection and power allocation for multiple target tracking in netted colocated MIMO radar system
Daun et al. Tracking in multistatic passive radar systems using DAB/DVB-T illumination
Chai et al. Reference tag supported RFID tracking using robust support vector regression and Kalman filter
US7671789B1 (en) Method and system for target detection and angle estimation based on a radar signal
Chen et al. A modified probabilistic data association filter in a real clutter environment
CN109752710B (en) Rapid target angle estimation method based on sparse Bayesian learning
CN109581354B (en) Multi-target tracking resource management method for simultaneous multi-beam co-location MIMO radar
CN108761381B (en) Target information source detection method based on array antenna
CN108168564A (en) A kind of Data Association based on LHD grey relational grades
CN106842184A (en) A kind of multiple target detection and tracking based on beam dispath
CN106021697B (en) A kind of rapid phase-control battle array radar Time-energy resource joint management method
CN109581355B (en) Centralized MIMO radar self-adaptive resource management method for target tracking
CN105137418A (en) Multi-object tracking and data interconnection method based on whole neighborhood fuzzy clustering
KR20220023749A (en) Co-optimization method of integrated network radar dwell time and radiated power for low detection
CN110244273A (en) It is a kind of based on the target angle estimation method for being uniformly distributed formula array
CN107229032A (en) A kind of method and apparatus for building four array element solid arrays
CN110376580A (en) A kind of isomery radar fence resource allocation methods of asynchronous multiple target tracking performance driving
CN107037398A (en) A kind of two-dimentional MUSIC algorithms estimate the parallel calculating method of direction of arrival
Chen et al. Iterative subspace alternating projection method for GNSS multipath DOA estimation
CN111274529B (en) Robust Gao Sini Weisal PHD multi-expansion target tracking algorithm
CN108333583B (en) Resource allocation method based on dual-target optimization of phased array radar search and tracking
CN116148837A (en) Robust multi-sensor multi-target tracking method under heterogeneous clutter background
CN113325410A (en) Radar antenna signal processing method and device, control equipment and storage medium
CN108535704A (en) A kind of signal Pre-sorting method based on self-adaption two-dimensional cluster
CN110488276B (en) Heterogeneous radar network optimal resource on-demand distribution method oriented to multi-target tracking task

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