Abstract
In this paper, we show that collaborative services can be formulated into distributed constraint satisfaction problems. We introduce the notion of multi-agent collaborative service (MACS), and employ a distributed discrete Lagrange multipliers (DDLM) method to automatically handle an MACS task. The DDLM method is based on a distributed multi-agent system. The behaviors of agents are guided by predefined DDLM rules. In order to make it more efficient in achieving a solution state, we incorporate strategies for tuning the Lagrange multipliers. We validate the effectiveness of the DDLM method with benchmark SAT problems. Furthermore, we provide the mathematical properties of DDLM and present the corresponding DDLM algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
