Addressing the Brittleness of Agent Interaction
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).
KeywordsBrittle agent interaction constraint relaxation for agent interaction Distributed Partial CSP for computation of agent interaction
Unable to display preview. Download preview PDF.
- 3.Modi, P.J., Veloso, M.: Bumping strategies for the multiagent agreement problem. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), Utrecht, The Netherlands (2005)Google Scholar
- 4.Sycara, K.P.: Multiagent systems. AI Magazine 19, 79–92 (1998)Google Scholar
- 5.Macho-Gonzales, S., Torrens, M., Faltings, B.: A multi-agent recommender system for planning meetings. In: Proceedings of the Workshop on Agent-based Recommender Systems (WARS 2000), Barcelona, Spain (2000)Google Scholar
- 8.Bistarelli, S., Freuder, E.C., O’Sullivan, B.: Encoding partial constraint satisfaction in the semiring-based framework for soft constraints. In: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), Boca Raton, FL, USA (2004)Google Scholar
- 10.SICS, SICStus Prolog User’s Manual. Stockholm: Swedish Institute of Computer Science (SICS) (1999), http://www.sics.se/sicstus.html