H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP

• المؤلفون الرئيسيون: KUMAR, Akshat, PETCU, Adrian, FALTINGS, Boi
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2008
• الموضوعات: Artificial Intelligence and Robotics; Computer Sciences
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/2215; https://ink.library.smu.edu.sg/context/sis_research/article/3215/viewcontent/H_DPOP__Using_Hard_Constraints_for_Search_Space_Pruning_in_DCOP.pdf

In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential i...