The Viability of Domain Constrained Coalition Formation for Robotic Collectives
원문 초록
Applications, such as military and disaster response, can benefit from robotic collectives' ability to perform multiple cooperative tasks (e.g., surveillance, damage assessments) efficiently across a large spatial area. 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). Collectives' scale and domain-relevant constraints (i.e., distribution, near real-time, minimal communication) make coalition formation more challenging. This manuscript identifies the challenges inherent to designing coalition formation algorithms for very large collectives (e.g., 1000 robots). A survey of multiple robot coalition formation algorithms finds that most are unable to transfer directly to collectives, due to the identified system differences; however, auctions and hedonic games may be the most transferable. A simulation-based evaluation of three auction and hedonic game algorithms, applied to homogeneous and heterogeneous collectives, demonstrates that there are collective compositions for which no existing algorithm is viable; however, the experimental results and literature survey suggest paths forward.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Survey on Prompt Tuning
A Survey on Latent Reasoning
Differential Attention for Multimodal Crisis Event Analysis
A Survey on Vision-Language-Action Models for Autonomous Driving
Cloud-Aware SAR Fusion for Enhanced Optical Sensing in Space Missions
From Tiny Machine Learning to Tiny Deep Learning: A Survey
토론
이 논문과 연결된 포럼 글이 아직 없습니다.