The Community for Technology Leaders
Autonomous Agents and Multiagent Systems, International Joint Conference on (2004)
New York City, New York, USA
July 19, 2004 to July 23, 2004
ISBN: 0-7695-2092-8
pp: 446-453
Roger Mailler , University of Massachusetts at Amherst
Victor Lesser , University of Massachusetts at Amherst
ABSTRACT
Distributive Constraint Satisfaction (DCSP) has long been considered an important area of research for multi-agent systems. This is partly due to the fact that many real-world problem can be represented as constraint satisfaction and partly because real-world problems often present themselves in a distributed form. In this paper, we present a complete, distributed algorithm called asynchronous partial overlay (APO) for solving DCSPs that is based on a cooperative mediation process. The primary ideas behind this algorithm are that agents, when acting as a mediator, centralize small, relevant portions of the DCSP, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO performs better than other known, complete DCSP techniques.
INDEX TERMS
null
CITATION

V. Lesser and R. Mailler, "Using Cooperative Mediation to Solve Distributed Constraint Satisfaction Problems," Autonomous Agents and Multiagent Systems, International Joint Conference on(AAMAS), New York City, New York, USA, 2004, pp. 446-453.
doi:10.1109/AAMAS.2004.10031
88 ms
(Ver 3.3 (11022016))