Cover Image

Constraint Relaxation Approach for Over-Constrained Agent Interaction

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 o...

Full description

Saved in:
Bibliographic Details
Main Authors: Hassan, M.F., Robertson, D.
Other Authors: Ho, T.-B.
Format: Book Section
Published: Springer Verlag 2008
Subjects:
QA75 Electronic computers. Computer science
QA76 Computer software
Online Access:http://eprints.utp.edu.my/1787/1/LNCS_5351.pdf
http://www.springerlink.com/content/x055247070722g06/
http://eprints.utp.edu.my/1787/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.1787
record_format eprints
spelling my.utp.eprints.17872017-01-19T08:26:30Z Constraint Relaxation Approach for Over-Constrained Agent Interaction Hassan, M.F. Robertson, D. QA75 Electronic computers. Computer science QA76 Computer software 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. Springer Verlag Ho, T.-B. Zhou, Z.-H. 2008 Book Section PeerReviewed application/pdf http://eprints.utp.edu.my/1787/1/LNCS_5351.pdf http://www.springerlink.com/content/x055247070722g06/ Hassan, M.F. and Robertson, D. (2008) Constraint Relaxation Approach for Over-Constrained Agent Interaction. In: PRICAI 2008: Trends in Artificial Intelligence. Lecture Notes in Computer Science, Volume . Springer Verlag, Berlin Heidelberg, pp. 668-677. ISBN 978-3-540-89196-3 http://eprints.utp.edu.my/1787/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic QA75 Electronic computers. Computer science
QA76 Computer software
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Hassan, M.F.
Robertson, D.
Constraint Relaxation Approach for Over-Constrained Agent Interaction
description 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.
author2 Ho, T.-B.
author_facet Ho, T.-B.
Hassan, M.F.
Robertson, D.
format Book Section
author Hassan, M.F.
Robertson, D.
author_sort Hassan, M.F.
title Constraint Relaxation Approach for Over-Constrained Agent Interaction
title_short Constraint Relaxation Approach for Over-Constrained Agent Interaction
title_full Constraint Relaxation Approach for Over-Constrained Agent Interaction
title_fullStr Constraint Relaxation Approach for Over-Constrained Agent Interaction
title_full_unstemmed Constraint Relaxation Approach for Over-Constrained Agent Interaction
title_sort constraint relaxation approach for over-constrained agent interaction
publisher Springer Verlag
publishDate 2008
url http://eprints.utp.edu.my/1787/1/LNCS_5351.pdf
http://www.springerlink.com/content/x055247070722g06/
http://eprints.utp.edu.my/1787/
_version_ 1738655153725112320
score 13.211869

Similar Items