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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Language: | English |
| Published: |
Springer Verlag
2008
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/1787/ http://scholars.utp.edu.my/id/eprint/1787/1/LNCS_5351.pdf |
| _version_ | 1848659170635546624 |
|---|---|
| author | Hassan, M.F. Robertson, D. |
| author2 | Ho, T.-B. |
| author_facet | Ho, T.-B. Hassan, M.F. Robertson, D. |
| author_sort | Hassan, M.F. |
| building | UTP Institutional Repository |
| collection | Online Access |
| 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.
|
| first_indexed | 2025-11-13T07:26:10Z |
| format | Book Section |
| id | oai:scholars.utp.edu.my:1787 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:26:10Z |
| publishDate | 2008 |
| publisher | Springer Verlag |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:17872017-01-19T08:26:30Z http://scholars.utp.edu.my/id/eprint/1787/ 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 en http://scholars.utp.edu.my/id/eprint/1787/1/LNCS_5351.pdf 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://www.springerlink.com/content/x055247070722g06/ |
| spellingShingle | QA75 Electronic computers. Computer science QA76 Computer software Hassan, M.F. Robertson, D. Constraint Relaxation Approach for Over-Constrained Agent Interaction |
| title | 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_short | Constraint Relaxation Approach for Over-Constrained Agent Interaction |
| title_sort | constraint relaxation approach for over-constrained agent interaction |
| topic | QA75 Electronic computers. Computer science QA76 Computer software |
| url | http://scholars.utp.edu.my/id/eprint/1787/ http://scholars.utp.edu.my/id/eprint/1787/ http://scholars.utp.edu.my/id/eprint/1787/1/LNCS_5351.pdf |