Author:
Damien Pellier
Affiliation:
Université Paris Descartes University, Laboratoire d’Informatique Paris Descartes, France
Keyword(s):
Distributed problem solving, Cooperation, Coordination, Multi-agent planning, Planning graphs technics.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Cooperation and Coordination
;
Distributed and Mobile Software Systems
;
Distributed Problem Solving
;
Enterprise Information Systems
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Planning and Scheduling
;
Simulation and Modeling
;
Software Engineering
;
Symbolic Systems
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.