.png){kind=icon}
返回
Revisiting trilateration for robot localization
.png){kind=icon}
OA
AI
DOI：10.1109/TRO.2004.833793.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Cayley-Menger determinants
error analysis
numerical conditioning
robot localization
trilateration
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容