首页> 外文会议>Intelligent Robots and Systems, 2005. (IROS 2005). 2005 IEEE/RSJ International Conference on >Near minimum time path planning for bearing-only localisation and mapping
【24h】

Near minimum time path planning for bearing-only localisation and mapping

机译:仅用于方位定位和映射的近最小时间路径规划

获取原文

摘要

The main contribution of this paper is an algorithm for integrating motion planning and simultaneous localisation and mapping (SLAM). Accuracy of the maps and the robot locations computed using SLAM is strongly dependent on the characteristics of the environment, for example feature density, as well as the speed and direction of motion of the robot. Appropriate control of the robot motion is particularly important in bearing-only SLAM, where the information from a moving sensor is essential. In this paper a near minimum time path planning algorithm with a finite planning horizon is proposed for bearing-only SLAM. The objective of the algorithm is to achieve a predefined mapping precision while maintaining acceptable vehicle location uncertainty in the minimum time. Simulation results have shown the effectiveness of the proposed method.
机译:本文的主要贡献是一种用于集成运动计划和同时定位与映射(SLAM)的算法。使用SLAM计算的地图和机器人位置的准确性在很大程度上取决于环境特征,例如特征密度以及机器人的运动速度和方向。在仅轴承的SLAM中,对机器人运动的适当控制尤为重要,在SLAM中,来自移动传感器的信息至关重要。本文针对纯轴承SLAM提出了一种具有有限规划范围的近最小时间路径规划算法。该算法的目的是实现预定的映射精度,同时在最短的时间内保持可接受的车辆位置不确定性。仿真结果表明了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号