【24h】

RRT-Plan: a Randomized Algorithm for STRIPS Planning

机译:RRT-Plan:STRIPS规划的随机算法

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

摘要

We propose a randomized STRIPS planning algorithm called RRT-Plan. This planner is inspired by the idea of Rapidly exploring Random Trees, a concept originally designed for use in continuous path planning problems. Issues that arise in the conversion of RRTs from continuous to discrete spaces are discussed, and several additional mechanisms are proposed to improve performance. Our experimental results indicate that RRT-Plan is competitive with the state of the art in STRIPS planning.
机译:我们提出了一种随机的STRIPS计划算法,称为RRT-Plan。该计划者的灵感来自快速探索随机树的想法,该概念最初旨在用于连续路径规划问题。讨论了RRT从连续空间转换为离散空间时出现的问题,并提出了几种其他机制来提高性能。我们的实验结果表明,在STRIPS规划中,RRT-Plan与最先进的技术相比具有竞争力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号