Cooperative negotiation for soft real-time distributed resource allocation

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 conflict (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 over-constrained and to identify the appropriate fix to the over-constrained 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....

• Type: Conference
• Year: 2003
• Where: ATAL
• Authors: Roger Mailler, Victor R. Lesser, Bryan Horling
• Keywords: Air Force Research Laboratory, Allocation Problem, ATAL 2003, Defense Advanced Research Projects Agency