Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
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 pape...
Saved in:
Main Authors: | YEOH, William, Pradeep VARAKANTHAM, SUN, Xiaoxun, KOENIG, Sven |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3153 https://ink.library.smu.edu.sg/context/sis_research/article/4153/viewcontent/P_ID_52426_DDCOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2011) -
Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2013) -
Stochastic dominance in stochastic DCOPs for risk-sensitive applications
by: NGUYEN DUC THIEN,, et al.
Published: (2012) -
Caching Schemes for DCOP Search Algorithms
by: YEOH, William, et al.
Published: (2009) -
Attitudes Toward Adoption in Singapore
by: Mohanty, J.
Published: (2016)