Locating a robot from its distances, or range measurements, to three other known points or stations is a common operation, known as trilateration. This problem has been traditionally solved either by algebraic or numerical methods. An approach that avoids the direct algebrization of the problem is proposed here. Using constructive geometric arguments, a coordinate-free formula containing a small number of Cayley-Menger determinants is derived. This formulation accommodates a more thorough investigation of the effects caused by all possible sources of error, including round-off errors, for the first time in this context. New formulas for the variance and bias of the unknown robot location estimation, due to station location and range measurements errors, are derived and analyzed. They are proved to be more tractable compared with previous ones, because all their terms have geometric meaning, allowing a simple analysis of their asymptotic behavior near singularities. ; This work was supported by the project 'Design and implementation of efficient parallelizable algorithms with applications to robotics and proteomics' (J-00869). ; Peer Reviewed
Revisiting trilateration for robot localization
2005-01-01
doi:10.1109/TRO.2004.833793
Article (Journal)
Electronic Resource
English
DDC: | 629 |
Revisiting Trilateration Method Based on Time-of-Flight Measurements for Navigation
BASE | 2023
|Range Trilateration Error Analysis
IEEE | 1966
|Vector method for trilateration
Tema Archive | 1973
|ATS-5 trilateration support (Final rept.)
Tema Archive | 1975
|A trilateration scheme for relative positioning
NTRS | 2017
|