Planification par fusions incr\'ementales de graphes

TL;DR

This paper presents a novel distributed planning model that integrates graph merging and CSP mechanisms to efficiently coordinate agents with positive and negative interactions towards shared goals.

Contribution

It introduces a unified, single-step distributed planning approach that considers agent interactions early to reduce search costs in multi-agent coordination.

Findings

Unified planning process via graph merging and CSP

Early consideration of agent interactions improves efficiency

Reduces search space for coordinated plans

Abstract

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.