Complete Distributed Search Algorithm for Cyclic Factor Graphs
Toshihiro Matsui, Hiroshi Matsuo
2014
Abstract
Distributed Constraint Optimization Problems (DCOPs) have been studied as fundamental problems in multiagent systems. The Max-Sum algorithm has been proposed as a solution method for DCOPs. The algorithm is based on factor graphs that consist of two types of nodes for variables and functions. While the Max-Sum is an exact method for acyclic factor-graphs, in the case that the factor graph contains cycles, it is an inexact method that may not converge. In this study, we propose a method that decomposes the cycles based on crossedged pseudo-trees on factor-graphs. We also present a basic scheme of distributed search algorithms that generalizes complete search algorithms on the constraint graphs and Max-Sum algorithm.
References
- Atlas, J. and Decker, K. (2007). A complete distributed constraint optimization method for non-traditional pseudotree arrangements. In AAMAS07, pages 111:1- 111:8.
- Farinelli, A., Rogers, A., Petcu, A., and Jennings, N. R. (2008). Decentralised coordination of low-power embedded devices using the max-sum algorithm. In AAMAS08, pages 639-646.
- Maheswaran, R. T., Tambe, M., Bowring, E., Pearce, J. P., and Varakantham, P. (2004). Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. In AAMAS04, pages 310- 317.
- Mailler, R. and Lesser, V. (2004). Solving distributed constraint optimization problems using cooperative mediation. In AAMAS04, pages 438-445.
- Miller, S., Ramchurn, S. D., and Rogers, A. (2012). Optimal decentralised dispatch of embedded generation in the smart grid. In AAMAS12, volume 1, pages 281- 288.
- Modi, P. J., Shen, W., Tambe, M., and Yokoo, M. (2005). Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149-180.
- Petcu, A. and Faltings, B. (2005a). A-DPOP: Approximations in distributed optimization. In CP05 - workshop on Distributed and Speculative Constraint Processing, DSCP.
- Petcu, A. and Faltings, B. (2005b). A scalable method for multiagent constraint optimization. In IJCAI05, pages 266-271.
- Rogers, A., Farinelli, A., Stranders, R., and Jennings, N. R. (2011). Bounded approximate decentralised coordination via the Max-Sum algorithm. Artificial Intelligence, 175(2):730-759.
- Vinyals, M., Rodriguez-Aguilar, J. A., and Cerquides, J. (2011). Constructing a unifying theory of dynamic programming dcop algorithms via the generalized distributive law. Autonomous Agents and Multi-Agent Systems, 22(3):439-464.
- Yeoh, W., Felner, A., and Koenig, S. (2008). BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. In AAMAS08, pages 591-598.
- Zhang, W., Wang, G., Xing, Z., and Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1-2):55-87.
- Zivan, R. and Peled, H. (2012). Max/min-sum distributed constraint optimization through value propagation on an alternating DAG. In AAMAS12, volume 1, pages 265-272.
Paper Citation
in Harvard Style
Matsui T. and Matsuo H. (2014). Complete Distributed Search Algorithm for Cyclic Factor Graphs . In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-016-1, pages 184-192. DOI: 10.5220/0004824301840192
in Bibtex Style
@conference{icaart14,
author={Toshihiro Matsui and Hiroshi Matsuo},
title={Complete Distributed Search Algorithm for Cyclic Factor Graphs},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2014},
pages={184-192},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004824301840192},
isbn={978-989-758-016-1},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Complete Distributed Search Algorithm for Cyclic Factor Graphs
SN - 978-989-758-016-1
AU - Matsui T.
AU - Matsuo H.
PY - 2014
SP - 184
EP - 192
DO - 10.5220/0004824301840192