Constraint relaxation to reduce brittleness of distributed agent protocols

Hassan, M.F. and Robertson, D. (2004) Constraint relaxation to reduce brittleness of distributed agent protocols. In: ECAI Workshop on Coordination in Emergent Agent Societies, 2004, Valencia, Spain.

[img] PDF - Published Version
Restricted to Registered users only



Incompatible goals among multiple agents working on domains involving finite constraints can be a source of conflict. This conflict, in the form of incompatible constraints established locally by the agents and imposed on the negotiated variables, may break the dialogue between these agents even though they could, in principle, reach an agreement. A common means of coordinating multi-agent systems is by using protocols to which are attached constraints on interaction; but protocols are brittle, in the sense that the constraints they contain must either succeed or fail, and if they fail the entire protocol may fail. We apply a constraint relaxation technique originally for automated negotiation using a distributed protocol language called the Lightweight Coordination Calculus (LCC), in order to overcome a class of conflicts, making protocols less brittle. This approach is illustrated in a scenario involving the ordering and configuration of a computer between the customer and vendor agents.

Item Type:Conference or Workshop Item (Paper)
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:1920
Deposited By: Dr Mohd Fadzil Hassan
Deposited On:10 May 2010 10:42
Last Modified:19 Jan 2017 08:27

Repository Staff Only: item control page

Document Downloads

More statistics for this item...