利用信号强度的三角剖分算法 [英] Triangulation algorithm using signal strength

问题描述

我想估计一个使用周围蜂窝塔的用户的位置.对于每个塔，我都有一个位置和信号强度.现在，我使用一种简单的坐标方法，但是它不是很准确(用户不一定要在两个塔之间).

I want to have an estimation of the location of a user using the surrounding cell towers. For each tower, I have a location and a signal strength. Now I use a simple means of the coordinates but it is not very accurate (the user is not necessarily between the two towers).

我猜解决方案是在每个塔周围画一个圆(信号强度越小，它越大)，然后它们计算圆之间的交点.我通常没有三个以上的手机信号塔.

I guess the solution is to draw a circle around each tower (the less the signal strength is, the larger it will be) and them compute the intersection between the circles. I usually don't have more than 3 cell towers.

任何想法如何?我找到了Delaunay三角剖分方法，但我认为它在这里不适用.

Any idea how ? I found the Delaunay triangulation method but I don't think it applies here.

谢谢

推荐答案

您需要将每个信号强度转换为距离的估计值，然后使用每个距离(作为圆的半径)进行三角测量.您至少需要三个发射器来解决歧义，并且准确性不会很高，因为信号强度仅与距离密切相关，并且会受到现实世界中众多外部因素的影响.请注意，在理想条件下，信号强度遵循带距离的平方反比定律.

You need to convert each signal strength to an estimate of distance and then use each distance (as the radius of a circle) in order to triangulate. You'll need at least three transmitters to resolve ambiguity, and accuracy will not be great, since signal strength is only very approximately related to distance and is affected by numerous external factors in the real world. Note that in ideal conditions, signal strength follows an inverse square law with distance.

这篇关于利用信号强度的三角剖分算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！