2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2016
DOI: 10.1109/smc.2016.7844232
|View full text |Cite
|
Sign up to set email alerts
|

Multi-robot coalition formation problem: Task allocation with adaptive immigrants based genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 6 publications
0
10
0
Order By: Relevance
“…With references to the literature [ 28 , 29 , 30 , 31 ], the method of graph theory to model the multi-robot team is introduced, and the formation of robot team is then deeply studied. In practical tasks, the overall performance of the multi-robot team is not the simple adding of each robot’s working performance.…”
Section: Methods and Algorithmsmentioning
confidence: 99%
“…With references to the literature [ 28 , 29 , 30 , 31 ], the method of graph theory to model the multi-robot team is introduced, and the formation of robot team is then deeply studied. In practical tasks, the overall performance of the multi-robot team is not the simple adding of each robot’s working performance.…”
Section: Methods and Algorithmsmentioning
confidence: 99%
“…19 Many research works have focused on robots coalition formation which is known as NP-Hard problem. 20 In Rauniyar and Muhuri, 21 a multi-robot coalition problem is addressed and a centralized approach, based on genetic algorithm, is used to solve it. A central robot, which has knowledge about the other robots, leads the coordination between robots to perform tasks.…”
Section: Related Workmentioning
confidence: 99%
“…The coalition formation problem is a broad problem addressed from different point of views as multi-agent system [16], robotic [6] or swarming [9]. It can be derived into very similar problems called Task allocation problem [12] or Knapsack problem [2]. Swarming approaches [1] are one method used to address this problem.…”
Section: Related Workmentioning
confidence: 99%