Distributed Planning Through Graph Merging - Laboratoire d'Informatique PAris DEscartes - EA 2517 Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Distributed Planning Through Graph Merging

Damien Pellier

Résumé

In this paper, we introduce a generic and fresh model for distributed planning called "Distributed Planning Through Graph Merging'' (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, 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, 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.
Fichier principal
Vignette du fichier
pellier10c.pdf (179.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00981656 , version 1 (22-04-2014)

Identifiants

  • HAL Id : hal-00981656 , version 1

Citer

Damien Pellier. Distributed Planning Through Graph Merging. International Conference on Agents and Artificial Intelligence, Jan 2010, Valencia, Spain. ⟨hal-00981656⟩

Collections

LIPADE UP-SCIENCES
141 Consultations
198 Téléchargements

Partager

Gmail Facebook X LinkedIn More