A revision algorithm for invalid encodings in concurrent formation of overlapping coalitions

Zhang, Guofu; Jiang, Jianguo; Lu, Changhua; Su, Zhaopin; Fang, Hua; Liu, Yang

doi:10.1016/j.asoc.2010.07.015

Cited by 7 publications

(34 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where b j k ≥ 0 is a nonnegative integer and denotes the amount of resource of type k owned by agent a j . Besides, there is a coordination and communication cost π jj * ≥ 0, j * ∈ {1, • • • , n} and j * ̸ = j, between any two different agents a j and a j * [5], [10], [25], [26], [35], [37]. π jj * is a nonnegative integer, satisfying π jj = 0 and π jj * = π j * j .…”

Section: Problem Descriptionmentioning

confidence: 99%

“…The value of a coalition C i with responsibility for t i is calculated by a characteristic function [5], [10], [25], [26], [34], [35], [37] υ…”

Section: Problem Descriptionmentioning

confidence: 99%

“…Specifically, to avoid the possible resource conflicts among the competitive overlapping coalitions, Shehory and Kraus [5], [10], as well as Zhan et al [27], serially allocated agents' resources or weights to form each coalition for the given tasks, implying that a task's request can be satisfied only after the previous coalitions for the corresponding tasks have been successfully formed. In addition, Zhang et al [24], [26], as well as Lin and Hu [25], improved the binary particle swarm optimization (BPSO) [28] with the two-dimensional encoding and the corresponding heuristics to search for overlapping coalitions in a parallel manner. However, the existing work has the following drawbacks.…”

Section: Introductionmentioning

confidence: 99%

“…Section III proposes an OCF model in resource-constrained and subadditive task oriented domains and analyzes the computational complexity of the key OCSG problem. After discussing the existing AOH [26] that can be used in binary meta-heuristic algorithms for solving OCSG, the generic TOH is presented and analyzed in Section IV. An empirical verification of the proposed TOH in comparison with AOH is shown in Section V, which is followed by conclusive remarks and potential directions for future work in Section VI.…”

Section: Introductionmentioning

confidence: 99%

“…After that, an agent-oriented heuristic (AOH) [26] was presented to deal with the potential resource conflicts when some coalitions compete each other for the same agents with insufficient resources. AOH can show how many resources each agent contributes to each coalition that it has joined.…”

mentioning

confidence: 99%

See 4 more Smart Citations

A Task-Oriented Heuristic for Repairing Infeasible Solutions to Overlapping Coalition Structure Generation

Zhang

et al. 2020

IEEE Trans. Syst. Man Cybern, Syst.

Self Cite

View full text Add to dashboard Cite

Overlapping coalition formation (OCF), which provides a natural framework for modeling scenarios where each agent can join and allocate their resources to several completely different coalitions at the same time, has become a very active topic in multi-agent systems (MAS). For OCF in resourceconstrained and subadditive task oriented domains, an agent may not possess sufficient resources to meet the needs of multiple coalitions simultaneously. As a result, there may exist many potential resource conflicts among the rival overlapping coalitions. To tackle such situations, we first present a natural variation of the traditional OCF model and analyze the size of the solution space and the computational complexity of the overlapping coalition structure generation (OCSG) problem. Next, we develop a generic task-oriented heuristic (TOH) for individual repairs that can be used in binary meta-heuristic algorithms (MHAs) to generate overlapping coalitions in a parallel manner. Moreover, we show how the proposed TOH repairs a two-dimensional individual to resolve resource conflicts and discuss several basic properties. Finally, to evaluate the effectiveness of TOH, we compare it with the existing agent-oriented heuristic (AOH) for the OCSG problem. The empirical results demonstrate that TOH is of high efficiency and effectiveness in harsh environments with fierce competition over scarce resources.

show abstract