arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.08460cs.AI
收藏

图的递增融合的平面化

Planification par fusions incrémentales de graphes

Université Paris Descartes(巴黎笛卡尔大学);Centre de Recherche en Informatique(计算机研究中心)

Damien Pellier, lias. Belaidi

摘要:

在本文中,我们介绍了一个通用的和新鲜的模型,分布式规划称为“分布式规划通过图合并”({ \sf DPGM})。该模型将分布式规划过程的不同步骤统一为单步的。我们的方法是基于规划图结构的代理推理和CSP机制的个人计划提取和协调。我们假设没有一个智能体可以单独达到全局目标。因此,代理必须合作,{ \it即,}同时考虑到它们为实现共同目标而开展活动之间可能的积极互动。我们的模型的独创性在于尽可能快地考虑{ \it即,}在个体规划过程中,Agent活动之间的正、负交互作用,以降低全局协调解规划的搜索成本。

英文摘要:

In this paper, we introduce a generic and fresh model for distributed planning called "Distributed Planning Through Graph Merging" ({\sf DPGM}). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume that no agent can reach the global goal alone. Therefore the agents must cooperate, {\it i.e.,} take in into account potential positive interactions between their activities to reach their common shared goal. The originality of our model consists in considering as soon as possible, {\it i.e.,} in the individual planning process, the positive and the negative interactions between agents activities in order to reduce the search cost of a global coordinated solution plan.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