...
首页> 外文期刊>IAENG Internaitonal journal of computer science >Visual Landmark Selection for Mobile Robot Navigation
【24h】

Visual Landmark Selection for Mobile Robot Navigation

机译:移动机器人导航的视觉地标选择

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

摘要

A large number of landmarks selection techniques has been proposed. However, finding optimal solutions requires to solve some hard problems. In this paper, we consider the p-minimum overlapping region decomposition problem that was proposed for landmarks selection. This problem is NP-complete. We describe an approach to solve the problem optimally. This approach is based on an explicit reduction from the problem to the satisfiability problem. Also, we consider some greedy algorithms for solution of the problem.
机译:已经提出了大量的地标选择技术。但是,找到最佳解决方案需要解决一些难题。在本文中,我们考虑了为地标选择提出的p最小重叠区域分解问题。这个问题是NP完全的。我们描述了一种最佳解决问题的方法。此方法基于从问题到可满足性问题的显式减少。另外,我们考虑一些贪婪算法来解决问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号