Search Results for author:
Found 2 papers, 0 papers with code
GRAPE-S: Near Real-Time Coalition Formation for Multiple Service Collectives
The highly dynamic and unstructured application domains also necessitate that coalition formation algorithms produce near optimal solutions (i. e., >95% utility) in near real-time (i. e., <5 minutes) with very large collectives (i. e., hundreds of robots).
The Viability of Domain Constrained Coalition Formation for Robotic Collectives
Coalition formation algorithms can potentially facilitate collective robots' assignment to appropriate task teams; however, most coalition formation algorithms were designed for smaller multiple robot systems (i. e., 2-50 robots).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
