首页> 外国专利> ROBOT COOPERATIVE CONVEYANCE PLANNING DEVICE, METHOD AND PROGRAM

ROBOT COOPERATIVE CONVEYANCE PLANNING DEVICE, METHOD AND PROGRAM

机译:机器人合作式交通规划设备,方法和程序

摘要

PROBLEM TO BE SOLVED: To provide a robot cooperative conveyance planning technology capable of reducing a calculation time required for plan calculation or a memory capacity of a computer, while taking existence of a plurality of robots into consideration.;SOLUTION: A Markov state space is constituted hierarchically (an article orbital calculation processing is defined as a first hierarchy, a changeover position determination processing is defined as a second hierarchy, and a moving route planning processing is defined as a third hierarchy), and search for a movement plan is performed from a hierarchy having a low change frequency (first hierarchy), and a search range in a hierarchy having a high change frequency is restricted by using a result of search calculation in a hierarchy having a low change frequency, and search in a lower rank hierarchy (a second hierarchy, a third hierarchy) having a high change frequency is performed in the restricted state space.;COPYRIGHT: (C)2014,JPO&INPIT
机译:解决的问题:提供一种机器人协同运输计划技术,该技术能够在考虑多个机器人的情况下,减少计划计算所需的计算时间或计算机的存储容量。分层构成(将物品轨道计算处理定义为第一层次,将转换位置确定处理定义为第二层次,将移动路线计划处理定义为第三层次),并从中搜索移动计划通过使用具有低变化频率的层级中的搜索计算结果来限制具有较低变化频率的层级(第一层级)和具有高变化频率的层级中的搜索范围,并在较低等级的层级中进行搜索(在受限状态空间中执行具有较高更改频率的第二层次(第三层次)。;版权所有:(C)2014,JPO&IN坑

著录项

  • 公开/公告号JP2014079819A

    专利类型

  • 公开/公告日2014-05-08

    原文格式PDF

  • 申请/专利权人 NIPPON TELEGR & TELEPH CORP NTT;

    申请/专利号JP20120227349

  • 发明设计人 KAWANO HIROSHI;

    申请日2012-10-12

  • 分类号B25J13/00;

  • 国家 JP

  • 入库时间 2022-08-21 16:15:27

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号