A positive semidefinite relaxation localization method utilizing multi-time measurement information

By constructing a multi-time measurement model and using a semi-positive definite programming method, the problem of limited positioning accuracy caused by single-time measurement information was solved, and higher accuracy positioning and velocity estimation were achieved.

CN118131124BActive Publication Date: 2026-11-17UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410280500.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-12
Publication Date
2026-11-17
Estimated Expiration
2044-03-12

AI Technical Summary

Technical Problem

Most existing positioning algorithms rely on measurement information at a single moment, which limits positioning accuracy and makes it difficult to meet the high-precision requirements of moving targets.

Method used

A multi-time measurement model was constructed and solved using a semi-positive definite programming approach via the CVX toolbox in Matlab to achieve high-precision positioning.

Benefits of technology

The semidefinite relaxation positioning method, which uses multi-time measurement information, significantly improves positioning accuracy and can estimate the target's velocity.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118131124B_ABST
    Figure CN118131124B_ABST
Patent Text Reader

Abstract

This invention belongs to the field of target localization technology and relates to a positive semidefinite relaxation localization method utilizing multi-time measurement information. The invention first constructs a multi-time measurement model to further improve target localization accuracy by utilizing multi-time measurement information. By constructing a maximum likelihood estimation problem, and combining convex optimization theory with positive semidefinite relaxation techniques, the non-convex objective function and equality constraints are transformed into a convex form. Then, the CVX toolbox in Matlab is used to solve this positive semidefinite programming problem using interior point analysis. Experimental simulations show that the method of this invention has higher localization accuracy than the traditional single-time two-step weighted least squares localization algorithm, achieving better localization results and demonstrating the effectiveness of the method.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of target localization technology and relates to a semidefinite relaxation localization method that utilizes multi-time measurement information. Background Technology

[0002] In recent years, with the rapid development of mobile communication and wireless sensor network technologies, positioning technology has played a crucial role in various fields. In applications such as intelligent health monitoring and autonomous driving, accurate mobile positioning systems can provide critical location information, thereby supporting intelligent decision-making and service implementation. However, most existing positioning algorithms utilize single-moment measurement information for target localization, and the positioning accuracy of these algorithms is limited by the Cramer-Rao bound of the single-moment measurement model itself. Therefore, for moving targets, how to utilize multi-moment measurement information to further improve positioning accuracy is an important research direction. Summary of the Invention

[0003] The purpose of this invention is to address the problem of how to further improve target positioning accuracy by utilizing multi-time measurement information. Taking TOA (Time-of-Area) technology as an example, a multi-time measurement model is first constructed, and a positioning method based on positive semidefinite programming is proposed. The multi-time measurement model assumes that the target node moves at approximately a constant speed within a short measurement period, and distance measurement information is collected at time intervals of T, thereby obtaining multi-time measurement information. This invention achieves high-precision positioning of moving targets based on positive semidefinite programming. Comparison with the traditional two-step weighted least squares (TSWLS) algorithm demonstrates the effectiveness and superiority of this method.

[0004] The technical solution of this invention is:

[0005] The semidefinite relaxation localization method utilizing multi-time measurement information first requires building a multi-time measurement model. Then, based on this model and the concept of semidefinite programming, a convex optimization localization problem is constructed. This problem is then solved using the CVX toolbox in Matlab, yielding high-precision localization results. The specific steps are as follows:

[0006] Step 1: Build a multi-time measurement model.

[0007] In a two-dimensional plane, consider N fixed anchor nodes s1, s2...s with known positional error information. N And a moving target node x to be located A two-dimensional wireless sensor network. x represents the target's initial state information. A four-dimensional vector, s i It represents the actual location information of the i-th anchor node [x] i yi ] Τ A two-dimensional vector.

[0008] Step 2: Obtain the distance measurement values ​​of TOA at multiple time points.

[0009] First, with a time interval of T, observe M times and obtain the distance measurement value of TOA. Then, at the j-th measurement time, the target's position coordinate vector x j It can be represented as:

[0010]

[0011]

[0012] The true distance r between the target and the i-th anchor node at the j-th measurement time. ji for:

[0013] r ji =||x j -s i ||=||Ψ j xs i ||

[0014] Since there are errors in the actual distance measurement and anchor node position, let's assume that the distance measurement error and the positioning error are both independent and follow zero-mean Gaussian white noise. The variance of the distance measurement error is... The variance of the positioning error is The measured values ​​are as follows:

[0015]

[0016]

[0017]

[0018] in, This represents the distance r between the target and the i-th anchor node at the j-th measurement time. ji Distance error, and These represent the positioning errors of the horizontal and vertical coordinates of the i-th anchor node, respectively.

[0019] Step 3: Construct the objective function for the MLE localization problem.

[0020] Based on the distance measurements at multiple times, a Mean Exhaustive (MLE) problem can be derived:

[0021]

[0022] Wherein, the matrix is ​​defined. matrix These are the measured values ​​of each element of matrix P; however, in actual positioning processes, it is impossible to obtain the target's position coordinates at every moment. Yes, it can make This does not affect the execution of the entire algorithm.

[0023] Let matrix G = PP Τ Then the original objective function can be equivalently expressed as:

[0024]

[0025] Step 4: Add inequality constraints.

[0026] Given distance value r ji =||x j -s i ||, using the second-order cone relaxation technique to convert to r ji ≥||P(j,:)-P(M+i,:)||, then define the auxiliary variable d. ji :

[0027]

[0028] Substitute matrix G as the optimization variable into the above MLE problem to be optimized. At the same time, in order not to change the equivalence of the problem, let G = PP. Τ As an equality constraint, the constraint in the above equation can be rewritten as:

[0029]

[0030] Step 5: Perform non-convex constraint relaxation using semidefinite relaxation.

[0031] Since G=P Τ Since P is non-convex, according to the Schur complement theorem, this equality constraint can be equivalently transformed into:

[0032]

[0033] Among them, rank 1 is a non-convex constraint condition, which can be directly discarded.

[0034] Organize the convex constraints and objective function:

[0035]

[0036] Step 6: Use the CVX toolbox in Matlab to solve for the localization result.

[0037] The beneficial effects of this invention are:

[0038] This invention proposes a positioning method based on semidefinite programming, utilizing multi-time measurement information, which achieves higher positioning accuracy than algorithms based on single-time measurement information. Furthermore, this method can not only locate the target but also effectively estimate its velocity. Attached Figure Description

[0039] Figure 1 This is a schematic diagram of the method flow of the present invention;

[0040] Figure 2 To compare our method with the traditional CRLB and two-step weighted least squares algorithm under different ranging errors;

[0041] Figure 3 To compare our method with the traditional CRLB and two-step weighted least squares algorithm under different positioning errors;

[0042] Figure 4 To compare this method with the traditional CRLB and two-step weighted least squares algorithm under different numbers of measurement points. Detailed Implementation

[0043] The present invention will now be described in detail with reference to the accompanying drawings and examples.

[0044] like Figure 1 As shown, the process of this invention is as follows: First, a multi-time measurement model is built. Then, with T as the time interval, the distance between the target and each anchor node is obtained at M time intervals. A semi-definite programming localization problem is constructed using these distance measurements and the anchor node position coordinates with errors. Then, equality constraints are added. By using auxiliary vectors and semi-definite relaxation techniques, some non-convex constraints can be transformed into convex constraints. Thus, a semi-definite programming localization problem based on the multi-time measurement model can be obtained. Here, the CVX toolbox of Matlab is used to solve this localization problem to obtain the target's position and velocity estimates.

[0045] Implementation Case:

[0046] Step 1: Build a multi-time measurement model.

[0047] In a two-dimensional plane, consider N fixed anchor nodes s1, s2...s with known positional error information. N And a moving target node x to be located A two-dimensional wireless sensor network. x represents the target's initial state information. A four-dimensional vector, s i It represents the actual location information of the i-th anchor node [x] i y i ]Τ A two-dimensional vector is observed M times with a time interval of T.

[0048] Step 2: Obtain the distance measurement values ​​of TOA at multiple times and the anchor node location information.

