Optimized deployment method and system based on meter-wave multi-base radar, and storage medium

By establishing the target positioning model and dynamic game method of Mibodoki radar, the location of the transmitting and receiving stations of Mibodoki radar is optimized, and the problem of low deployment efficiency of Mibodoki radar is solved, and high-precision target detection and efficient resource utilization are achieved. .

CN119001614AActive Publication Date: 2024-11-22AIR FORCE UNIV PLA

Patent Information

Application Number
CN202411008977.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-26
Publication Date
2024-11-22
Estimated Expiration
2044-07-26

AI Technical Summary

Technical Problem

How to achieve the optimal deployment of Mibodobita radar transceiver stations to give full play to its advantages in target positioning accuracy, anti-interference ability, anti-stealth ability and battlefield survivability, and improve the resource utilization efficiency of the overall radar system under limited resources.

Method used

By establishing a target positioning model of Mibodoki radar, the positioning performance is measured using the Fisher information matrix, and the transmitting station and receiving station are regarded as game participants, the Pareto optimal deployment plan is obtained through dynamic game methods, and the transmitting station and receiving station are optimized. The station is positioned to maximize the volume and positioning performance of the effective monitoring area.

Benefits of technology

It improves the positioning accuracy and monitoring capabilities of radar targets, enhances the monitoring capabilities of specific areas, reduces overall costs, improves resource utilization efficiency, and achieves high-precision target detection in specific airspaces.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119001614A_ABST
    Figure CN119001614A_ABST
Patent Text Reader

Abstract

The invention discloses an optimized deployment method and system based on a meter-wave multi-base radar, and a storage medium. The method comprises the following steps: S1, constructing a target positioning model of the meter-wave multi-base radar; s2, a Fisher information matrix for target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is adopted to measure the positioning performance of the meter-wave multi-base radar on the target position; s3, obtaining the potential of a feasible deployment position set in the feasible deployment area based on the three-dimensional interval of the minimum deployment of the transmitting station and the receiving station and the size of the feasible deployment area; s4, the transmitting station and the receiving station of the meter-wave multi-base radar serve as game participants for dynamic game, each participant selects a strategy with the largest contribution to the volume of the effective monitoring area, and Pareto optimal deployment of the meter-wave multi-base radar is obtained. And limited radar resources can be utilized more efficiently, so that the resource utilization efficiency of the whole radar system is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of radar deployment technology, and more specifically to an optimization deployment method, system and storage medium based on meter-wave multi-base radar. Background Art

[0002] Meter-wave multi-base radar is an important meter-wave radar hybrid networking system. Meter-wave multi-base radar uses multiple spatially distributed transceiver stations to detect targets, which has many advantages over single-base radar.

[0003] Compared with the single-base meter-wave radar array, the meter-wave multi-base radar can form an effective detection coverage range for the expected airspace by changing the position of the transceiver station. Assuming that the signal reception of the meter-wave multi-base radar is cooperative, that is, each receiving station can receive and process all the transmitted signals, thereby achieving a huge advantage in power. The lateral distance accuracy of the single-base radar is usually much smaller than the radial distance accuracy when locating the target, and the meter-wave multi-base radar can obtain higher-precision target positioning performance through information fusion processing of separate transceivers; when the signal received by the receiving station of the meter-wave multi-base radar is a spatially correlated signal, it will obtain a higher spatial resolution than the meter-wave single-base radar.

[0004] Radars can usually effectively cancel interference from the side lobes of the receiver, but it is difficult to eliminate interference from the main lobe. The system structure of the meter-wave multi-base radar with separate transmitters and receivers makes it difficult for interference to enter the main lobe of the antenna of each receiving station in a directional and high-power manner; if interference is to be achieved on the main lobe of the antenna of each receiving station, the interference power density will not be very high. The spatially coherent meter-wave multi-base radar can effectively cancel the noise-like interference on the main lobe of the receiving antenna without suppressing the target echo.

[0005] The stealth of a stealth aircraft is mainly achieved by changing the scattering direction of electromagnetic waves so that the RCS of targets within a range of about 45 degrees to the left and right of the nose cone is reduced, while the RCS of targets within other angles is limitedly reduced or not reduced at all. The meter-wave multi-base radar sends and receives signals in multiple directions, and the bistatic RCS of targets between different transceiver stations varies greatly. It is difficult for stealth aircraft to achieve bistatic RCS reduction for all transceiver stations. In addition, the meter-wave multi-base radar operates in the meter-wave band, and the stealth materials of existing stealth aircraft have limited absorption capacity for electromagnetic waves in the meter-wave band, making it difficult to ensure effective low-detectability. Therefore, the meter-wave multi-base radar has extremely strong anti-stealth capabilities.

[0006] Since the transceiver stations of the meter-wave multi-base radar are dispersed in space, the positioning information of the meter-wave multi-base radar with redundant stations is not completely lost after one or several stations are destroyed, but the positioning performance will be reduced; similarly, if a station fails, the information of other stations can also ensure the realization of the radar target positioning function; in addition, the receiving station of the meter-wave multi-base radar system with separate transceivers does not radiate signals outward, and the antenna size required for the anti-radiation missile to effectively measure the angle of the transmitting station working in the meter-wave band is difficult to accommodate by the diameter of the existing anti-radiation missile, that is, the meter-wave multi-base radar has extremely strong battlefield survivability.

[0007] In summary, the meter-wave multi-base radar has greater advantages in power, positioning accuracy, spatial resolution, anti-interference capability, anti-stealth capability, battlefield survivability and reliability. Reasonable deployment of transceiver stations is an important condition for giving full play to the advantages of meter-wave multi-base radar. Therefore, how to achieve the optimal deployment of meter-wave multi-base radar transceiver stations is an important research topic in this field. Summary of the invention

[0008] The purpose of the present invention is to provide an optimization deployment method, system and storage medium based on meter-wave multi-base radar, establish a meter-wave multi-base radar deployment model, analyze the optimization deployment problem of meter-wave multi-base radar, and quickly obtain the Pareto optimal deployment plan of meter-wave multi-base radar, give full play to the advantages of meter-wave multi-base radar, and realize high-precision target detection in a specific airspace.

[0009] To achieve the above object, the present invention provides the following technical solutions:

[0010] An optimization deployment method based on meter-wave multi-base radar includes the following steps:

[0011] S1. Based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed;

[0012] S2. Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position;

[0013] S3, determining the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar, and obtaining the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area;

[0014] S4. The transmitting stations and receiving stations of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible spaces are feasible deployment positions. Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

