An Algorithm for Simultaneous Coalition Structure Generation and Task Assignment

Präntare, Fredrik; Ragnemalm, Ingemar; Heintz, Fredrik

doi:10.1007/978-3-319-69131-2_34

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…wherev j ∈ [1, K ] andv ∈ Z; for example, v j = k indicates that platform, P j , is assigned to the tactical Holon platform set that executes task cluster C k . It is to be noted that although the expressions of the decision vectors given by (8) and (9) are different, the physical meaning is the same.…”

Section: A Platform-set Clustering Modelmentioning

confidence: 99%

“…on the grouping technology and nested genetic algorithm; using these for war task platform resource scheduling and platform resource matching minimizes the workload of the decision entity, and maximizes the quality of combat mission completion. Präntare et al [8] studied the problem of forming disjoint coalitions and assigning them to independent tasks simultaneously, and presented an anytime algorithm to solve the simultaneous coalition structure generation and task assignment problem. Tan et al [9] designed a limited central control hierarchy C2 structure for unmanned warship formation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Holonic-C2 Organization Structure Generation Method Based on Clustering Optimization Algorithms

et al. 2019

View full text Add to dashboard Cite

For Holonic-C2 organization-structure generation, a set of methods based on task-cluster clustering and platform-set optimization are proposed. Initially, the mathematical descriptions of the Holonic-C2 organization components are presented, and the characteristics and advantages of the Holonic-C2 organization are analyzed. To address the critical problems of task cluster and platform-set construction in the organization structure, with the equalization of the task resource requirements and platform resource capabilities, the mathematical models for two-stage clustering optimization are established, respectively. The multi-view clustering optimization and neighborhood search artificial bee colony algorithms are proposed and applied, respectively, for solving these mathematical models. Finally, Monte Carlo simulations are performed, and the obtained results demonstrate the effectiveness of the proposed models and algorithms.

show abstract

Section: A Platform-set Clustering Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Holonic-C2 Organization Structure Generation Method Based on Clustering Optimization Algorithms

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Note that this paper is a significantly extended and thoroughly revised version of two previous papers [28,29]. More specifically, in this paper, we provide a more thorough review of related algorithms and domains together with examples and descriptions of a few potential applications.…”

Section: Introductionmentioning

confidence: 99%

An anytime algorithm for optimal simultaneous coalition structure generation and assignment

Präntare

Heintz

2020

Auton Agent Multi-Agent Syst

Self Cite

View full text Add to dashboard Cite

An important research problem in artificial intelligence is how to organize multiple agents, and coordinate them, so that they can work together to solve problems. Coordinating agents in a multi-agent system can significantly affect the system's performance-the agents can, in many instances, be organized so that they can solve tasks more efficiently, and consequently benefit collectively and individually. Central to this endeavor is coalition formation-the process by which heterogeneous agents organize and form disjoint groups (coalitions). Coalition formation often involves finding a coalition structure (an exhaustive set of disjoint coalitions) that maximizes the system's potential performance (e.g., social welfare) through coalition structure generation. However, coalition structure generation typically has no notion of goals. In cooperative settings, where coordination of multiple coalitions is important, this may generate suboptimal teams for achieving and accomplishing the tasks and goals at hand. With this in mind, we consider simultaneously generating coalitions of agents and assigning the coalitions to independent alternatives (e.g., tasks/goals), and present an anytime algorithm for the simultaneous coalition structure generation and assignment problem. This combinatorial optimization problem has many real-world applications, including forming goal-oriented teams. To evaluate the presented algorithm's performance, we present five methods for synthetic problem set generation, and benchmark the algorithm against the industry-grade solver CPLEX using randomized data sets of varying distribution and complexity. To test its anytimeperformance, we compare the quality of its interim solutions against those generated by a greedy algorithm and pure random search. Finally, we also apply the algorithm to solve the problem of assigning agents to regions in a major commercial strategy game, and show that it can be used in game-playing to coordinate smaller sets of agents in real-time.

show abstract

An Anytime Algorithm for Simultaneous Coalition Structure Generation and Assignment

Präntare

Heintz

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An Algorithm for Simultaneous Coalition Structure Generation and Task Assignment

Cited by 4 publications

References 9 publications

Holonic-C2 Organization Structure Generation Method Based on Clustering Optimization Algorithms

Holonic-C2 Organization Structure Generation Method Based on Clustering Optimization Algorithms

An anytime algorithm for optimal simultaneous coalition structure generation and assignment

An Anytime Algorithm for Simultaneous Coalition Structure Generation and Assignment

Contact Info

Product

Resources

About