eprintid: 414
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/04/14
datestamp: 2023-11-09 15:16:03
lastmod: 2023-11-09 15:16:03
status_changed: 2023-11-09 15:14:30
type: article
metadata_visibility: show
creators_name: Hassan, M.F.
creators_name: Robertson, D.
title: Constraint relaxation approach for over-constrained agent interaction
ispublished: pub
keywords: Artificial intelligence; Bionics; Computer operating procedures; Flow interactions; Message passing; Steelmaking; Theorem proving, Brittle agent protocol; Constrained states; Constraint relaxations; Constraint satisfaction problems; Constraint satisfactions; Constraint solving systems; Distributed Partial CSP and agent protocol; Distributed protocols; Individual agents; Interacting agents; Interaction mechanisms; Multi-agent systems; Over-constrained agent interaction; Protocol levels; Research works; Social norms, Agents
note: cited By 2; Conference of 10th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2008 ; Conference Date: 15 December 2008 Through 19 December 2008; Conference Code:75109
abstract: The interactions among agents in a multi-agent system for coordinating a distributed, problem solving task can be complex, as the distinct sub-problems of the individual agents are interdependent. A distributed protocol provides the necessary framework for specifying these interactions. In a model of interactions where the agents' social norms are expressed as the message passing behaviours associated with roles, the dependencies among agents can be specified as constraints. The constraints are associated with roles to be adopted by agents as dictated by the protocol. These constraints are commonly handled using a conventional constraint solving system that only allows two satisfactory states to be achieved - completely satisfied or failed. Agent interactions then become brittle as the occurrence of an over-constrained state can cause the interaction between agents to break prematurely, even though the interacting agents could, in principle, reach an agreement. Assuming that the agents are capable of relaxing their individual constraints to reach a common goal, the main issue addressed by this research work is how the agents could communicate and coordinate the constraint relaxation process. The interaction mechanism for this is obtained by reinterpreting a technique borrowed from the constraint satisfaction field (i.e. distributed partial Constraint Satisfaction Problem), deployed and computed at the protocol level. © 2008 Springer Berlin Heidelberg.
date: 2008
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-58349084561&doi=10.1007%2f978-3-540-89197-0_61&partnerID=40&md5=5a751cd896a2c5d123a356939b3bfad6
id_number: 10.1007/978-3-540-89197-0₆₁
full_text_status: none
publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
volume: 5351 L
place_of_pub: Hanoi
pagerange: 668-677
refereed: TRUE
isbn: 354089196X; 9783540891963
issn: 03029743
citation:   Hassan, M.F. and Robertson, D.  (2008) Constraint relaxation approach for over-constrained agent interaction.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5351 L.  pp. 668-677.  ISSN 03029743