[0015] Furthermore, in step S1, based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth of the receiving station to the target position, and the pitch angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed, specifically:

[0016] Assume that the multi-base radar uses the distance information, azimuth information and elevation angle information to locate the target position of the radar, and the estimated value of the target position is set as:

[0017] Θ=[x,y,z]

[0018] The Kth t The transmitter locations are k t =1,2,L,K t , No. K r The receiving station location is k r =1,2,L,K r ;

[0019] set up For receiving station k r , transmitting station k t Bibasic distance to the target location, For receiving station k r Estimation of the azimuth of the target position, For receiving station k r For the target's elevation angle estimation, the mathematical model of target positioning of the meter-wave multi-base radar is:

[0020]

[0021]

[0022] Furthermore, in step S2, based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, which is specifically:

[0023] set up is the radar transmitting power, is the antenna transmission gain, is the antenna receiving gain, is the target radar reflection cross-sectional area, λ is the wavelength of the transmitted signal, T intis the radar integration time, K is the Boltzmann constant, T s is temperature, N F is the equivalent noise factor;

[0024] Let k t The distance between the transmitting station and the target is:

[0025]

[0026] Let k r The distance between the receiving station and the target is

[0027]

[0028] The signal-to-noise ratio of the received signal is It can be expressed as:

[0029]

[0030] Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is

[0031] Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is

[0032] Let ρ(*) be the probability density distribution function; Θ j and θ h are the jth and hth items of the target position estimate; m and n are the serial numbers of different transceiver station combinations, m = 1, 2, L, K r K t ,n=1,2,L,K r K t ; It is used to indicate whether the azimuth information is used for the positioning of the meter wave multi-base radar. Indicates that the azimuth information is used. Indicates that the azimuth information is not used; μ θ It is used to indicate whether the meter wave multi-base radar positioning uses the pitch angle information, μ θ =1 means that the pitch angle information is used, μ θ =0 means that the pitch angle information is not used; μ R It is used to indicate whether the multi-base radar positioning uses distance information, μ R =1 means that distance information is used, μ R= 0 means that the distance information is not used; then the j-th row and h-th column element of the Fisher information matrix of the target position estimation of the meter-wave multi-base radar can be expressed as:

[0033]

[0034] Furthermore, in step S2, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target, specifically:

[0035]

[0036] Furthermore, in step S3, the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar is determined, and based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area, the potential of the set of feasible deployment positions in the feasible deployment area is obtained, specifically:

[0037] Assume the length, width and height of the feasible deployment area are Le, We and He respectively;

[0038] set up represents rounding down, then the potential of the set of feasible deployment positions in the feasible deployment area is Nu, which can be expressed as:

[0039]

[0040] Furthermore, in step S4, the transmitting station and the receiving station of the meter wave multi-base radar are used as game participants to conduct dynamic game, and their feasible spaces are feasible deployment positions. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area, and obtains the Pareto optimal deployment of the meter wave multi-base radar through the method of finite repetition dynamic game, which is specifically:

[0041] Assuming the transmitting and receiving stations of the meter-wave multi-base radar are the participants of the game, the feasible space is the feasible deployment positions of the transmitting and receiving stations;

[0042] Suppose the positions chosen by all participants in stage q are

[0043]

[0044] Suppose the positions chosen by all participants except the kth participant in the qth stage are

[0045]

[0046] Assume s = (x, y, z) is the position of a discrete point in the effective monitoring area, σ[s, P(q)] represents the positioning performance at point s when P(q) is deployed, V[P(q)] represents the volume of the effective monitoring area when P(q) is deployed, σ[s, K(q)] represents the positioning performance at point s when K(q) is deployed, and V[K(q)] represents the volume of the effective monitoring area when P(q) is deployed. Then

[0047] V[P(q)]=χ{s|σ[s,P(q)]≤σ a ,s∈S a}×v

[0048] V[K(q)]=χ{s|σ[s,K(q)]≤σ a ,s∈S a}×v

[0049] Suppose the kth participant in the qth stage contributes V to the volume of the effective monitoring area k (q) is

[0050] V k (q) = V[P(q)] - V[K(q)]

[0051] Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area, namely: Max V k (q);

[0052] In a dynamic game, when the kth participant considers its strategy, the strategies of other participants remain unchanged. At this time, V[K(q)] remains unchanged, making V k Maximizing (q) is equivalent to maximizing V[P(q)], which is exactly the optimization goal of the optimal deployment of multi-base radar. The benefit of the kth participant is set to the volume of the effective monitoring area corresponding to all participants, that is, u k (q) = V[P(q)].

[0053] The present invention also provides a system for optimizing deployment based on meter-wave multi-base radar, comprising:

[0054] Target positioning model construction module: Based on the dual-base distance between the receiving station, transmitting station and target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, the target positioning model of the meter-wave multi-base radar is constructed;

[0055] Positioning performance measurement module: Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position;

[0056] Deployment module: Determine the feasible deployment area of ​​the transmitting station and receiving station of the meter-wave multi-base radar, and obtain the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area;

[0057] Dynamic game module: The transmitting station and receiving station of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible space is the feasible deployment position. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

[0058] The present invention also provides a computer-readable storage medium storing computer program instructions, which execute the optimization deployment method of meter-wave multi-base radar when running on a processor.

[0059] According to the specific embodiments provided by the present invention, the present invention discloses the following technical effects: by establishing an accurate mathematical model and using the Cramer-Rao lower bound to measure the positioning performance, the positioning accuracy of the radar target can be effectively improved; by regarding the deployment of the transmitting station and the receiving station as a game process, the optimal deployment position can be found for each participant, thereby maximizing the coverage of the effective monitoring area and improving the positioning performance of the meter-wave multi-base radar; by reasonably configuring the positions of the transmitting station and the receiving station of the meter-wave multi-base radar within the feasible deployment area, the monitoring capability of a specific area can be effectively enhanced; by calculating the contribution of each transmitting station and the receiving station to the volume of the effective monitoring area, limited radar resources can be used more efficiently, thereby improving the resource utilization efficiency of the entire radar system; through accurate mathematical model prediction and game strategy selection, the overall cost can be reduced while meeting the monitoring needs. BRIEF DESCRIPTION OF THE DRAWINGS

[0060] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0061] The following is a further description of the optimization deployment method, system and storage medium based on the meter-wave multi-base radar of the present invention in conjunction with the accompanying drawings;

[0062] Figure 1 It is an overall flow chart of the optimization deployment method based on meter-wave multi-base radar provided by the present invention;

