A Graph-Based Multi-Agent Planning Algorithm with QoS Guarantees

Many existing planning approaches assume the existence of a centralized planner that has complete information of its planning problem. However, with the increasing popularity of distributed paradigm today, a planning problem may span across the boundaries of different organizations. Consequently, such a problem is difficult to be managed by any single organization. In this paper, we propose a new graph based approach for distributed planning without a centralized planner. Our approach employs distributed constraint satisfaction (DisCSP) and graph planning techniques. It encompasses both of functional and non-functional plannings.