void CalculateAnchorPositions()
{
//TODO: some assertion to make sure the ranges dict is full
foreach (string anchorName in AnchorNames)
{
MLAT.GdescentResult result = MLAT.mlat(knownTagPositions, anchorToTestPoints[anchorName], bounds);
anchorPositions[anchorName] = result.estimator;
}
}
static void Main(string[] args)
{
System.Random random = new SystemRandomSource();
double W = 9, L = 9, H = 3;
Matrix <double> anchors = DenseMatrix.OfArray(new double[, ] {
{ 0, 0, H },
{ W, 0, H },
{ W, L, H },
{ 0, L, H }
});
Vector <double> node = DenseVector.OfArray(new double[] {
W *random.NextDouble(),
L *random.NextDouble(),
H *random.NextDouble()
});
Vector <double> ranges = Vector <double> .Build.Dense(anchors.RowCount);
double error = 0.5;
Vector <double> ranges_with_error = DenseVector.OfVector(ranges);
for (int i = 0; i < anchors.RowCount; i++)
{
ranges[i] = Distance.Euclidean(anchors.Row(i), node);
ranges_with_error[i] = ranges[i] + 2 * error * (random.NextDouble() - 0.5);
}
// TODO: You need to define search space boundary to prevent UNEXPECTED RESULT
// If not, search space boundary is defined as a cube constrained to
// minimum and maximum coordinates of x, y, z of anchors
// If anchors are in the same plane, i.e., all anchors have the same (similar)
// coordinate of at least one axes, you MUST define search space boundary
// So, defining search space boundary is all up to you
Matrix <double> bounds = new DenseMatrix(2, anchors.ColumnCount);
for (int i = 0; i < anchors.ColumnCount; i++)
{
bounds[0, i] = anchors.Column(i).Minimum();
bounds[1, i] = anchors.Column(i).Maximum();
}
// hard coded minimum height (0 m) of search boundary
bounds[0, anchors.ColumnCount - 1] = 0;
MLAT.GdescentResult gdescent_result = MLAT.mlat(anchors, ranges_with_error, bounds);
Console.WriteLine("Anchors");
Console.WriteLine(anchors);
Console.WriteLine("Node");
Console.WriteLine(node);
Console.WriteLine("Ranges");
Console.WriteLine(ranges);
Console.WriteLine("Ranges with error");
Console.WriteLine(ranges_with_error);
Console.WriteLine("Estimator");
Console.WriteLine(gdescent_result.estimator);
Console.WriteLine("Full result");
Console.WriteLine(gdescent_result.estimator_candidate);
Console.WriteLine(gdescent_result.error);
// prevent closing
Console.ReadLine();
}