[0063] Figure 2It is a flow chart of obtaining the Pareto optimal deployment of meter-wave multi-base radar in the optimization deployment method based on meter-wave multi-base radar provided by the present invention;

[0064] Figure 3 It is a volume diagram of an effective monitoring area in a meter-wave multi-base radar based on distance information positioning in an optimization deployment method based on a meter-wave multi-base radar provided by the present invention;

[0065] Figure 4 It is a volume diagram of an effective monitoring area for high-altitude targets in a meter-wave multi-base radar based on angle information positioning in an optimization deployment method based on a meter-wave multi-base radar provided by the present invention;

[0066] Figure 5 It is a volume diagram of the effective monitoring area for low-altitude targets in the meter-wave multi-base radar based on angle information positioning in the optimization deployment method based on the meter-wave multi-base radar provided by the present invention;

[0067] Figure 6 It is a volume diagram of an effective monitoring area for high-altitude targets in a meter-wave multi-base radar based on distance and angle joint information positioning in an optimization deployment method based on a meter-wave multi-base radar provided by the present invention;

[0068] Figure 7 It is a volume diagram of the effective monitoring area for low-altitude targets in the meter-wave multi-base radar based on distance and angle joint information positioning in the optimization deployment method based on the meter-wave multi-base radar provided by the present invention;

[0069] Figure 8 It is a volume diagram of an effective monitoring area based on distance information positioning in the optimization deployment method based on meter-wave multi-base radar provided by the present invention;

[0070] Fig. 9 It is a volume diagram of an effective monitoring area for positioning high-altitude targets based on angle information in the Pareto optimal deployment and the global optimal deployment provided by the present invention;

[0071] Fig.10 It is an effective monitoring area volume diagram for positioning low-altitude targets based on angle information in the Pareto optimal deployment and the global optimal deployment provided by the present invention;

[0072] Fig.11 It is an effective monitoring area volume diagram for positioning high-altitude targets based on distance and angle joint information in Pareto optimal deployment and global optimal deployment provided by the present invention;

[0073] Fig.12 It is an effective monitoring area volume diagram for positioning low-altitude targets based on distance and angle joint information in Pareto optimal deployment and global optimal deployment provided by the present invention;

[0074] Fig.13It is a volume diagram of an effective monitoring area based on distance information positioning in the Pareto optimal deployment and the global optimal deployment provided by the present invention;

[0075] Fig.14 It is an effective monitoring area volume diagram for high-altitude target positioning based on angle information in the influence of feasible deployment interval on deployment performance provided by the present invention;

[0076] Fig.15 It is an effective monitoring area volume diagram for positioning low-altitude targets based on angle information in the influence of feasible deployment interval on deployment performance provided by the present invention;

[0077] Fig.16 It is an effective monitoring area volume diagram for positioning high-altitude targets based on distance and angle joint information in the influence of feasible deployment interval on deployment performance provided by the present invention;

[0078] Fig.17 It is an effective monitoring area volume diagram for positioning low-altitude targets based on distance and angle joint information in the influence of feasible deployment interval on deployment performance provided by the present invention. DETAILED DESCRIPTION

[0079] The specific implementation of the present invention is further described in detail below in conjunction with the accompanying drawings and examples. The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.

[0080] In order to better understand the purpose, structure and function of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings.

[0081] The present invention provides an optimization deployment method based on meter-wave multi-base radar, comprising the following steps:

[0082] S1. Based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed;

[0083] S2. Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position;

[0084] S3, determining the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar, and obtaining the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area;

[0085] S4. The transmitting stations and receiving stations of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible spaces are feasible deployment positions. Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

[0086] In step S1, based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the pitch angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed, specifically:

[0087] Assume that the multi-base radar uses the distance information, azimuth information and elevation angle information to locate the target position of the radar, and the estimated value of the target position is set as:

[0088] Θ=[x,y,z]

[0089] The Kth t The transmitter locations are k t =1,2,L,K t , No. K r The receiving station location is k r =1,2,L,K r ;

[0090] set up For receiving station k r , transmitting station k t Bibasic distance to the target location, For receiving station k r Estimation of the azimuth of the target position, For receiving station k r For the target's elevation angle estimation, the mathematical model of target positioning of the meter-wave multi-base radar is:

[0091]

[0092] In the step S2, based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, specifically:

[0093] set up is the radar transmitting power, is the antenna transmission gain, is the antenna receiving gain, is the target radar reflection cross-sectional area, λ is the wavelength of the transmitted signal, T int is the radar integration time, K is the Boltzmann constant, T sis temperature, N F is the equivalent noise factor;

[0094] Let k t The distance between the transmitting station and the target is:

[0095]

[0096] Let k r The distance between the receiving station and the target is

[0097]

[0098] The signal-to-noise ratio of the received signal is It can be expressed as:

[0099]

[0100] Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is

[0101] Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is

[0102] Let ρ(*) be the probability density distribution function; Θ j and θ h are the jth and hth items of the target position estimate; m and n are the serial numbers of different transceiver station combinations, m = 1, 2, L, K r K t ,n=1,2,L,K r K t ; It is used to indicate whether the azimuth information is used for the positioning of the meter wave multi-base radar. Indicates that the azimuth information is used. Indicates that the azimuth information is not used; μ θ It is used to indicate whether the meter wave multi-base radar positioning uses the pitch angle information, μ θ =1 means that the pitch angle information is used, μ θ =0 means that the pitch angle information is not used; μ R It is used to indicate whether the multi-base radar positioning uses distance information, μ R =1 means that distance information is used, μ R = 0 means that the distance information is not used; then the j-th row and h-th column element of the Fisher information matrix of the target position estimation of the meter-wave multi-base radar can be expressed as:

[0103]

[0104] In step S2, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target, specifically:

[0105]

[0106] In step S3, the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar is determined, and based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area, the potential of the feasible deployment position set in the feasible deployment area is obtained, specifically:

[0107] Assume the length, width and height of the feasible deployment area are Le, We and He respectively;

[0108] set up represents rounding down, then the potential of the set of feasible deployment positions in the feasible deployment area is Nu, which can be expressed as:

[0109]

[0110] In step S4, the transmitting station and the receiving station of the meter-wave multi-base radar are used as game participants to conduct dynamic game, and their feasible spaces are feasible deployment positions. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area, and obtains the Pareto optimal deployment of the meter-wave multi-base radar through the method of finite repetition dynamic game, which is specifically:

