Vidal's libraryTitle: | Cooperative Negotiation for Soft Real-Time Distributed Resource Allocation |
Author: | Roger Mailler, Victor Lesser, and Bryan Horling |
Book Tittle: | Proceedings of Second International Joint Conference on Autonomous Agents and MultiAgent Systems |
Pages: | 576--583 |
Month: | July |
Year: | 2003 |
Abstract: | In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic environment. Two central principles are used in this protocol that allow it to operate in constantly changing conditions. First, we frame the allocation problem as an optimization problem, similar to a Partial Constraint Satisfaction Problem (PCSP), and use relaxation techniques to derive con ict (constraint violation) free solutions. Second, by using overlapping mediated negotiations to conduct the search, we are able to prune large parts of the search space by using a form of arc-consistency. This allows the protocol to both quickly identify situations where the problem is overconstrained and to identify the appropriate x to the over0constrained problem. From the global perspective, the protocol has a hill climbing behavior and because it was designed to work in dynamic environments, is an approximate one. We describe the domain which inspired the creation of this protocol, as well as discuss experimental results. |
Cited by 26 - Google Scholar
@InProceedings{mailler03a,
author = {Roger Mailler and Victor Lesser and Bryan Horling},
title = {Cooperative Negotiation for Soft Real-Time
Distributed Resource Allocation},
googleid = {is-RYIUZUq0J:scholar.google.com/},
booktitle = {Proceedings of Second International Joint Conference
on Autonomous Agents and MultiAgent Systems},
pages = {576--583},
year = 2003,
month = {July},
abstract = {In this paper we present a cooperative negotiation
protocol that solves a distributed resource
allocation problem while conforming to soft
real-time constraints in a dynamic environment. Two
central principles are used in this protocol that
allow it to operate in constantly changing
conditions. First, we frame the allocation problem
as an optimization problem, similar to a Partial
Constraint Satisfaction Problem (PCSP), and use
relaxation techniques to derive con ict (constraint
violation) free solutions. Second, by using
overlapping mediated negotiations to conduct the
search, we are able to prune large parts of the
search space by using a form of
arc-consistency. This allows the protocol to both
quickly identify situations where the problem is
overconstrained and to identify the appropriate x
to the over0constrained problem. From the global
perspective, the protocol has a hill climbing
behavior and because it was designed to work in
dynamic environments, is an approximate one. We
describe the domain which inspired the creation of
this protocol, as well as discuss experimental
results.},
keywords = {multiagent dcsp},
url = {http://jmvidal.cse.sc.edu/library/mailler03a.pdf},
cluster = {12489072777293320074}
}
Last modified: Wed Mar 9 10:15:43 EST 2011