Document Open Access Logo

A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems

Authors Xiangshuang Liu, Ziyu Chen, Dingding Chen, Junsong Gao

PDF
Thumbnail PDF

File

LIPIcs.CP.2021.41.pdf
  • Filesize: 2.33 MB
  • 17 pages

Document Identifiers

Author Details

Xiangshuang Liu
  • College of Computer Science, Chongqing University, China
Ziyu Chen
  • College of Computer Science, Chongqing University, China
Dingding Chen
  • College of Computer Science, Chongqing University, China
Junsong Gao
  • College of Computer Science, Chongqing University, China

Acknowledgements

We would like to thank the reviewers for their valuable comments, and Dr. Ferdinando Fioretto and Dr. Yanchen Deng for their helpful suggestions.

Cite As Get BibTex

Xiangshuang Liu, Ziyu Chen, Dingding Chen, and Junsong Gao. A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 41:1-41:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.CP.2021.41

Abstract

Complete search algorithms are important methods for solving Distributed Constraint Optimization Problems (DCOPs), which generally utilize bounds to prune the search space. However, obtaining high-quality lower bounds is quite expensive since it requires each agent to collect more information aside from its local knowledge, which would cause tremendous traffic overheads. Instead of bothering for bounds, we propose a Bound-Independent Pruning (BIP) technique for existing tree-based complete search algorithms, which can independently reduce the search space only by exploiting local knowledge. Specifically, BIP enables each agent to determine a subspace containing the optimal solution only from its local constraints along with running contexts, which can be further exploited by any search strategies. Furthermore, we present an acceptability testing mechanism to tailor existing tree-based complete search algorithms to search the remaining space returned by BIP when they hold inconsistent contexts. Finally, we prove the correctness of our technique and the experimental results show that BIP can significantly speed up state-of-the-art tree-based complete search algorithms on various standard benchmarks.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Cooperation and coordination
Keywords
  • DCOP
  • complete algorithms
  • search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. James Atlas, Matt Warner, and Keith Decker. A memory bounded hybrid approach to distributed constraint optimization. In Proceedings 10th International Workshop on DCR, pages 37-51, 2008. Google Scholar
  2. Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999. URL: https://doi.org/10.1126/science.286.5439.509.
  3. Ismel Brito and Pedro Meseguer. Improving DPOP with function filtering. In Proceedings of the 9th AAMAS, pages 141-148, 2010. Google Scholar
  4. Dingding Chen, Yanchen Deng, Ziyu Chen, Wenxin Zhang, and Zhongshi He. HS-CAI: A hybrid dcop algorithm via combining search with context-based inference. In Proceedings of the 34th AAAI, pages 7087-7094, 2020. Google Scholar
  5. Ziyu Chen, Wenxin Zhang, Yanchen Deng, Dingding Chen, and Qiang Li. RMB-DPOP: Refining MB-DPOP by reducing redundant inference. In Proceedings of the 19th AAMAS, pages 249-257, 2020. Google Scholar
  6. Martin C Cooper, Simon De Givry, Martı Sánchez, Thomas Schiex, Matthias Zytnicki, and Tomas Werner. Soft arc consistency revisited. Artificial Intelligence, 174(7-8):449-478, 2010. URL: https://doi.org/10.1016/j.artint.2010.02.001.
  7. Yanchen Deng, Ziyu Chen, Dingding Chen, Xingqiong Jiang, and Qiang Li. PT-ISABB: A hybrid tree-based complete algorithm to solve asymmetric distributed constraint optimization problems. In Proceedings of the 18th AAMAS, pages 1506-1514, 2019. Google Scholar
  8. Alessandro Farinelli, Alex Rogers, and Nick R Jennings. Agent-based decentralised coordination for sensor networks using the max-sum algorithm. Autonomous agents and multi-agent systems, 28(3):337-380, 2014. URL: https://doi.org/10.1007/s10458-013-9225-1.
  9. Alessandro Farinelli, Alex Rogers, Adrian Petcu, and Nicholas R Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In Proceedings of the 7th AAMAS, volume 2, pages 639-646, 2008. Google Scholar
  10. Ferdinando Fioretto, Enrico Pontelli, and William Yeoh. Distributed constraint optimization problems and applications: A survey. Journal of Artificial Intelligence Research, 61:623-698, 2018. URL: https://doi.org/10.1613/jair.5565.
  11. Ferdinando Fioretto, William Yeoh, Enrico Pontelli, Ye Ma, and Satishkumar J Ranade. A distributed constraint optimization (DCOP) approach to the economic dispatch with demand response. In Proceedings of the 16th AAMAS, pages 999-1007, 2017. Google Scholar
  12. Patricia Gutierrez and Pedro Meseguer. BnB-ADOPT+ with several soft arc consistency levels. In Proceedings of the 19th ECAI, pages 67-72, 2010. Google Scholar
  13. Patricia Gutierrez and Pedro Meseguer. Saving redundant messages in BnB-ADOPT. In Proceedings of the 24th AAAI, pages 1259-1260, 2010. Google Scholar
  14. Katsutoshi Hirayama and Makoto Yokoo. Distributed partial constraint satisfaction problem. In International Conference on Principles and Practice of Constraint Programming, pages 222-236, 1997. URL: https://doi.org/10.1007/BFb0017442.
  15. Yoonheui Kim and Victor Lesser. DJAO: A communication-constrained DCOP algorithm that combines features of ADOPT and Action-GDL. In Proceedings of the 28th AAAI, pages 2680-2687, 2014. Google Scholar
  16. Omer Litov and Amnon Meisels. Forward bounding on pseudo-trees for DCOPs and ADCOPs. Artificial Intelligence, 252:83-99, 2017. URL: https://doi.org/10.1016/j.artint.2017.07.003.
  17. Rajiv T Maheswaran, Jonathan P Pearce, and Milind Tambe. A family of graphical-game-based algorithms for distributed constraint optimization problems. In Coordination of large-scale multiagent systems, pages 127-146. Springer, 2006. URL: https://doi.org/10.1007/0-387-27972-5_6.
  18. Rajiv T Maheswaran, Milind Tambe, Emma Bowring, Jonathan P Pearce, and Pradeep Varakantham. Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In Proceedings of the 3rd AAMAS, volume 1, pages 310-317, 2004. Google Scholar
  19. Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149-180, 2005. URL: https://doi.org/10.1016/j.artint.2004.09.003.
  20. Arnon Netzer, Alon Grubshtein, and Amnon Meisels. Concurrent forward bounding for distributed constraint optimization problems. Artificial Intelligence, 193:186-216, 2012. URL: https://doi.org/10.1016/j.artint.2012.09.002.
  21. Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, and Roie Zivan. Distributed Gibbs: A linear-space sampling-based dcop algorithm. Journal of Artificial Intelligence Research, 64:705-748, 2019. URL: https://doi.org/10.1613/jair.1.11400.
  22. Brammert Ottens, Christos Dimitrakakis, and Boi Faltings. DUCT: An upper confidence bound approach to distributed constraint optimization problems. ACM Transactions on Intelligent Systems and Technologyc, 8(5):69, 2017. URL: https://doi.org/10.1145/3066156.
  23. Adrian Petcu and Boi Faltings. Approximations in distributed optimization. In International Conference on Principles and Practice of Constraint Programming, pages 802-806, 2005. URL: https://doi.org/10.1007/11564751_68.
  24. Adrian Petcu and Boi Faltings. ODPOP: An algorithm for open/distributed constraint optimization. In Proceedings of the 21th AAAI, pages 703-708, 2006. Google Scholar
  25. Adrian Petcu and Boi Faltings. MB-DPOP: A new memory-bounded algorithm for distributed optimization. In Proceedings of the 20th IJCAI, pages 1452-1457, 2007. Google Scholar
  26. Evan A Sultanik, Pragnesh Jay Modi, and William C Regli. On modeling multiagent task scheduling as a distributed constraint optimization problem. In Proceedings of the 20th IJCAI, pages 1531-1536, 2007. Google Scholar
  27. Meritxell Vinyals, Juan A Rodriguez-Aguilar, and Jesús Cerquides. Generalizing DPOP: DPOP, a new complete algorithm for DCOPs. In Proceedings of the 8th AAMAS, pages 1239-1240, 2009. Google Scholar
  28. Weixiong Zhang, Guandong Wang, Zhao Xing, and Lars Wittenburg. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1-2):55-87, 2005. URL: https://doi.org/10.1016/j.artint.2004.10.004.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact