Reusing Past Plans in Distributed Planning
Reusing Past Plans in Distributed Planning
复制标题
在分布式规划中重用过去的计划
DOI：
--
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
T. Sugawara
中科院分区：
文献类型：
--
作者：
T. Sugawara
本文描述了多智能体领域中的计划重用问题。在分布式规划中，计划是由具有自己观点的分布式规划代理中心创建的。针对单智能体规划，提出了将过去的计划结果重用到新问题的计划重用方法，可以实现高效的规划。将其应用于分布式规划的一个特殊问题是，即使本地代理认为新问题与过去的问题相同，其他代理也可能有完全不同的目标。另一个问题是如何实现高效的分布式规划，比如在单代理情况下。本文表明，在初始状态只有“事实”的假设下，无论其他智能体的目标如何，过去的计划都可以被重用。生成的计划和相关信息存储为计划模板，以便代理可以在将来的计划中重用它。这些信息包括生成的计划、子目标、可能影响或被其他代理的计划影响的非局部效果，以及它们实际使用的冲突解决方法。代理可以使用模板高效地创建计划，因为它可以跳过计划操作的一部分，在早期阶段检测冲突，并减少通信成本。首先，本文提出了规划与重用框架。然后，还使用一些块世界示例说明了如何创建和重用平面模板。最后，通过实验证明了该方法可以实现高效的分布式规划。
This paper describes plan reuse in multiagent domains. In distributed planning, a plan is created by distributed centers of planner agents that have their own viewpoints. Plan reuse where a past plan result is reused for the new problem was proposed for single-agent planning and can achieve efficient planning. A special issue for applying it to distributed planning is that, even if the local agent thinks that the new problem is identical to a past problem, other agents may have quite different goals. Another issue is to realize efficient distributed planning, like in a single-agent case. This paper shows that the past plan can be reused regardless of other agents’ goals under the assumption that the initial state has only "infacts." A generated plan and related information are stored as a plan template so that an agent can reuse it in future planning. This information includes generated plans, subgoals, non-local effects that may affect or be affected by other agents’ plans, and their conflict resolution methods that were actually used. An agent can create a plan efficiently using a template, because it can skip a part of planning actions, detect conflicts in an early stage, and reduce communication costs. First, this paper presents the planning-with-reuse framework. Then how plan templates are created and reused is also illustrated using some block world examples. Finally, we experimentally show that efficient distributed planning can be achieved.