W. Yeoh, P. Varakantham, X. Sun and S. Koenig. Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems. In IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT), pages 257-264, 2015.

Abstract: Distributed constraint optimization (DCOP) problems are well-suited for modeling multi-agent coordination problems. However, it only models static problems, which do not change over time. Consequently, researchers have introduced the Dynamic DCOP (DDCOP) model to model dynamic problems. In this paper, we make two key contributions: (a) a procedure to reason with the incremental changes in DDCOP problems and (b) an incremental pseudo-tree construction algorithm that can be used by DCOP algorithms such as any-space ADOPT and any-space BnB-ADOPT to solve DDCOP problems. Due to the incremental reasoning employed, our experimental results show that any-space ADOPT and any-space BnB-ADOPT are up to 42 percent and 38 percent faster, respectively, with the incremental procedure and the incremental pseudo-tree reconstruction algorithm than without them.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.