[0111] Assuming the transmitting and receiving stations of the meter-wave multi-base radar are the participants of the game, the feasible space is the feasible deployment positions of the transmitting and receiving stations;

[0112] Suppose the positions chosen by all participants in stage q are

[0113]

[0114] Suppose the positions chosen by all participants except the kth participant in the qth stage are

[0115]

[0116] Assume s = (x, y, z) is the position of a discrete point in the effective monitoring area, σ[s, P(q)] represents the positioning performance at point s when P(q) is deployed, V[P(q)] represents the volume of the effective monitoring area when P(q) is deployed, σ[s, K(q)] represents the positioning performance at point s when K(q) is deployed, and V[K(q)] represents the volume of the effective monitoring area when P(q) is deployed. Then

[0117] V[P(q)]=χ{s|σ[s,P(q)]≤σ a ,s∈S a}×v

[0118] V[K(q)]=χ{s|σ[s,K(q)]≤σ a ,s∈S a}×v

[0119] Suppose the kth participant in the qth stage contributes V to the volume of the effective monitoring area k (q) is

[0120] V k (q) = V[P(q)] - V[K(q)]

[0121] Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area, namely: Max V k (q);

[0122] In a dynamic game, when the kth participant considers its strategy, the strategies of other participants remain unchanged. At this time, V[K(q)] remains unchanged, making V k Maximizing (q) is equivalent to maximizing V[P(q)], which is exactly the optimization goal of the optimal deployment of multi-base radar. The benefit of the kth participant is set to the volume of the effective monitoring area corresponding to all participants, that is, u k (q) = V[P(q)].

[0123] The present invention provides a system for optimizing deployment based on meter-wave multi-base radar, comprising:

[0124] Target positioning model construction module: Based on the dual-base distance between the receiving station, transmitting station and target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, the target positioning model of the meter-wave multi-base radar is constructed;

[0125] Positioning performance measurement module: Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position;

[0126] Deployment module: Determine the feasible deployment area of ​​the transmitting station and receiving station of the meter-wave multi-base radar, and obtain the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area;

[0127] Dynamic game module: The transmitting station and receiving station of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible space is the feasible deployment position. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

[0128] The present invention also provides a computer-readable storage medium storing computer program instructions, which execute the optimization deployment method of meter-wave multi-base radar when running on a processor.

[0129] The present application further provides a simulation analysis process for the Pareto optimal deployment of meter-wave multi-base radars within a feasible deployment area.

[0130] As shown in Tables 1 to 3, three sets of position coordinates are randomly selected as three sets of initial values ​​for the Pareto optimal method;

[0131] Equivalent transmitting power of meter-wave radar array The receiving gain of the meter-wave radar array antenna is 100dBW. 12dB, target radar reflection cross section 7m 2 , the wavelength of the transmitted signal λ is 1m, and the radar integration time T int is 2s, temperature T s is 290K, equivalent noise coefficient N F It is 35dB, and the array antenna of the meter-wave radar is a Nested array with 14 array elements.

[0132] Table 1 Example 1 Initial value

[0133]

[0134] Table 2 Example 2 Initial Value

[0135]

[0136] Table 3 Initial values ​​of Example 3

[0137]

[0138]

[0139] The 3-transmit 3-receive meter-wave multi-base radar needs to be deployed in a square area with a side length of 60km, and the antenna height of the transceiver station is set to 10m. Assume that the acceptable error limit σ a It is 300m.

[0140] like Figure 3 As shown in the figure, the Fisher information matrix [FIM] of the target position estimation of the meter-wave multi-base radar based on distance information positioningj,h Medium R =1, μ θ =0, and the standard root mean square error of distance estimation is

[0141]

[0142] Simulation conditions: The monitoring area is a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 2km long and 2km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 961 discrete points in the feasible space.

[0143] The feasible space and monitoring area are both large, and the feasible space interval and monitoring area interval are both small. At this time, the calculation amount of the global optimal solution is 916 6 ×1323κ R =7.8151×10 20 κ R , the time cost required is extremely high, and the Pareto optimal deployment proposed in this application has less computational complexity.

[0144] like Figure 3 As shown in Figure 1, examples 1 to 3 obtain Pareto optimal deployment results after 2 to 4 repeated dynamic games. The results of the three examples are not the same, but the performance is very close. Even when the discrete interval of the feasible deployment area is small and the corresponding feasible deployment positions are large, the Pareto optimal method can obtain excellent performance results after a few stages of repeated dynamic games. The amount of calculation required to obtain the Pareto optimal solution is less than or equal to 4×6×916×1323κ R =2.9084832×10 7 κ R , and the amount of calculation to obtain the global optimal solution is 7.8151×10 20 κ R ,The Pareto optimal method has a huge advantage in computational ,amount.

[0145] like Figure 3 The simulation results of the high-altitude target positioning by the multi-base radar based on the angle information are shown in the figure.

[0146] Fisher Information Matrix [FIM] for Target Position Estimation of Meter-wave Multi-base Radar Based on Angle Information Positioning j,h middle μθ =1,μ R =0.

[0147] Simulation conditions: The monitoring area is a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 2000m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 2km long and 2km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 961 discrete points in the feasible space.

[0148] Assume that the standard root mean square error of the azimuth estimation of the high-altitude target is

[0149]

[0150] The standard root mean square error of the pitch angle estimation is

[0151]

[0152] like Figure 4 As shown in the figure, after 3 to 5 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are not all the same, but the performance is very close. Even if the discrete interval of the feasible deployment area is small and the corresponding feasible deployment positions are more, the Pareto optimal method can obtain excellent performance results after a few stages of repeated dynamic games.

[0153] like Figure 5 The simulation results of the multi-base radar based on angle information positioning for low-altitude targets are shown in the figure.

[0154] Simulation conditions: The monitoring area is a rectangular area with a side length of 200km, a width of 200km and a height of 2km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 2000m. The discrete interval of the monitoring area is 10km long, 10km wide and 0.2km high. There are 3969 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 2km long and 2km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 961 discrete points in the feasible space.

[0155] Assume that the standard root mean square error of the azimuth estimation of the low-altitude target is

[0156]

[0157] The standard root mean square error of the pitch angle estimation is

[0158]

[0159] like Figure 5 As shown in the figure, after 3 to 4 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are not all the same, but the performance is very close. Even when the discrete interval of the feasible deployment area is small and the corresponding feasible deployment positions are more, the Pareto optimal method can obtain excellent performance results after a few stages of repeated dynamic games.

