Utility distribution matters: enabling fast belief propagation for multi-agent optimization with dense local utility function
暂无分享,去创建一个
Bo An | Yanchen Deng | Bo An | Yanchen Deng
[1] Katsutoshi Hirayama,et al. DSSA+: Distributed Collision Avoidance Algorithm in an Environment where Both Course and Speed Changes are Allowed , 2019, TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation.
[2] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[3] Nicholas R. Jennings,et al. Decentralised coordination of low-power embedded devices using the max-sum algorithm , 2008, AAMAS.
[4] Makoto Yokoo,et al. Distributed Partial Constraint Satisfaction Problem , 1997, CP.
[5] J. Brotzge,et al. Collaborative Adaptive Sensing of the Atmosphere , 2006 .
[6] Javier Larrosa,et al. Decomposing Utility Functions in Bounded Max-sum for Distributed Constraint Optimization , 2013, 2013 Fourth Global Congress on Intelligent Systems.
[7] Victor R. Lesser,et al. Improved max-sum algorithm for DCOP with n-ary constraints , 2013, AAMAS.
[8] Boi Faltings,et al. DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems , 2012, AAAI.
[9] Milind Tambe,et al. Engineering the Decentralized Coordination of UAVs with Limited Communication Range , 2013, CAEPIA.
[10] Jonathan P. Pearce,et al. KOPT : Distributed DCOP Algorithm for Arbitrary k-optima with Monotonically Increasing Utility , 2007 .
[11] Nicholas R. Jennings,et al. Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm , 2009, IJCAI.
[12] Victor R. Lesser,et al. DJAO: A Communication-Constrained DCOP Algorithm that Combines Features of ADOPT and Action-GDL , 2014, AAAI.
[13] Amnon Meisels,et al. Concurrent forward bounding for distributed constraint optimization problems , 2012, Artif. Intell..
[14] Robert N. Lass,et al. DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms , 2008, AAMAS.
[15] N. Komodakis,et al. Beyond pairwise energies: Efficient optimization for higher-order MRFs , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[16] Ziyu Chen,et al. HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-based Inference , 2019, AAAI.
[17] Nicholas R. Jennings,et al. Bounded approximate decentralised coordination via the max-sum algorithm , 2009, Artif. Intell..
[18] Javier Larrosa,et al. Improved Bounded Max-Sum for Distributed Constraint Optimization , 2012, CP.
[19] Boi Faltings,et al. A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.
[20] Enrico Pontelli,et al. A Distributed Constraint Optimization (DCOP) Approach to the Economic Dispatch with Demand Response , 2017, AAMAS.
[21] Steven Okamoto,et al. Balancing exploration and exploitation in incomplete Min/Max-sum inference for distributed constraint optimization , 2017, Autonomous Agents and Multi-Agent Systems.
[22] Hoong Chuin Lau,et al. Distributed Gibbs: A Linear-Space Sampling-Based DCOP Algorithm , 2019, J. Artif. Intell. Res..
[23] Victor R. Lesser,et al. Effective Variants of the Max-Sum Algorithm for Radar Coordination and Scheduling , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.
[24] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .
[25] J. E. Hirsch,et al. An index to quantify an individual's scientific research output , 2005, Proc. Natl. Acad. Sci. USA.
[26] Rina Dechter,et al. AND/OR search spaces for graphical models , 2007, Artif. Intell..
[27] Meritxell Vinyals,et al. Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs , 2009, AAMAS.
[28] K. Decker,et al. A Memory Bounded Hybrid Approach to Distributed Constraint Optimization , 2008 .
[29] Amnon Meisels,et al. Asynchronous Forward Bounding for Distributed COPs , 2014, J. Artif. Intell. Res..
[30] Sven Koenig,et al. BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm , 2008, AAMAS.
[31] MarinescuRadu,et al. AND/OR Branch-and-Bound search for combinatorial optimization in graphical models , 2009 .
[32] Boi Faltings,et al. MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization , 2007, IJCAI.
[33] Nicholas R. Jennings,et al. A Generic Domain Pruning Technique for GDL-Based DCOP Algorithms in Cooperative Multi-Agent Systems , 2018, AAMAS.
[34] Steven Okamoto,et al. Distributed Breakout: Beyond Satisfaction , 2016, IJCAI.
[35] Amnon Meisels,et al. Forward bounding on pseudo-trees for DCOPs and ADCOPs , 2017, Artif. Intell..
[36] Michael J. Quinn,et al. Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.
[37] Steven Okamoto,et al. Explorative anytime local search for distributed constraint optimization , 2014, Artif. Intell..
[38] Robert J. McEliece,et al. The generalized distributive law , 2000, IEEE Trans. Inf. Theory.
[39] Milind Tambe,et al. Distributed Algorithms for DCOP: A Graphical-Game-Based Approach , 2004, PDCS.
[40] Weixiong Zhang,et al. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..
[41] Richard Demo Souza,et al. A multi-agent approach to optimal channel assignment in WLANs , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).
[42] William T. Freeman,et al. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.
[43] Omer Lev,et al. Beyond Trees: Analysis and Convergence of Belief Propagation in Graphs with Multiple Cycles , 2020, AAAI.
[44] Makoto Yokoo,et al. Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..
[45] Richard S. Zemel,et al. HOP-MAP: Efficient Message Passing with High Order Potentials , 2010, AISTATS.
[46] Makoto Yokoo,et al. The distributed breakout algorithms , 2005, Artif. Intell..
[47] Shijie Li,et al. Distributed constraint optimization for addressing vessel rotation planning problems , 2016, Eng. Appl. Artif. Intell..
[48] Ziyu Chen,et al. A class of iterative refined Max-sum algorithms via non-consecutive value propagation strategies , 2018, Autonomous Agents and Multi-Agent Systems.
[49] Brendan J. Frey,et al. A Binary Variable Model for Affinity Propagation , 2009, Neural Computation.
[50] Milind Tambe,et al. Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems , 2007, IJCAI.
[51] Yanchen Deng,et al. Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities , 2020, IJCAI.
[52] Rina Dechter,et al. AND/OR Branch-and-Bound search for combinatorial optimization in graphical models , 2009, Artif. Intell..
[53] Qing Li,et al. RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences , 2020, AAMAS.
[54] Ziyu Chen,et al. A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique , 2019, AAAI.
[55] Enrico Pontelli,et al. A Large Neighboring Search Schema for Multi-agent Optimization , 2018, CP.
[56] Roie Zivan,et al. Governing convergence of Max-sum on DCOPs through damping and splitting , 2020, Artif. Intell..
[57] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..