首页> 外文会议>IEEE/RSJ International Conference on Intelligent Robots and Systems >Playing with several roadmaps to solve manipulation problems
【24h】

Playing with several roadmaps to solve manipulation problems

机译:玩几条路线图来解决操纵问题

获取原文

摘要

We propose in this paper a resolution scheme that is aimed to be relevant for a large class of manipulation planning problems. This endeavor complements our efforts in developing manipulation planning algorithms [2, 14, 13]. Indeed, we are convinced that a higher level of problems complexity, and particularly those involving multiple robots and multiple objects, will be accessible thanks to the introduction of a symbolic reasoning level. The resolution scheme relies on Probabilistic Roadmap Methods (PRMs) and on a reasoning level that adaptatively controls the construction and extension of a number of roadmaps. We consider this symbolic level as a step towards a systematic approach to integrate task planning and geometric planning in better conditions than trough a gross, and somewhat, artificial hierarchical decomposition. This paper describes the main ingredients of the proposed framework, and its first results.
机译:我们在本文中提出了一个决议计划,该计划旨在与大量操纵计划问题相关。这一努力补充了我们在开发操纵计划算法[2,14,13]方面的努力。实际上,我们相信,由于引入符号推理级别,我们将相信更高的问题复杂性,特别是那些涉及多个机器人和多个物体的问题。解决方案依赖于概率路线图方法(PRMS),并在推理水平上,适当地控制许多路线图的构造和延伸。我们认为这种符号级别作为迈向一种系统方法,将任务规划和几何规划集成在更好的条件下的系统方法,而不是粗略的条件,并且有些人工等级分解。本文介绍了拟议框架的主要成分及其第一个结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号