[0160] Suppose that the calculation amount of CRLB corresponding to the positioning of a target position by a deployment of a multi-base radar based on angle information is κ θ The multi-base radar based on angle information positioning locates high-altitude targets, and the calculation amount for obtaining the global optimal solution is 916 6 ×1323κ θ =7.8151×10 20 κ θ , that is, the computational time cost of obtaining the global optimal solution is too high, while the computational cost of obtaining the Pareto optimal solution is less than or equal to 5×6×916×1323κ θ =3.6356040×10 7 κ θ The multi-base radar based on angle information positioning locates low-altitude targets, and the calculation amount for obtaining the global optimal solution is 916 6 ×3969κ θ =2.3445×10 21 κ θ , that is, the computational time cost of obtaining the global optimal solution is too high, while the computational cost of the Pareto optimal solution is less than or equal to 4×6×916×3969κ θ =8.7254496×10 7 κ θ Therefore, the Pareto optimal method has a huge advantage in terms of computational complexity.

[0161] like Figure 6 As shown in the figure, the simulation results of the multi-base radar based on the joint positioning of distance and angle information for high-altitude targets

[0162] Fisher Information Matrix [FIM] for Target Position Estimation of Meter-wave Multi-base Radar Based on Joint Information Positioning of Range and Angle j,h middle μ θ =1,μ R =1.

[0163] Simulation conditions: The monitoring area is a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 2000m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 2km long and 2km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 961 discrete points in the feasible space.

[0164] Assume the standard root mean square error of distance estimation is

[0165]

[0166] Assume that the standard root mean square error of the azimuth estimation of the high-altitude target is

[0167]

[0168] The standard root mean square error of the pitch angle estimation is

[0169]

[0170] like Figure 6 As shown in the figure, after 3 to 4 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are not all the same, but the performance is very close. Even when the discrete interval of the feasible deployment area is small and the corresponding feasible deployment positions are more, the Pareto optimal method can obtain excellent performance results after a few stages of repeated dynamic games.

[0171] like Figure 7 As shown in the figure, the simulation results of the multi-base radar based on the joint positioning of distance and angle information for low-altitude targets

[0172] Simulation conditions: The monitoring area is a rectangular area with a side length of 200km, a width of 200km and a height of 2km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 2000m. The discrete interval of the monitoring area is 10km long, 10km wide and 0.2km high. There are 3969 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 2km long and 2km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 961 discrete points in the feasible space.

[0173] Assume the standard root mean square error of distance estimation is

[0174]

[0175] Assume that the standard root mean square error of the azimuth estimation of the low-altitude target is

[0176]

[0177] The standard root mean square error of the pitch angle estimation is

[0178]

[0179] like Figure 7 As shown in the figure, after 3 to 6 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are not the same, but the performance is very close. Even when the discrete interval of the feasible deployment area is small and the corresponding feasible deployment positions are large, the Pareto optimal method can obtain excellent performance results after a few stages of repeated dynamic games.

[0180] Suppose that the calculation amount of CRLB corresponding to the positioning of a target position by a deployment of a multi-base radar based on distance and angle joint information is κ U The multi-base radar based on distance and angle information positioning locates high-altitude targets, and the calculation amount for obtaining the global optimal solution is 916 6 ×1323κ U =7.8151×10 20 κ U , that is, the computational time cost of obtaining the global optimal solution is too high, while the computational cost of obtaining the Pareto optimal solution is less than or equal to 4×6×916×1323κ U =2.9084832×10 7 κ U The multi-base radar based on distance and angle information positioning locates low-altitude targets, and the calculation amount for obtaining the global optimal solution is 916 6 ×3969κ U =2.3445×10 21 κ U , that is, the computational time cost of obtaining the global optimal solution is too high, and the computational cost of the Pareto optimal solution is less than or equal to 6×6×916×3969κ U =1.30881744×10 8 κ U Therefore, the Pareto optimal method has a huge advantage in terms of computational complexity.

[0181] like Figure 8 As shown in Figure 2, the simulation results of Pareto optimal deployment and global optimal deployment for distance information positioning

[0182] The global optimal solution is obtained by traversal, that is, all possible deployment situations are enumerated and the optimal deployment is selected from them. Therefore, the amount of calculation is large and the time to obtain the global optimal solution is long. The time cost of obtaining the global optimal solution is acceptable only when the monitoring area is small and the discrete interval between the monitoring area and the feasible deployment area is large. In order to compare and analyze the Pareto optimal deployment with the global optimal deployment, a smaller monitoring area, a larger monitoring area and a discrete interval of the feasible deployment area are selected for simulation.

[0183] Simulation conditions: The monitoring area is a rectangular area with a side length of 40km, a width of 40km and a height of 20km. The long side of the monitoring area is between -20km and 20km, the wide side is between -20km and 20km, and the high side is between 2000m and 22000m. The discrete interval of the monitoring area is 20km long, 20km wide and 20km high. There are 18 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 20km long and 20km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 16 discrete points in the feasible space.

[0184] like Figure 8 As shown in the figure, after 3 to 6 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are not the same, indicating that the Pareto optimal solution is not unique. The Pareto optimal results of the three examples are not as large as the effective monitoring area of ​​the global optimal solution, but compared with the three randomly selected initial deployment positions, they are closer to the performance of the global optimal solution.

[0185] Suppose that the calculation amount of CRLB corresponding to the positioning of a target position by a deployment of a meter-wave multi-base radar based on distance information is κ R In simulation 1, when both the feasible space and the effective monitoring area are small, and both the feasible space interval and the effective monitoring area interval are large, the computational complexity of the global optimal solution is 16. 6 ×18κ R =8.39808×10 5 κ R , the computational complexity of the Pareto optimal solution is less than or equal to 6×6×16×18κ R =1.0368×10 4 κ R .

[0186] like Fig. 9 As shown in the figure, the simulation results of high-altitude target positioning based on angle information

[0187] Simulation conditions: The monitoring area is a rectangular area with a side length of 40km, a width of 40km and a height of 20km. The long side of the monitoring area is between -20km and 20km, the wide side is between -20km and 20km, and the high side is between 2000m and 22000m. The discrete interval of the monitoring area is 20km long, 20km wide and 20km high. There are 18 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 20km long and 20km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 16 discrete points in the feasible space.

[0188] After 3 to 4 repeated dynamic games, the Pareto optimal deployment result is obtained. The results of the three examples are different, indicating that the Pareto optimal solution is not unique. The Pareto optimal results of the three examples are not as large as the effective monitoring area of ​​the global optimal solution, but compared with the three randomly selected initial deployment positions, they are very close to the performance of the global optimal solution.