[0049] Obtain the distance measurement values ​​of TOA at M time points. and anchor node location information

[0050] Step 3: Construct the objective function for the MLE localization problem.

[0051] Based on the distance measurements at multiple times, a Mean Exhaustive (MLE) problem can be derived:

[0052]

[0053] Step 4: Add inequality constraints.

[0054]

[0055] Step 5: Perform non-convex constraint relaxation using semidefinite relaxation.

[0056]

[0057] Organize the convex constraints and objective function:

[0058]

[0059] Step 6: Solve using Matlab's CVX toolbox.

[0060] To verify the effectiveness of the method of the present invention, the following positioning scenario was constructed, and a Monte Carlo simulation experiment was conducted to verify the method of the present invention. In a two-dimensional space, there are five anchor nodes and one moving target node. The actual position coordinates of the anchor nodes are: (0,0)m, (100,100)m, (-100,100)m, (-100, -100)m, and (100, -100)m. The initial position of the target node is randomly generated in the range of [-100, 100]m, and the velocity is randomly generated in the range of [-10, 10]m / s. The time interval is assumed to be T = 0.1s.

[0061] Based on the aforementioned positioning scenario, the Monte Carlo simulation was run 1000 times, and the root mean square error (RMSE) was used as the performance evaluation metric for the positioning algorithm. The simulation experiment employed the controlled variable method, comparing the proposed method with existing single-moment measurement models' CRLB and two-step weighted least squares algorithms under different ranging errors, positioning errors, and the number of measurement points. Figure 2The comparison chart shows the method of this invention with traditional CRLB and positioning algorithms under different ranging errors, assuming a fixed positioning error and number of measurement points. Figure 3 The comparison chart shows the method of this invention with traditional CRLB and positioning algorithms under different positioning errors, assuming a fixed ranging error and number of measurement points. Figure 4 The figures show a comparison between the method of this invention and traditional CRLB and positioning algorithms under different numbers of measurement points, with fixed ranging errors and positioning conditions. It is clear from the three figures that the method of this invention, by acquiring measurement information at multiple time points, can achieve higher positioning accuracy. Especially under the same noise conditions, the positioning accuracy of the method of this invention increases with the number of measurement time points.

Claims

1. A semi-positive definite relaxation localization method utilizing multi-time measurement information, characterized in that, Includes the following steps: S1, Set in a two-dimensional wireless sensor network, including A known fixed anchor node with positioning error information A moving target node to be located. , It contains the target's initial state information. A four-dimensional vector, It represents the first Real location information of each anchor node a two-dimensional vector, ; S2, with The time interval is the observation target. The distance measurement value of TOA is obtained again, and in the second... At each measurement moment, the target's position coordinate vector Represented as: , No. At the measurement time, the target and the first The actual distance between anchor nodes for: , Since there are errors in the actual distance measurement and anchor node position, the distance measurement error and the positioning error are defined as independent and obeying zero-mean Gaussian white noise. The variance of the distance measurement error is... The variance of the positioning error is Then the distance measurement value and the measured values ​​of the horizontal and vertical coordinates of the anchor nodes , They are respectively: , in, Indicates the first At the measurement time, the target and the... Distance between anchor nodes Distance error, and They represent the first Positioning error of the horizontal and vertical coordinates of each anchor node; S3. Based on the distance measurements at multiple time points, a Mean Exhaustive Limitation (MLE) problem is derived: , Wherein, the matrix is ​​defined. ,matrix It is a matrix Measured values ​​of each element; Let matrix Then the original objective function is equivalent to: ; S4, known distance value Using the second-order cone relaxation technique to convert Define auxiliary variables : , matrix We will use these variables as optimization variables in the above-mentioned MLE problem to be optimized. At the same time, to maintain the equivalence of the problem, we will... As an equality constraint, the constraint condition of the objective function can be rewritten as: , S5, due to Since it is non-convex, according to the Schur complement theorem, the equality constraint is equivalently transformed into: , Among them, rank 1 is a non-convex constraint condition, which can be directly discarded; The convex constraint conditions and objective function are summarized as follows: ; S6. Use the CVX toolbox in Matlab to solve for the localization result.