Task assignment methodology of multiple tasks with order constraints for multiple robot system

多机器人系统多任务顺序约束的任务分配方法

• 批准号: 18500148
• 负责人: OTA Jun
• 金额: $ 2.59万
• 依托单位: The University of Tokyo
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2006
• 资助国家: 日本
• 起止时间: 2006 至 2007
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18500148/
• 关键词: multiple robots; motion planning; grasping; role allotment; task constraints; 群知能ロボット; 作業割付; 移動ロボット; 搬送

In former researches in mufti-robotics, in spite of its importance, there have been no propositions of task allocation scheme toward the problem involving "task constraints" that impose some restriction on the orders of task execution. In other studies involving task constraints such as job shop scheduling, task constraints are given by the designer. We address the problem that robots should calculate task constraints by themselves and should execute task allocation considering their constraints. As an example of such problem, we adopted rearrangement task of multiple movable objects. In this research, following subjects should be solved.1. Task allocation should be executed considering task constraints.2. Task constraints should be calculated as early as possible.Toward these subjects, we have obtained following results.1. By means of classification of task constraints, we have obtained calculation methods of task constraints and task allocation methods considering these constraints.2. We have promoted efficiency of calculation procedure of task constraints. First, we have analyzed calculation procedure from viewpoints when calculation should be done and how long it should be taken. Next, we have listed all possible procedure. Finally, we have tested these procedures in simulated environments. As a result, following method turns out to be the most effective: In every time of task allocation, robots should calculate some constraints that costs comparatively low calculation costs. And robots should calculate other constraints that cost comparatively high calculation costs only when robots fail to planned tasks.In future works, more flexible framework that divides given task into several small tasks is needed. For example, some objects should be temporarily set to adequate intermediate goals.

在以往的多机器人研究中，尽管任务分配的重要性，但对于涉及“任务约束”的问题，任务分配方案的命题还没有对任务执行顺序施加一定的限制。在其他涉及任务约束的研究中，如车间作业调度，任务约束是由设计者给出的。我们解决的问题，机器人应该自己计算任务的限制，并应执行任务分配考虑到他们的限制。作为此类问题的一个例子，我们采用了多个可移动对象的重排任务。本研究主要解决以下问题：1.任务分配应考虑任务约束.任务限制应尽早计算。针对这些被试，我们得到了以下结果。通过对任务约束的分类，得到了任务约束的计算方法和考虑这些约束的任务分配方法.提高了任务约束计算过程的效率。首先，从计算时间和计算时间的角度分析了计算过程。接下来，我们列出了所有可能的程序。最后，我们在模拟环境中测试了这些程序。因此，以下方法被证明是最有效的：在每次任务分配，机器人应该计算一些限制，成本相对较低的计算成本。而机器人只有在完成计划任务失败时才需要计算其他的约束条件，这些约束条件的计算代价相对较高，在未来的工作中，需要更灵活的框架将给定的任务分解为多个小任务。例如，某些对象应临时设置为适当的中间目标。

项目成果

「研究成果報告書概要(和文)」より

摘自《研究结果报告摘要（日文）》

• 发表时间: 2005
• 作者: Kawauchi;et. al.;Nishimura et al.;Dezawa et al.;Yoshizawa et al.;星野 幹雄;星野 幹雄
• 通讯作者: 星野 幹雄

Rearrangement Task by Multiple Mobile Robots with Efficient Calculation of Task Constraints

高效计算任务约束的多个移动机器人重排任务

• 发表时间: 2008
• 期刊: Advanced Robotics 22
• 作者: Norisuke Fujii and Jun Ota

Rearrangement Task by Multiple Mobile Robots with Efficient Calculation of Task Constrain

高效计算任务约束的多移动机器人重排任务

• 发表时间: 2008
• 期刊: Advanced Robotics 22
• 作者: Norisuke Fujii and Jun Ota;Norisuke Fujii and Jun Ota;Norisuke Fujii and Jun Ota
• 通讯作者: Norisuke Fujii and Jun Ota

効率的な順序制約計算手法を用いた複数物体搬送作業の移動ロボット群による実現

利用高效的顺序约束计算方法实现使用一组移动机器人的多物体运输工作

• 发表时间: 2007
• 期刊: 第12回ロボティクスシンポジア資料
• 作者: 藤井紀輔;周采霖;太田順
• 通讯作者: 太田順

Searching Methodology with Goal State Optimization considering Computational Resource Constraints

考虑计算资源约束的目标状态优化搜索方法

• 发表时间: 2006
• 期刊: Proc. 2006 IEEE Int. Conf. Robotics and Automat. (ICRA2006),
• 作者: Ota;J.
• 通讯作者: J.