[0189] The multi-base radar based on angle information positioning locates the high-altitude target. In the simulation 2, the feasible space and effective monitoring area are both small, and the feasible space interval and effective monitoring area interval are both large. At this time, the calculation amount of the global optimal solution is 16 6 ×18κ θ =8.39808×10 5 κ θ , the computational complexity of the Pareto optimal solution is less than or equal to 4×6×16×18κ θ =6.912×10 3 κ θ .

[0190] like Fig.10 As shown, low-altitude target positioning based on angle information

[0191] Simulation conditions: The monitoring area is a rectangular area with a side length of 40km, a width of 40km and a height of 1km. The long side of the monitoring area is between -20km and 20km, the wide side is between -20km and 20km, and the high side is between 500m and 1500m. The discrete interval of the monitoring area is 20km long, 20km wide and 0.5km high. There are 27 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 20km long and 20km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 16 discrete points in the feasible space.

[0192] like Fig.10As shown in the figure, after 3 to 5 repeated dynamic games, the Pareto optimal deployment results are obtained. The results of the three examples are different, indicating that the Pareto optimal solution is not unique. The Pareto optimal results of the three examples are not as large as the effective monitoring area of ​​the global optimal solution, but compared with the three randomly selected initial deployment positions, they are very close to the performance of the global optimal solution.

[0193] The multi-base radar based on angle information positioning locates low-altitude targets. In the simulation, the feasible space and effective monitoring area are both small, and the feasible space interval and effective monitoring area interval are both large. At this time, the calculation amount of the global optimal solution is 16 6 ×27κ θ =1259712×10 6 κ θ , the computational complexity of the Pareto optimal solution is less than or equal to 5×6×16×27κ θ =1.296×10 4 κ θ .

[0194] like Fig.11 As shown in the figure, the simulation analysis of high-altitude target positioning based on the joint information of distance and angle

[0195] Simulation conditions: The monitoring area is a rectangular area with a side length of 40km, a width of 40km and a height of 20km. The long side of the monitoring area is between -20km and 20km, the wide side is between -20km and 20km, and the high side is between 2000m and 22000m. The discrete interval of the monitoring area is 20km long, 20km wide and 20km high. There are 18 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 20km long and 20km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 16 discrete points in the feasible space.

[0196] like Fig.11 As shown, examples 1 to 3 obtain the Pareto optimal deployment results after 2 to 3 repeated dynamic games. The results of the three examples are not the same, indicating that the Pareto optimal solution is not unique. The Pareto optimal results of the three examples are not as large as the effective monitoring area of ​​the global optimal solution, but compared with the three randomly selected initial deployment positions, they are very close to the performance of the global optimal solution.

[0197] The multi-base radar based on distance and angle joint information positioning locates the high-altitude target. In the simulation, the feasible space and effective monitoring area are small, the feasible space interval and the effective monitoring area interval are large, and the calculation amount of the global optimal solution is 16 6 ×18κ U =8.39808×10 5 κ U, the computational complexity of the Pareto optimal solution is less than or equal to 3×6×16×18κ U =5.184×10 3 κ U .

[0198] like Fig.12 As shown in the figure, the simulation analysis of low-altitude target positioning based on the joint information of distance and angle

[0199] Simulation conditions: The monitoring area is a rectangular area with a side length of 40km, a width of 40km and a height of 1km. The long side of the monitoring area is between -20km and 20km, the wide side is between -20km and 20km, and the high side is between 500m and 1500m. The discrete interval of the monitoring area is 20km long, 20km wide and 0.5km high. There are 27 discrete points in the monitoring area. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is 20km long and 20km wide. The long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are 16 discrete points in the feasible space.

[0200] like Fig.12 As shown in the figure, examples 1 to 3 obtain the Pareto optimal deployment results after 3 to 4 repeated dynamic games. The results of the three examples are different, indicating that the Pareto optimal solution is not unique. Only the Pareto optimal result of example 3 is the same as the global optimal solution. The Pareto optimal results of the other two examples do not have a larger effective monitoring area than the global optimal solution, but compared with the randomly selected initial deployment position, they are very close to the performance of the global optimal solution.

[0201] The multi-base radar based on distance and angle joint information positioning locates low-altitude targets. In the fifth simulation, the feasible space and effective monitoring area are both small, and the feasible space interval and effective monitoring area interval are both large. At this time, the calculation amount of the global optimal solution is 16 6 ×27κ U =1259712×10 6 κ U , the computational complexity of the Pareto optimal solution is less than or equal to 4×6×16×27κ U =1.0368×10 4 κ U .

[0202] It needs to be explained that the Pareto optimal deployment is a type of deployment with superior performance. Compared with the global optimal solution, the computational complexity of the Pareto optimal method is much lower.

[0203] Simulation results and analysis of the impact of feasible deployment interval on deployment performance

[0204] The initial values ​​of Example 1 are used as the initial values ​​in the simulation of this section. The feasible deployment area is 60km long and 60km wide. The discrete interval of the feasible deployment area is F, and the long side of the feasible deployment area is between -30km and 30km, and the wide side is between -30km and 30km. There are a total of F takes 0.5km, 1km, 2km, 4km, 8km and 16km respectively.

[0205] like Fig.13 As shown, simulation analysis based on distance information positioning

[0206] Simulation conditions: The monitoring area is assumed to be a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area.

[0207] like Fig.13 As shown in the figure, when the interval of the feasible deployment area is large, such as 8km and 16km, the performance of the Pareto optimal solution is poor; when the interval of the feasible deployment area is small, such as 0.5km and 4km, the performance of the Pareto optimal solution is good. For the multi-base radar with a wavelength of 1000 nm and a range of 1000 nm, the smaller the interval, the better the performance. However, when the interval takes a smaller value (such as 0.5km), the performance improvement of the Pareto optimal solution is also small. It should be noted that the smaller the interval, the greater the amount of calculation in each stage of the game. Therefore, for the multi-base radar with a wavelength of 1000 nm and a range of 1000 nm, 1km is the optimal discrete interval of the feasible deployment area.

[0208] like Fig.14 As shown in the figure, simulation analysis of high-altitude target positioning based on angle information

[0209] Simulation conditions: The monitoring area is assumed to be a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 2000m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area.

