首页> 外文学位 >DIRSAC: A directed sample and consensus algorithm for localization with quasi-degenerate data.
【24h】

DIRSAC: A directed sample and consensus algorithm for localization with quasi-degenerate data.

机译:DIRSAC:一种针对准退化数据进行定位的定向样本和共识算法。

获取原文
获取原文并翻译 | 示例

摘要

Autonomous robotic platforms are gaining interest in the scientific and military communities as well as in many industrial and commercial applications. For tractable generic autonomous operation, an autonomous system must maintain an accurate estimate of position and orientation (pose) within a local environment, commonly referred to as ego-motion estimation.;Most state of the art robotic systems have some range sensing capability which can be used to perform obstacle detection and/or avoidance, do model inspection and generation, or perform system navigation. Over the last decade the robotics and automation community has started to take advantage of this underutilized sensing modality to not only perform mapping, but also localization by matching scan data during motion. Because real world sensing is noisy and models are imperfect, this typically works best if wrapped in some type of robust estimator capable of rejecting outliers such as RANSAC. While RANSAC has been shown to be a powerful and ubiquitous tool, it often suffers in practice from overwhelmingly redundant and non-constraining data. However, we can improve the robustness and convergence of the common RANSAC algorithm by replacing the purely random search with a more directed version especially when the data is highly degenerate.;In this thesis, we derive, implement and evaluate an improved algorithm for point selection that analyzes the effect of each point on reducing the sensor's pose covariance. This is done by developing a simple Jacobian relating the sensor's measurements to the sensor's pose. Based on this Jacobian, we can translate uncertainties in the sensor's measurements to uncertainties of the pose and actively remove redundancies in the data. We identify redundant points by computing the Mutual Information between points and analyzing the relative information content overlap with previously selected points. We do this while keeping the flavor of the random sampling from RANSAC which maintains robustness to outlier contamination. We demonstrate increased performance with more reliable convergence by comparing our modified approach to that of common RANSAC in several quasi-degenerate cases. We also compare our approach to a similar approach which operates on quasi-degenerate data in a slightly different context of a 3D homography. We have also developed a metric by which we can score the level of degeneracy of the collected data from the perspective of constraining the pose solution.
机译:自主机器人平台在科学和军事领域以及许多工业和商业应用中都引起了人们的兴趣。对于易处理的通用自治操作,自治系统必须在本地环境中保持对位置和方向(姿势)的准确估计,通常称为自我运动估计。用于执行障碍检测和/或避让,模型检查和生成或执行系统导航。在过去的十年中,机器人技术和自动化社区已开始利用这种未充分利用的传感方式来不仅执行映射,而且还通过在运动过程中匹配扫描数据来进行定位。由于现实世界中的噪声非常嘈杂,并且模型不完善,因此,如果将其封装在能够拒绝RANSAC等离群值的某种鲁棒估计器中,通常效果最好。尽管已证明RANSAC是一种功能强大且无处不在的工具,但实际上,它经常遭受压倒性的冗余和无约束数据的困扰。然而,我们可以通过用更有针对性的版本替换纯随机搜索来提高普通RANSAC算法的鲁棒性和收敛性,尤其是在数据高度退化的情况下。分析每个点对减少传感器的姿态协方差的影响。这是通过建立一个简单的雅可比矩阵将传感器的测量值与传感器的姿势相关联来完成的。基于此雅可比行列式,我们可以将传感器测量结果中的不确定性转换为姿势的不确定性,并主动消除数据中的冗余。我们通过计算点之间的互信息并分析与先前选择的点重叠的相对信息内容来识别冗余点。我们这样做的同时要保留来自RANSAC的随机采样的风格,以保持对异常污染的鲁棒性。通过将我们的改进方法与几种类似简并的情况下的普通RANSAC方法进行比较,我们证明了性能的提高和更可靠的收敛。我们还将我们的方法与在3D单应性稍有不同的情况下对准简并数据进行操作的类似方法进行比较。我们还开发了一种度量标准,通过它可以从约束姿势解决方案的角度对收集的数据的退化程度进行评分。

著录项

  • 作者

    Baker, Chris L.;

  • 作者单位

    Colorado School of Mines.;

  • 授予单位 Colorado School of Mines.;
  • 学科 Engineering General.;Computer Science.;Engineering Robotics.
  • 学位 Ph.D.
  • 年度 2013
  • 页码 117 p.
  • 总页数 117
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号