Convex optimization method for determining target three-dimensional coordinates by utilizing one-dimensional direction finding

Abstract

The invention belongs to the technical field of electronic information, relates to a convex optimization method for determining target three-dimensional coordinates by utilizing one-dimensional directfinding, and aims at solving the problem that the nonlinear least square method needs three-dimensional search and the pseudo-linear least square method needs no less than 6 observation stations in the background art of one-dimensional direction finding-based three-dimensional positioning. Through converting the one-dimensional direction finding-based three-dimensional positioning problems into convex problems, the nonlinear constraint relationship between variables is utilized, so that the positioning precision is improved, the three-dimensional coordinate search is avoided, and the positioning timeliness is improved; and under the condition that the observation stations are less than 6, the three-dimensional positioning for targets is realized by utilizing one-dimensional direction finding results and orientation measurement of linear arrays.

Description

technical field [0001] The invention belongs to the technical field of electronic information, and relates to a convex optimization method for determining the three-dimensional coordinates of the target through the one-dimensional direction finding of the target by a plurality of observation stations. Background technique [0002] According to the measurement of the signal parameters used, the radio positioning technology can be divided into ranging positioning, direction finding positioning and frequency measuring positioning. It is widely used in fields such as radio positioning. [0003] In the commonly used direction finding and positioning system, each observation station uses a linear array or an area array to perform one-dimensional or two-dimensional direction finding on the target, and then combines the geographical coordinates of the observation station for cross positioning to calculate the two-dimensional direction of the target position. coordinates or three-di...

AI Technical Summary

Problems solved by technology

Using the commonly used nonlinear least squares method to solve the three-dimensional coordinates of the target, it is necessary to determine the minimum position of a three-dimensional nonlinear cost function, but the calculation of the three-dimensional search is large, for example, within the range of each cubic kilometer, even one-dimensional coordinates The search interval is 10 meters, and 1 million three-dimensional coordinates need to be searched, which is not conducive to real-time positioning

The Chinese patent "A Three-dimensional Positioning Method Based on One-dimensional Direction Finding" with the application number of 201710333182.8 proposes to perform pseudo-linear processing on nonlinear equations, and use the pseudo-linear least squares method to obtain the three-dimensional coordinate estimation of the target position, but this method Due to ignoring the nonlinear constraint relationship between variables after pseudo-linear processing, not only no less than 6 observation stations are required, but also the positioning accuracy is not high

Images