%0 Journal Article
%@ 03029743
%A Hassan, M.F.
%A Robertson, D.
%C Hanoi
%D 2008
%F scholars:412
%J Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
%K Artificial intelligence; Computer operating procedures; Fracture mechanics; Intelligent agents; Multi agent systems; Specifications, Agent systems; Brittle agent interaction; Constraint relaxation for agent interaction; Constraint satisfaction problem (CSP); Distance functions; Distributed Partial CSP for computation of agent interaction, Agents
%P 214-221
%R 10.1007/978-3-540-89674-6₂₄
%T Addressing the brittleness of agent interaction
%U https://khub.utp.edu.my/scholars/412/
%V 5357 L
%X The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via a protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. However, the agents' failures to comply with the constraints imposed by the protocol may cause the agents to have brittle interactions. To address this problem, a constraint relaxation approach derived from the Distributed Partial Constraint Satisfaction Problem (CSP) is proposed. This paper describes the computational aspects of the approach (i.e. specification of a distance metric, searching for a solvable problem and specification of a global distance function). © 2008 Springer Berlin Heidelberg.
%Z cited By 1; Conference of 11th Pacific Rim International Conference on Multi-Agents, PRIMA 2008 ; Conference Date: 15 December 2008 Through 16 December 2008; Conference Code:75114