Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Damien Pellier Connect in order to contact the contributor
Submitted on : Tuesday, April 22, 2014 - 3:50:59 PM
Last modification on : Friday, January 21, 2022 - 3:29:16 AM
Long-term archiving on: : Monday, April 10, 2017 - 4:36:44 PM


Files produced by the author(s)


  • HAL Id : hal-00981656, version 1


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



Record views


Files downloads