Distributed Planning Through Graph Merging

Abstract : 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.
Type de document :
Communication dans un congrès
International Conference on Agents and Artificial Intelligence, Jan 2010, Valencia, Spain. 2010
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00981656
Contributeur : Damien Pellier <>
Soumis le : mardi 22 avril 2014 - 15:50:59
Dernière modification le : mercredi 29 novembre 2017 - 14:49:56
Document(s) archivé(s) le : lundi 10 avril 2017 - 16:36:44

Fichier

pellier10c.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00981656, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

284

Téléchargements de fichiers

124