首页> 外文学位 >Building topological maps using minimalistic sensor models.
【24h】

Building topological maps using minimalistic sensor models.

机译:使用简约的传感器模型构建拓扑图。

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

摘要

This dissertation addresses the problem of simultaneous localization and mapping for miniature robots that have extremely poor odometry and sensing capabilities. Existing robotic mapping algorithms generally assume that the robots have good odometric estimates and have sensors that can return the range or bearing to landmarks in the environment. This work focuses on solutions to this problem for robots where the above assumptions do not hold.; A novel method is presented for a sensor poor mobile robot to create a topological estimate of its path through an environment by using the notion of a virtual sensor that equates “place signatures” with physical locations in space. The method is applicable in the presence of extremely poor odometry and does not require sensors that return spatial (range or bearing) information about the environment. Without sensor updates, the robot's path estimate will degrade due to the odometric errors in its position estimates. When the robot re-visits a location, the geometry of the map can be constrained such that it corrects for the odometric error and better matches the true path.; Several maximum likelihood estimators are derived using this virtual sensor methodology. The first estimator uses a physics-inspired mass and spring model to represent the uncertainties in the robot's position and motion. Errors are corrected by relaxing the spring model through numerical simulation to the state of least potential energy. The second method finds the maximum likelihood solution by linearizing a Chi-squared error function. This method has the advantage of explicitly dealing with dependencies between the robot's linear and rotational errors. Finally, the third method employs the iterated form of the Extended Kalman Filter. This method has the advantage of providing a real-time update of the robot's position where the others process all the data at once.; Finally, a method is presented for dealing with multiple locations that cannot be disam-biguated because their signatures appear to be identical. In order to decide which sensor readings are associated with what positions in space, the robot's sensor readings and motion history are used to calculate a discrete probability distribution over all possible robot positions.
机译:本文针对里程和传感能力极差的微型机器人同时定位和制图的问题进行了研究。现有的机器人映射算法通常假定机器人具有良好的里程估算,并且具有可以使范围返回或指向环境中地标的传感器。这项工作着眼于上述假设不成立的机器人的解决方案。针对传感器匮乏的移动机器人,提出了一种新方法,该方法通过使用虚拟传感器的概念创建其通过环境的路径的拓扑估计,该虚拟传感器将“位置标记”等同于空间中的物理位置。该方法适用于极差的测距法,并且不需要返回关于环境的空间(范围或方位)信息的传感器。如果没有传感器更新,则机器人的路径估计将由于其位置估计中的里程误差而降低。当机器人再次访问某个位置时,可以限制地图的几何形状,以使其校正测距误差并更好地匹配真实路径。使用这种虚拟传感器方法可以导出几个最大似然估计器。第一个估算器使用受物理学启发的质量和弹簧模型来表示机器人位置和运动的不确定性。通过数值模拟将弹簧模型松弛到最小势能状态,可以纠正错误。第二种方法是通过线性化卡方误差函数来找到最大似然解。这种方法的优点是可以明确处理机器人线性误差和旋转误差之间的依赖性。最后,第三种方法采用扩展卡尔曼滤波器的迭代形式。这种方法的优点是可以实时更新机器人的位置,其他机器人可以同时处理所有数据。最后,提出了一种用于处理多个位置的方法,这些位置由于其签名看起来是相同的而无法消除歧义。为了确定哪些传感器读数与空间中的哪个位置相关联,机器人的传感器读数和运动历史用于计算所有可能的机器人位置上的离散概率分布。

著录项

  • 作者

    Rybski, Paul Edmund.;

  • 作者单位

    University of Minnesota.;

  • 授予单位 University of Minnesota.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2003
  • 页码 145 p.
  • 总页数 145
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号