2019
One-to-many bipartite matching based coalition formation for multi-robot task allocation
ICRA 2019poster
In this paper, we study the NP-Hard problem of multi-robot coalition formation for task allocation. To tackle this notoriously difficult problem, we model it as a variant of classical bipartite matching, which we call One-To-Many Bipartite Matching (OTMaM). Unlike the classical bipartite matching te…