Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework
The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branc...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/365 https://ink.library.smu.edu.sg/context/sis_research/article/1364/viewcontent/IAT05_OCOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-1364 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-13642018-11-26T02:32:04Z Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework LAU, Hoong Chuin ZHANG, Lei LIU, Chang The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP where agents are self-interested and not obliged to reveal their private information such as the order of their options with respect to cost. The objective of the generalized OCOP is to find a solution with low total cost and high overall satisfaction level of agents. A Two-Level Structured Multi-Agent Framework has been proposed: in the upper level, a neutral central solver allows agents report their preferred options in tiers and find a feasible initial solution from top tiers of options by constraint propagation and guided tiers expansion; in the lower level, agents form coalitions and negotiate among themselves on the initial solution by an argument of Persuasive Points. Experimental results have shown that this two-level structure yields very promising results that seek a good balance between the total cost of solution and the agents' overall satisfaction level in the long run. 2005-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/365 info:doi/10.1109/IAT.2005.127 https://ink.library.smu.edu.sg/context/sis_research/article/1364/viewcontent/IAT05_OCOP.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering |
spellingShingle |
Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering LAU, Hoong Chuin ZHANG, Lei LIU, Chang Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
description |
The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP where agents are self-interested and not obliged to reveal their private information such as the order of their options with respect to cost. The objective of the generalized OCOP is to find a solution with low total cost and high overall satisfaction level of agents. A Two-Level Structured Multi-Agent Framework has been proposed: in the upper level, a neutral central solver allows agents report their preferred options in tiers and find a feasible initial solution from top tiers of options by constraint propagation and guided tiers expansion; in the lower level, agents form coalitions and negotiate among themselves on the initial solution by an argument of Persuasive Points. Experimental results have shown that this two-level structure yields very promising results that seek a good balance between the total cost of solution and the agents' overall satisfaction level in the long run. |
format |
text |
author |
LAU, Hoong Chuin ZHANG, Lei LIU, Chang |
author_facet |
LAU, Hoong Chuin ZHANG, Lei LIU, Chang |
author_sort |
LAU, Hoong Chuin |
title |
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
title_short |
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
title_full |
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
title_fullStr |
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
title_full_unstemmed |
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework |
title_sort |
solving generalized open constraint optimization problem using two-level multi-agent framework |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2005 |
url |
https://ink.library.smu.edu.sg/sis_research/365 https://ink.library.smu.edu.sg/context/sis_research/article/1364/viewcontent/IAT05_OCOP.pdf |
_version_ |
1770570398161698816 |