{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:23:47Z","timestamp":1772119427301,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2018CDXYJSJ0026"],"award-info":[{"award-number":["2018CDXYJSJ0026"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10458-024-09643-y","type":"journal-article","created":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T05:13:14Z","timestamp":1711948394000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Toward fast belief propagation for distributed constraint optimization problems via heuristic search"],"prefix":"10.1007","volume":"38","author":[{"given":"Junsong","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingding","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,1]]},"reference":[{"key":"9643_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/18.825794","volume":"46","author":"S Aji","year":"2000","unstructured":"Aji, S., & McEliece, R. (2000). The generalized distributive law. IEEE Transactions on Information Theory, 46, 325\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"9643_CR2","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1093\/jigpal\/jzaa069","volume":"29","author":"J Cerquides","year":"2021","unstructured":"Cerquides, J., Rodr\u00edguez-Aguilar, J. A., Emonet, R., & Picard, G. (2021). Solving highly cyclic distributed optimization problems without busting the bank: A decimation-based approach. Logic Journal of the IGPL, 29(1), 72\u201395.","journal-title":"Logic Journal of the IGPL"},{"key":"9643_CR3","doi-asserted-by":"crossref","unstructured":"Chen, D., Deng, Y., Chen, Z., Zhang, W., & He, Z. (2020). Hs-cai: A hybrid dcop algorithm via combining search with context-based inference. In Proceedings of the 34th AAAI conference on artificial intelligence (pp. 7087\u20137094).","DOI":"10.1609\/aaai.v34i05.6195"},{"issue":"6","key":"9643_CR4","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s10458-018-9395-y","volume":"32","author":"Z Chen","year":"2018","unstructured":"Chen, Z., Deng, Y., Wu, T., & He, Z. (2018). A class of iterative refined max-sum algorithms via non-consecutive value propagation strategies. Autonomous Agents and Multi-Agent Systems, 32(6), 822\u2013860.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9643_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z., Jiang, X., Deng, Y., Chen, D., & He, Z. (2019). A generic approach to accelerating belief propagation based incomplete algorithms for dcops via a branch-and-bound technique. In Proceedings of the 33rd AAAI conference on artificial intelligence (pp. 6038\u20136045).","DOI":"10.1609\/aaai.v33i01.33016038"},{"key":"9643_CR6","unstructured":"Chen, Z., Zhang, W., Deng, Y., Chen, D., & Li, Q. (2020). Rmb-dpop: Refining mb-dpop by reducing redundant inference. In Proceedings of the 19th international conference on autonomous agents and multiagent Systems (pp. 249\u2013257)."},{"key":"9643_CR7","doi-asserted-by":"publisher","first-page":"103212","DOI":"10.1016\/j.artint.2019.103212","volume":"279","author":"L Cohen","year":"2020","unstructured":"Cohen, L., Galiki, R., & Zivan, R. (2020). Governing convergence of max-sum on dcops through damping and splitting. Artificial Intelligence, 279, 103212.","journal-title":"Artificial Intelligence"},{"key":"9643_CR8","doi-asserted-by":"crossref","unstructured":"Delle\u00a0Fave, F.M., Rogers, A., Xu, Z., Sukkarieh, S., & Jennings, N. R. (2012). Deploying the max-sum algorithm for decentralised coordination and task allocation of unmanned aerial vehicles for live aerial imagery collection. In Proceedings of the 2012 IEEE international conference on robotics and automation (pp. 469\u2013476).","DOI":"10.1109\/ICRA.2012.6225053"},{"issue":"2","key":"9643_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-021-09511-z","volume":"35","author":"Y Deng","year":"2021","unstructured":"Deng, Y., & An, B. (2021). Utility distribution matters: enabling fast belief propagation for multi-agent optimization with dense local utility function. Autonomous Agents and Multi-Agent Systems, 35(2), 1\u201340.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"3","key":"9643_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10458-013-9225-1","volume":"28","author":"A Farinelli","year":"2014","unstructured":"Farinelli, A., Rogers, A., & Jennings, N. R. (2014). Agent-based decentralised coordination for sensor networks using the max-sum algorithm. Autonomous Agents and Multi-Agent Systems, 28(3), 337\u2013380.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9643_CR11","unstructured":"Farinelli, A., Rogers, A., Petcu, A., & Jennings, N. R. (2008). Decentralised coordination of low-power embedded devices using the Max-sum algorithm. In Proceedings of the 7th international joint conference on autonomous agents and multiagent systems (pp. 639\u2013646)."},{"key":"9643_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1613\/jair.5565","volume":"61","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Pontelli, E., & Yeoh, W. (2018). Distributed constraint optimization problems and applications: A survey. Journal of Artificial Intelligence Research, 61, 623\u2013698.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9643_CR13","unstructured":"Fioretto, F., Yeoh, W., & Pontelli, E. (2017). A multiagent system approach to scheduling devices in smart homes. In Proceedings of the 16th international conference on autonomous agents and multiagent systems (pp. 981\u2013989)."},{"key":"9643_CR14","doi-asserted-by":"crossref","unstructured":"Hirayama, K., Miyake, K., Shiota, T., & Okimoto, T. (2019). DSSA+: Distributed collision avoidance algorithm in an environment where both course and speed changes are allowed. TransNav, International Journal on Marine Navigation and Safety of Sea Transportation, 13(1).","DOI":"10.12716\/1001.13.01.11"},{"key":"9643_CR15","doi-asserted-by":"crossref","unstructured":"Hirayama, K., & Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In Proceedings of the international conference on principles and practice of constraint programming (pp. 222\u2013236).","DOI":"10.1007\/BFb0017442"},{"issue":"1\u20132","key":"9643_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.08.004","volume":"161","author":"K Hirayama","year":"2005","unstructured":"Hirayama, K., & Yokoo, M. (2005). The distributed breakout algorithms. Artificial Intelligence, 161(1\u20132), 89\u2013115.","journal-title":"Artificial Intelligence"},{"key":"9643_CR17","unstructured":"Katagishi, H., & Pearce, J. P. (2007). Kopt: Distributed dcop algorithm for arbitrary k-optima with monotonically increasing utility. DCR-07."},{"key":"9643_CR18","unstructured":"Khan, M., Tran-Thanh, L., & Jennings, N. R. (2018). A generic domain pruning technique for gdl-based dcop algorithms in cooperative multi-agent systems. In Proceedings of the 17th international conference on autonomous agents and multiagent systems (pp. 1595\u20131603)."},{"key":"9643_CR19","unstructured":"Kiekintveld, C., Yin, Z., Kumar, A., & Tambe, M. (2010). Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In Proceedings of the 9th international conference on autonomous agents and multi-agent systems (pp. 133\u2013140)."},{"key":"9643_CR20","doi-asserted-by":"crossref","unstructured":"Kim, Y., Krainin, M., & Lesser, V. (2011). Effective variants of the max-sum algorithm for radar coordination and scheduling. In Proceedings of the 2011 IEEE\/WIC\/ACM international conferences on web intelligence and intelligent agent technology (pp. 357\u2013364).","DOI":"10.1109\/WI-IAT.2011.247"},{"key":"9643_CR21","unstructured":"Kim, Y., & Lesser, V. (2013). Improved max-sum algorithm for DCOP with n-ary constraints. In Proceedings of the 12th international conference on autonomous agents and multiagent systems (pp. 191\u2013198)."},{"key":"9643_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.artint.2017.07.003","volume":"252","author":"O Litov","year":"2017","unstructured":"Litov, O., & Meisels, A. (2017). Forward bounding on pseudo-trees for DCOPs and ADCOPs. Artificial Intelligence, 252, 83\u201399.","journal-title":"Artificial Intelligence"},{"key":"9643_CR23","doi-asserted-by":"crossref","unstructured":"Macarthur, K., Stranders, R., Ramchurn, S., & Jennings, N. (2011). A distributed anytime algorithm for dynamic task allocation in multi-agent systems. In Proceedings of 25th the AAAI conference on artificial intelligence (pp. 701\u2013706).","DOI":"10.1609\/aaai.v25i1.7866"},{"key":"9643_CR24","unstructured":"Maheswaran, R. T., Pearce, J. P., Tambe, M., et\u00a0al. (2004). Distributed algorithms for dcop: A graphical-game-based approach. In ISCA PDCS (pp. 432\u2013439). Citeseer."},{"issue":"1\u20132","key":"9643_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi, P. J., Shen, W. M., Tambe, M., & Yokoo, M. (2005). ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1\u20132), 149\u2013180.","journal-title":"Artificial Intelligence"},{"key":"9643_CR26","doi-asserted-by":"crossref","unstructured":"Monteiro, T. L., Pujolle, G., Pellenz, M. E., Penna, M. C., & Souza, R. D. (2012). A multi-agent approach to optimal channel assignment in wlans. In Proceedings of the 2012 IEEE wireless communications and networking conference (WCNC) (pp. 2637\u20132642).","DOI":"10.1109\/WCNC.2012.6214246"},{"key":"9643_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.artint.2012.09.002","volume":"193","author":"A Netzer","year":"2012","unstructured":"Netzer, A., Grubshtein, A., & Meisels, A. (2012). Concurrent forward bounding for distributed constraint optimization problems. Artificial Intelligence, 193, 186\u2013216.","journal-title":"Artificial Intelligence"},{"key":"9643_CR28","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1613\/jair.1.11400","volume":"64","author":"DT Nguyen","year":"2019","unstructured":"Nguyen, D. T., Yeoh, W., Lau, H. C., & Zivan, R. (2019). Distributed Gibbs: A linear-space sampling-based DCOP algorithm. Journal of Artificial Intelligence Research, 64, 705\u2013748.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9643_CR29","doi-asserted-by":"crossref","unstructured":"Okimoto, T., Joe, Y., Iwasaki, A., Yokoo, M., & Faltings, B. (2011). Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds. In Proceedings of the 17th international conference on principles and practice of constraint programming (pp. 660\u2013674). Springer.","DOI":"10.1007\/978-3-642-23786-7_50"},{"issue":"5","key":"9643_CR30","first-page":"69","volume":"8","author":"B Ottens","year":"2017","unstructured":"Ottens, B., Dimitrakakis, C., & Faltings, B. (2017). DUCT: An upper confidence bound approach to distributed constraint optimization problems. ACM Transactions on Intelligent Systems and Technology (TIST), 8(5), 69.","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"9643_CR31","unstructured":"Pearce, J. P., & Tambe., M. (2007). Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In Proceedings of the 20th international joint conference on artifical intelligence (pp. 1446\u20131451)."},{"key":"9643_CR32","unstructured":"Pepyne, D., Westbrook, D., Philips, B., Lyons, E., Zink, M., & Kurose, J. (2007). A design for distributed collaborative adaptive sensing of the atmosphere. Tech. rep., Technical Report CMPSCI-2007-018, University of Massachusetts."},{"key":"9643_CR33","doi-asserted-by":"crossref","unstructured":"Petcu, A., & Faltings, B. (2005). Approximations in distributed optimization. In Proceedings of the 11st international conference on principles and practice of constraint programming (pp. 802\u2013806). Springer.","DOI":"10.1007\/11564751_68"},{"key":"9643_CR34","unstructured":"Petcu, A., & Faltings, B. (2005). Dpop: A scalable method for multiagent constraint optimization. In Proceedings of the 19th international joint conference on artifical intelligence (pp. 266\u2013271)."},{"key":"9643_CR35","unstructured":"Petcu, A., & Faltings, B. (2006). ODPOP: An algorithm for open\/distributed constraint optimization. In Proceedings of the 21st AAAI conference on artificial intelligence (pp. 703\u2013708)."},{"key":"9643_CR36","unstructured":"Petcu, A., & Faltings, B. (2007). Mb-dpop: A new memory-bounded algorithm for distributed optimization. In Proceedings of the 20th international joint conference on artificial intelligence (pp. 1452\u20131457)."},{"issue":"9","key":"9643_CR37","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1093\/comjnl\/bxq022","volume":"53","author":"SD Ramchurn","year":"2010","unstructured":"Ramchurn, S. D., Farinelli, A., Macarthur, K. S., & Jennings, N. R. (2010). Decentralized coordination in robocup rescue. The Computer Journal, 53(9), 1447\u20131461.","journal-title":"The Computer Journal"},{"issue":"02","key":"9643_CR38","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/MIS.2009.22","volume":"24","author":"A Rogers","year":"2009","unstructured":"Rogers, A., Corkill, D. D., & Jennings, N. R. (2009). Agent technologies for sensor networks. IEEE Intelligent Systems, 24(02), 13\u201317.","journal-title":"IEEE Intelligent Systems"},{"issue":"2","key":"9643_CR39","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.artint.2010.11.001","volume":"175","author":"A Rogers","year":"2011","unstructured":"Rogers, A., Farinelli, A., Stranders, R., & Jennings, N. R. (2011). Bounded approximate decentralised coordination via the Max-sum algorithm. Artificial Intelligence, 175(2), 730\u2013759.","journal-title":"Artificial Intelligence"},{"key":"9643_CR40","doi-asserted-by":"crossref","unstructured":"Rollon, E., & Larrosa, J. (2012). Improved bounded max-sum for distributed constraint optimization. In Proceedings of the international conference on principles and practice of constraint programming (pp. 624\u2013632). Springer.","DOI":"10.1007\/978-3-642-33558-7_45"},{"key":"9643_CR41","doi-asserted-by":"crossref","unstructured":"Rollon, E., & Larrosa, J. (2014). Decomposing utility functions in bounded max-sum for distributed constraint optimization. In Proceedings of the International conference on principles and practice of constraint programming (pp. 646\u2013654). Springer.","DOI":"10.1007\/978-3-319-10428-7_47"},{"key":"9643_CR42","unstructured":"Stranders, R., Farinelli, A., Rogers, A., & Jennings, N. (2009). Decentralised coordination of mobile sensors using the max-sum algorithm. In Proceedings of the 21st international joint conference on artificial intelligence (pp. 299\u2013304)."},{"key":"9643_CR43","unstructured":"Sultanik, E. A., Lass, R. N., & Regli, W. C. (2008). Dcopolis: A framework for simulating and deploying distributed constraint reasoning algorithms. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (pp. 1667\u20131668)."},{"key":"9643_CR44","unstructured":"Sultanik, E. A., Modi, P. J., & Regli, W. C. (2007). On modeling multiagent task scheduling as a distributed constraint optimization problem. In Proceedings of the 20th international joint conference on artificial intelligence (pp. 1531\u20131536)."},{"key":"9643_CR45","unstructured":"Vinyals, M., Rodr\u00edguez-Aguilar, J., & Cerquides, J. (2009). Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs. In Proceedings of The 8th international conference on autonomous agents and multiagent systems (pp. 1239\u20131240)."},{"issue":"2","key":"9643_CR46","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y Weiss","year":"2001","unstructured":"Weiss, Y., & Freeman, W. T. (2001). On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory, 47(2), 736\u2013736.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"236\u2013239","key":"9643_CR47","first-page":"0018","volume":"8","author":"JS Yedidia","year":"2003","unstructured":"Yedidia, J. S., Freeman, W. T., Weiss, Y., et al. (2003). Understanding belief propagation and its generalizations. Exploring Artificial Intelligence in the New Millennium, 8(236\u2013239), 0018\u20139448.","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"9643_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1613\/jair.2849","volume":"38","author":"W Yeoh","year":"2010","unstructured":"Yeoh, W., Felner, A., & Koenig, S. (2010). Bnb-adopt: An asynchronous branch-and-bound dcop algorithm. Journal of Artificial Intelligence Research, 38, 85\u2013133.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"9643_CR49","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v33i3.2429","volume":"33","author":"W Yeoh","year":"2012","unstructured":"Yeoh, W., & Yokoo, M. (2012). Distributed problem solving. AI Magazine, 33(3), 53.","journal-title":"AI Magazine"},{"key":"9643_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.002","volume":"212","author":"R Zivan","year":"2014","unstructured":"Zivan, R., Okamoto, S., & Peled, H. (2014). Explorative anytime local search for distributed constraint optimization. Artificial Intelligence, 212, 1\u201326.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"9643_CR51","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1007\/s10458-017-9360-1","volume":"31","author":"R Zivan","year":"2017","unstructured":"Zivan, R., Parash, T., Cohen, L., Peled, H., & Okamoto, S. (2017). Balancing exploration and exploitation in incomplete Min\/Max-sum inference for distributed constraint optimization. Autonomous Agents and Multi-Agent Systems, 31(5), 1165\u20131207.","journal-title":"Autonomous Agents and Multi-Agent Systems"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09643-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-024-09643-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09643-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T19:05:42Z","timestamp":1719860742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-024-09643-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9643"],"URL":"https:\/\/doi.org\/10.1007\/s10458-024-09643-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1983087\/v1","asserted-by":"object"}]},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,1]]},"assertion":[{"value":"5 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"15"}}