首页> 外文会议>2019 IEEE International Conference on Pervasive Computing and Communications Workshops >Scene Context-aware Rapidly-exploring Random Trees for Global Path Planning
【24h】

Scene Context-aware Rapidly-exploring Random Trees for Global Path Planning

机译:场景上下文感知快速探索的随机树用于全局路径规划

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

摘要

This paper introduces a global path planning method for autonomous systems. Global path planning finds a feasible and collision-free path in an environment in which various kinds of regions and objects exist. However, the most planning methods use information such as collision-free space and obstacles in the environment. Interactions at each region (e.g., sidewalk and pavement) would be different. In this paper, we propose a method for global path planning taking semantic scene context into account. In contrast to conventional path planning methods which use collision-free and obstacle regions, the proposed method represents an environment as a cost map. The cost map is estimated from demonstrated human behaviors and feature maps derived from semantic scene context. To find a path on the cost map, we define a path cost and leverage an optimal rapidly-exploring random tree (RRT*) algorithm. We evaluate the proposed method regarding accuracy and computational efficiency with two public datasets and our contributed dataset. Experimental results show that our method successfully reproduces paths like human behaviors in short computational time.
机译:本文介绍了一种用于自治系统的全局路径规划方法。全局路径规划可在存在各种区域和对象的环境中找到可行且无冲突的路径。但是,大多数规划方法都使用诸如无碰撞空间和环境中的障碍物之类的信息。每个区域(例如人行道和人行道)的交互作用会有所不同。本文提出一种考虑语义场景上下文的全局路径规划方法。与使用无碰撞和障碍区域的常规路径规划方法相比,所提出的方法将环境表示为成本图。成本图是根据已证明的人类行为和语义场景上下文得出的特征图进行估算的。为了在成本图上找到一条路径,我们定义了一条路径成本并利用最优的快速探索随机树(RRT *)算法。我们使用两个公共数据集和我们提供的数据集评估了关于准确性和计算效率的建议方法。实验结果表明,我们的方法能够在较短的计算时间内成功重现类似人类行为的路径。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号