Communications of the ACM
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
A Multi-agent System for Organ Transplant Co-ordination
AIME '01 Proceedings of the 8th Conference on AI in Medicine in Europe: Artificial Intelligence Medicine
Encoding Partial Constraint Satisfaction in the Semiring-Based Framework for Soft Constraints
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Bumping strategies for the multiagent agreement problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Objective versus subjective coordination in the engineering of agent systems
Intelligent information agents
| Hi-index | 0.00 |
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).