Graduate Convergence issue in this Least Squares calculation

Click For Summary
SUMMARY

The discussion centers on a convergence issue encountered during a Least Squares calculation for trajectory computation using DTOA (difference in time of Arrival) measurements from five stations. The user employs a linear model represented by Y = Ax + b, where Y denotes observed measurements, A is the design matrix, b is the known terms vector, and X is the vector of estimates. Convergence is achieved when the initialization point is within the polygon formed by the stations, but fails when initialized outside this area, indicating a dependency on the initial conditions for successful convergence.

PREREQUISITES
  • Understanding of Least Squares estimation techniques
  • Familiarity with DTOA (difference in time of Arrival) measurements
  • Knowledge of linear models in statistical analysis
  • Experience with iterative algorithms and convergence criteria
NEXT STEPS
  • Investigate the impact of initial conditions on convergence in iterative algorithms
  • Explore methods to analyze iterative rms error data for convergence insights
  • Learn about advanced initialization techniques for Least Squares problems
  • Study the geometric interpretation of convergence in multi-station systems
USEFUL FOR

Data scientists, engineers, and researchers involved in trajectory computation, particularly those utilizing Least Squares methods and DTOA measurements in multi-station setups.

ChiPi
Messages
2
Reaction score
0
TL;DR
I am not able to reach convergence if I initialize the starting point with coordinates outside the stations net. The observations are Difference in Time of Arrival.
I'm computing the trajectory of a moving body and my net is composed by 5 stations.
My observations are DTOA: difference in time of Arrival (they have been linearized).
I am trying to use Least Squares with a linear model: Y = Ax + b, where Y are the observed measurements (DTOA), A the design matrix, b is the known terms vector and X is a vector of estimates. The algorithm processes data according to the epoch considered and iterate the process up to a value of 20 times, unless it reaches before a 1mm convergence.

Since it is an iterative process, the system requires an initialization at the starting point with approximated values for the unknowns, and here comes my problem: if I initialize the starting point with coordinates within the polygon formed by the five stations convergence is reached and the solution is successful, but if I initialize the point with coordinates outside the area formed by the stations the convergence is not reached and I’m not able to determine the trajectory.

Does anyone of you have an explanation for this?
 
Physics news on Phys.org
I have a pretty good idea but you should figure this out. Do you have access to the iterative rms error data? Does is say anything to you?
 
hutchphd said:
I have a pretty good idea but you should figure this out. Do you have access to the iterative rms error data? Does is say anything to you?
I don't have access to it but I can add it at the code if it can help in figuring out the problem. What was your idea?
 
If there are an infinite number of natural numbers, and an infinite number of fractions in between any two natural numbers, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and... then that must mean that there are not only infinite infinities, but an infinite number of those infinities. and an infinite number of those...

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
24
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 3 ·
Replies
3
Views
6K