论文信息 - Coordinating Agent Plans Through Distributed Constraint Optimization

Coordinating Agent Plans Through Distributed Constraint Optimization

In this paper we show how the coordination of agent plans can be performed using Distributed Constraint Optimisation (DCOP) techniques. In particular, we show how a Truck Task Coordination problem can be modelled as a DCOP. We introduce a complete asynchronous DCOP algorithm, Asynchronous Open DPOP (ASODPOP), based on the DPOP algorithm that exhibits fast convergence to the optimal solution compared with both ADOPT and Distributed Stochastic Search (DSA). Fast convergence is useful when agents are time bounded and are thus unable to wait for an optimal solution.

Boi Faltings | Brammert Ottens

[1] Milind Tambe,et al. Preprocessing techniques for accelerating the DCOP algorithm ADOPT , 2005, AAMAS '05.

[2] Boi Faltings,et al. Asynchronous Open DPOP , 2008 .

[3] Makoto Yokoo,et al. Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[4] Boi Faltings,et al. ODPOP: An Algorithm for Open/Distributed Constraint Optimization , 2006, AAAI.

[5] Boi Faltings,et al. Open constraint programming , 2005, Artif. Intell..

[6] Amnon Meisels,et al. Comparing performance of distributed constraints process ing algorithms , 2002 .

[7] Boi Faltings,et al. Truck-task scheduling using DPOP , 2008 .

[8] Boi Faltings,et al. A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[9] Makoto Yokoo,et al. An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[10] Adrian Petcu. FRODO: A FRamework for Open/Distributed constraint Optimization , 2006 .

[11] Weixiong Zhang,et al. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..