[0210] like Fig.14As shown in the figure, in general, the smaller the interval, the better the performance of the multi-base radar based on angle information positioning for high-altitude targets. However, when the interval is smaller (such as 0.5km), the performance of the Pareto optimal solution is no longer improved, and the number of stages to obtain the Pareto optimal solution is still large. It should be noted that the smaller the interval, the greater the amount of calculation in each stage. Therefore, the appropriate selection of the discrete interval of the feasible deployment area can give full play to the advantages of the Pareto optimal method and obtain the deployment of multi-base radar with excellent performance through extremely small calculations. Therefore, when the multi-base radar based on angle information positioning is used to locate high-altitude targets, 1km is the optimal discrete interval of the feasible deployment area.

[0211] like Fig.15 As shown in the figure, the simulation analysis of low-altitude target positioning based on angle information

[0212] Simulation conditions: The monitoring area is assumed to be a rectangular area with a side length of 200km, a width of 200km and a height of 2km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 2000m. The discrete interval of the monitoring area is 10km long, 10km wide and 0.2km high. There are 3969 discrete points in the monitoring area.

[0213] like Fig.15 As shown in the figure, in general, the smaller the interval of the multi-base radar based on angle information positioning for positioning low-altitude targets, the better the performance. However, it should be noted that the smaller the interval, the greater the amount of calculation in each stage of the game. When the interval takes a smaller value (such as less than 2km), the performance improvement of the Pareto optimal solution is very small. Therefore, when the multi-base radar based on angle information positioning for positioning low-altitude targets, 2km is the optimal discrete interval of the feasible deployment area.

[0214] like Fig.16 As shown in the figure, the simulation analysis of high-altitude target positioning based on the joint information of distance and angle

[0215] Simulation conditions: The monitoring area is assumed to be a rectangular area with a side length of 200km, a width of 200km and a height of 30km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 2000m and 30000m. The discrete interval of the monitoring area is 10km long, 10km wide and 10km high. There are 1323 discrete points in the monitoring area.

[0216] As shown in 16, in general, the smaller the interval, the better the performance of the meter-wave multi-base radar based on the joint information positioning of distance and angle for locating high-altitude targets. However, it should be noted that the smaller the interval, the greater the amount of calculation in each stage of the game. When the interval takes a smaller value (such as less than 4km), the performance improvement of the Pareto optimal solution is very small. Therefore, when the meter-wave multi-base radar based on the joint information positioning of distance and angle is used to locate high-altitude targets, 4km is the optimal discrete interval of the feasible deployment area.

[0217] like Fig.17 As shown in the figure, the simulation analysis of low-altitude target positioning based on the joint information of distance and angle

[0218] Simulation conditions: The monitoring area is assumed to be a rectangular area with a side length of 200km, a width of 200km and a height of 2km. The long side of the monitoring area is between -100km and 100km, the wide side is between -100km and 100km, and the high side is between 100m and 2000m. The discrete interval of the monitoring area is 10km long, 10km wide and 0.2km high. There are 3969 discrete points in the monitoring area.

[0219] like Fig.17 As shown in the figure, in general, the smaller the interval, the better the performance of the meter-wave multi-base radar based on the joint information positioning of distance and angle for positioning low-altitude targets. However, it should be noted that the smaller the interval, the greater the amount of calculation in each stage of the game. When the interval takes a smaller value (such as less than 1km), the performance improvement of the Pareto optimal solution is very small. Therefore, when the meter-wave multi-base radar based on the joint information positioning of distance and angle is used to locate low-altitude targets, 1km is the optimal discrete interval of the feasible deployment area.

[0220] It needs to be explained that the smaller the feasible deployment interval, the better the performance of the Pareto optimal solution. However, when the feasible deployment interval is small, a smaller feasible deployment interval can no longer effectively improve the performance of the Pareto optimal solution. The smaller the feasible deployment interval, the greater the amount of calculation. Therefore, choosing an appropriate feasible deployment interval is an important prerequisite for quickly obtaining a Pareto optimal deployment with excellent performance.

[0221] It should be explained that the method in the present invention has a small amount of calculation and can quickly obtain the Pareto optimal deployment of the multi-base radar at a meter wave, thereby achieving high-precision target detection in a specific airspace. The following conclusions are obtained:

[0222] (1) The optimal deployment of meter-wave multi-base radars is analyzed from two aspects: the measurement criteria for the advantages and disadvantages of meter-wave multi-base radar deployment and the deployable locations of meter-wave multi-base radars.

[0223] (2) The Pareto optimal theory is summarized, and a Pareto optimal deployment method for a meter-wave multi-base radar is proposed. The method in the present invention has a small amount of calculation and can quickly obtain the Pareto optimal deployment of the meter-wave multi-base radar; the Pareto optimal deployment is a deployment situation in which the detection performance of the meter-wave multi-base radar can no longer be improved by changing the deployment of a single station, and is a deployment situation in which high-precision detection of targets in a specific airspace can be performed.

[0224] (3) In the simulation results and analysis, the Pareto optimal deployment method of the meter-wave multi-base radar was first simulated in three cases according to different positioning information. The first case is based on distance information positioning; the second case is based on angle information positioning; and the third case is based on distance and angle joint information positioning. Secondly, the Pareto optimal deployment results in the three cases were compared and analyzed with the global optimal deployment results. Finally, the influence of the feasible deployment interval was simulated and analyzed. The simulation results show that, first, the Pareto optimal deployment algorithm has a small amount of calculation and can quickly obtain the deployment results; second, the Pareto optimal deployment is a type of deployment with excellent performance; third, the reasonable selection of the feasible deployment interval is an important condition for reducing the amount of calculation and obtaining a Pareto optimal deployment with excellent performance.

[0225] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An optimized deployment method based on meter-wave multi-base radar, It is characterized in that The following steps are involved: S1. Based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed; S2. Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position; S3, determining the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar, and obtaining the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area; S4. The transmitting stations and receiving stations of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible spaces are feasible deployment positions. Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

2. According to the optimization deployment method based on meter-wave multi-base radar according to claim 1, It is characterized in that In step S1, based on the dual-base distances between the receiving station, the transmitting station and the target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the pitch angle of the receiving station to the target position, a target positioning model of the meter-wave multi-base radar is constructed, specifically: Assume that the multi-base radar uses the distance information, azimuth information and elevation angle information to locate the target position of the radar, and the estimated value of the target position is set as: Θ=[x,y,z] The Kth t The transmitter locations are k t =1,2,L,K t , No. K r The receiving station location is k r =1,2,L,K r ; set up For receiving station k r , transmitting station k t Bibasic distance to the target location, For receiving station k r Estimation of the azimuth of the target position, For receiving station k r For the target's elevation angle estimation, the mathematical model of target positioning of the meter-wave multi-base radar is:

