I've been scouring the Internet for enlightenment but so far I've found very little that has helped. To be fair, I'm not a math major and might just not be using the right search queries.
I'm working on a system for outdoor WiFi localization. My experimental data suggests that using the RSSI (received signal strength) gives enough accuracy for the resolution we need, which is where the math - and you good folks - come in. I'd like to use trilateration to find a device's location, possibly using more than 3 beacons with known locations.
With the variability of the RSSI at a given distance it is highly unlikely that trilateration will produce circles with a single common intersection. As such, I need to be able to calculate the point in 2D space that is closest to the edges of all 3+ circles.
At the moment I am coding in python, if that makes a difference to anyone.
What are my options?
Thanks!
Let $C_1,C_2,\dots C_n$ be given circles of the plane and $A$ be a point. Let $d_i$ be the distance from the point $A$ to $C_i$ for each $i$. Which value you wish to minimize? $\max_i d_i$? $(\sum_i d^2_i)^{1/2}$? $\sum_i d_i$? Or another? – Alex Ravsky Apr 19 '13 at 23:23