论文信息 - Asynchronous Breadth-First Search DCOP Algorithm

Asynchronous Breadth-First Search DCOP Algorithm

In MultiAgent systems, Distributed Constraint Optimization Problem (DCOP) has been used as a formalism to model a wide range of agents coordination issues. The Asynchronous forward-bounding with backjumping (AFB-BJ) algorithm was recently proposed as a new way to solve DCOP. The AFB-BJ shows better performance in comparison

Christian Bessiere | Imade Benelallam | Mohammed | Redouane Ezzahir

[1] Amnon Meisels. Asynchronous Forward-Bounding , 2008 .

[2] Amnon Meisels,et al. Concurrent Backtrack Search on DisCSPs , 2004, FLAIRS Conference.

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

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

[5] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.

[6] Eugene C. Freuder. A sufficient condition for backtrack-bounded search , 1985, JACM.

[7] Makoto Yokoo,et al. Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[8] Boi Faltings,et al. H-DPOP: Using Hard Constraints to Prune the Search Space , 2007, IJCAI 2007.

[9] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[10] Makoto Yokoo,et al. Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[11] Milind Tambe,et al. Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[12] Sven Koenig,et al. IDB-ADOPT: A Depth-First Search DCOP Algorithm , 2009, CSCLP.