Citation Context

...nclude multi-linked interacting subproblems [1]. Researchers in this domain have focused primarily on resource allocation scenarios that are formulated as distributed constraint satisfaction problems =-=[8, 12]-=-. In this work, we extend this classic formulation in two ways. First, we introduce soft real-time constraints on the protocol’s behavior. These require the negotiation to adapt to the remaining avail...

Citation Context

... the algorithmic parameters to the environment dynamics, e.g., to efficiently utilize the available bandwidth. Moreover, we plan to analytically characterize our approach and contrast it with that in =-=[2]-=-. Finally, we plan to investigate the theoretical efficiency of our multi-requirements extension to the auction algorithm. ACKNOWLEDGMENT This research is sponsored by the Defense Advanced Research Pr...

Citation Context

... seen in a large number of multi-agent applications, including autonomous multi-robotic space missions [10], virtual environments for training [35] and education [17], distributed resource allocation =-=[19]-=- and software agents on the Internet [34]. With the growing importance of teamwork, there is now a critical need for tools to help humans analyze, evaluate, and understand team behaviors. Indeed, in m...

Citation Context

...d in [11][12][13]. However, these works lack energy consideration when considering the resources. Distributed resource management is also modeled as a distributed constrained satisfaction problem [14]=-=[15]. -=-Approaches for distributed constrained satisfaction generally requires excessive exchange of messages and fits applications with very dynamic changes in sensor’s readings affect the decision of whic...

Citation Context

... (e-mail: lesser@cs.umass.edu). Digital Object Identifier 10.1109/TSMCC.2006.860577 optimization portions of resource allocation, instead modeling them as distributed constraint satisfaction problems =-=[3]-=-, [4], in order to provide reasonable solution speed. In this work, we extend the traditional formulation of the resource allocation problem in two ways. First, we introduce soft real-time deadlines o...

Citation Context

... based, optimization methods. 3.4 Distributed Constraint-Satisfaction Resource allocation problems (at least their deterministic variants) can be often formulated as constraint-satisfaction problems (=-=Modi, et al., 2001-=-). In this case, they aim at solving the following problem: optimize subject to f(x1, x2, . . . , xn), gj(x1, x2, . . . , xn) ≤ cj, where xi ∈ Ωi, i ∈ {1, . . . , n} and j ∈ {1, . . . , m}. Functions ...

Citation Context

...arket-based resource allocation is often less robust than swarm optimization methods, such as ant-colony optimization, however, their performance is usually better. Parallel Optimization It is known (=-=Modi et al., 2001-=-) that resource allocation problems (at least their deterministic variants) can be often formulated as constraint satisfaction (CS) problems. In this case, they aim at solving a multi-dimensional, con...