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

A technology of three-dimensional coordinates and convex optimization, applied in the field of electronic information, can solve the problems of large amount of calculation in three-dimensional search, low positioning accuracy, unfavorable real-time positioning, etc., achieve the effect of reducing calculation amount, improving positioning accuracy, and realizing real-time positioning

Active Publication Date: 2019-06-14
UNIV OF ELECTRONIC SCI & TECH OF CHINA +1
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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-di

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Convex optimization method for determining target three-dimensional coordinates by utilizing one-dimensional direction finding
  • Convex optimization method for determining target three-dimensional coordinates by utilizing one-dimensional direction finding
  • Convex optimization method for determining target three-dimensional coordinates by utilizing one-dimensional direction finding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0027] This example takes 7 observatories with known positions and 1 target that needs to be positioned on a three-dimensional plane as an example. The position coordinates of the observatories are (236.9,-254.3,0), (2.4,-250.6,0), (37.3,-114.1,0), (173.6,213.2,0), (-89.4,-15.4,0), (-167.8,-105.4,0), (193.6,-23.9,0) meters, each observation The station is configured with a line array placed horizontally. The included angle between the line array and the x-axis of the Cartesian coordinates of the ground plane is (4.2360; ,346.0,810.3) meters.

[0028] The specific implementation process of this example is as follows:

[0029] Step 1: Observation stations are located on a plane, the number N of observation stations is initialized to be 7, and the position coordinates B n Respectively (236.9,-254.3,0), (2.4,-250.6,0), (37.3,-114.1,0), (173.6,213.2,0), (-89.4,-15.4,0), (-167.8 ,-105.4,0), (193.6,-23.9,0) meters, determine the angle α between the linear array of seven observatio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G01S5/04G01S5/00
Inventor 万群李明兵李逸君王子强郭贤生邹麟庄杰
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products