Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP t...
Saved in:
Main Authors: | YEOH, William, VARAKANTHAM, Pradeep, SUN, Xiaoxun, KOENIG, Sven |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1343 https://ink.library.smu.edu.sg/context/sis_research/article/2342/viewcontent/DDCOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Caching Schemes for DCOP Search Algorithms
by: YEOH, William, et al.
Published: (2009) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2015) -
Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs
by: GHOSH, Supriyo, et al.
Published: (2015) -
Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2013) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
by: NGUYEN, Duc Thien, et al.
Published: (2014)