3. The optimization step method based on meter-wave multi-base radar according to claim 1, It is characterized in that In step S2, based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, which is specifically: set up is the radar transmitting power, is the antenna transmission gain, is the antenna receiving gain, is the target radar reflection cross-sectional area, λ is the wavelength of the transmitted signal, T int is the radar integration time, K is the Boltzmann constant, T s is temperature, N F is the equivalent noise factor; Let k t The distance between the transmitting station and the target is: Let k r The distance between the receiving station and the target is The signal-to-noise ratio of the received signal is It can be expressed as: Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is Assume that the standard root mean square error of the azimuth estimation is The standard root mean square error of the pitch angle estimation is The standard root mean square error of the distance estimate is Let ρ(*) be the probability density distribution function; Θ j and θ h are the jth and hth items of the target position estimate; m and n are the serial numbers of different transceiver station combinations, m = 1, 2, L, K r K t ,n=1,2,L,K r K t ; It is used to indicate whether the azimuth information is used for the positioning of the meter wave multi-base radar. Indicates that the azimuth information is used. Indicates that the azimuth information is not used; μ θ It is used to indicate whether the meter wave multi-base radar positioning uses the pitch angle information, μ θ =1 means that the pitch angle information is used, μ θ =0 means that the pitch angle information is not used; μ R It is used to indicate whether the multi-base radar positioning uses distance information, μ R =1 means that distance information is used, μ R = 0 means that the distance information is not used; then the j-th row and h-th column element of the Fisher information matrix of the target position estimation of the meter-wave multi-base radar can be expressed as:

4. The method for optimizing deployment of meter-wave multi-base radar according to claim 1, It is characterized in that In step S2, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target, specifically:

5. The method for optimizing deployment of meter-wave multi-base radar according to claim 1, It is characterized in that In step S3, the feasible deployment area of ​​the transmitting station and the receiving station of the meter-wave multi-base radar is determined, and based on the minimum deployment three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area, the potential of the feasible deployment position set in the feasible deployment area is obtained, specifically: Assume the length, width and height of the feasible deployment area are Le, We and He respectively; set up represents rounding down, then the potential of the set of feasible deployment positions in the feasible deployment area is Nu, which can be expressed as:

6. The method for optimizing deployment of meter-wave multi-base radar according to claim 1, It is characterized in that In step S4, the transmitting station and the receiving station of the meter-wave multi-base radar are used as game participants to conduct dynamic game, and their feasible spaces are feasible deployment positions. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area, and obtains the Pareto optimal deployment of the meter-wave multi-base radar through the method of finite repetition dynamic game, which is specifically: Assuming the transmitting and receiving stations of the meter-wave multi-base radar are the participants of the game, the feasible space is the feasible deployment positions of the transmitting and receiving stations; Suppose the positions chosen by all participants in the qth stage are: Suppose the positions chosen by the participants except the kth participant in the qth stage are: Assume s = (x, y, z) is the position of a discrete point in the effective monitoring area, σ[s, P(q)] represents the positioning performance at point s when P(q) is deployed, V[P(q)] represents the volume of the effective monitoring area when P(q) is deployed, σ[s, K(q)] represents the positioning performance at point s when K(q) is deployed, and V[K(q)] represents the volume of the effective monitoring area when P(q) is deployed, then: V[P(q)]=χ{s|σ[s,P(q)]≤σ a ,s∈S a }×v V[K(q)]=χ{s|σ[s,K(q)]≤σ a ,s∈S a }×v Suppose the kth participant in the qth stage contributes V to the volume of the effective monitoring area k (q) is: V k (q)=V[P(q)]-V[K(q)] Each participant chooses the strategy that contributes the most to the volume of the effective monitoring area, namely: Max V k (q); In a dynamic game, when the kth participant considers its strategy, the strategies of other participants remain unchanged. At this time, V[K(q)] remains unchanged, making V k Maximizing (q) is equivalent to maximizing V[P(q)], which is exactly the optimization goal of the optimal deployment of multi-base radar. The benefit of the kth participant is set to the volume of the effective monitoring area corresponding to all participants, that is, u k (q) = V[P(q)].

7. A system for implementing the method for optimizing deployment of meter-wave multi-base radars according to any one of claims 1 to 6, It is characterized in that include: Target positioning model construction module: Based on the dual-base distance between the receiving station, transmitting station and target position of the meter-wave multi-base radar, the azimuth angle of the receiving station to the target position, and the elevation angle of the receiving station to the target position, the target positioning model of the meter-wave multi-base radar is constructed; Positioning performance measurement module: Based on the target positioning model of the meter-wave multi-base radar and the working parameters of the meter-wave multi-base radar, the Fisher information matrix of the target position estimation of the meter-wave multi-base radar is obtained, and based on the Fisher information matrix, the Cramer-Rao lower bound is used to measure the positioning performance of the meter-wave multi-base radar for the target position; Deployment module: Determine the feasible deployment area of ​​the transmitting station and receiving station of the meter-wave multi-base radar, and obtain the potential of the set of feasible deployment positions in the feasible deployment area based on the minimum three-dimensional interval of the transmitting station and the receiving station and the size of the feasible deployment area; Dynamic game module: The transmitting station and receiving station of the meter-wave multi-base radar are used as participants in the dynamic game. Their feasible space is the feasible deployment position. Each participant selects the strategy that contributes the most to the volume of the effective monitoring area. Through the method of finite repetition dynamic game, the Pareto optimal deployment of the meter-wave multi-base radar is obtained.

8. A computer-readable storage medium, It is characterized in that Computer program instructions are stored, and when the computer program instructions are executed on a processor, the method for optimizing deployment of meter-wave multi-base radars as described in any one of claims 1 to 6 is executed.

Citation Information

Patent Citations

  • Rapid maneuver deployment method for MIMO radar mobile platform based on change monitoring requirement

    CN106304108A

  • Multi-base radar radio frequency stealth optimization method based on Stackelberg game

    CN110007278A

  • Multi-target joint optimization method for multi-base radar radiation parameters based on radio frequency stealth

    CN111025275A

  • Cooperative game-based cooperative MIMO radar communication integrated system power distribution method

    CN115441906A

  • Networked radar optimal waveform design method based on low interception performance under game conditions

    WO2021258734A1

Cited By

  • Method of controlling the state of elements of a radar reconnaissance system of aerial environment

    RU2846083C1