n個のリソース共有問題の分割：少数の高性能エージェントは多数の単純なエージェントより優れているか？
Split over $n$ resource sharing problem: Are fewer capable agents better than many simpler ones?
マルチエージェントシステムにおいて、限られたリソースを少数の高性能エージェントに集中させるか、多数の単純なエージェントに分散させるかの問題を定式化し、カバレッジタスクの事例で解析とシミュレーションにより性能を比較した。
詳しい要約
1. どんなもの？
2. 先行研究と比べてどこがすごい？
3. 技術・手法の肝は？
4. どうやって有効だと検証した？
5. 議論はある？
6. 次に読むべき論文は？
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Karthik Soma, Mohamed S. Talamali, Genki Miyauchi, Giovanni Beltrame, Heiko Hamann, Roderich Gross
分類: cs.RO, cs.MA
原文アブストラクト
In multi-agent systems, should limited resources be concentrated into a few capable agents or distributed among many simpler ones? This work formulates the split over $n$ resource sharing problem where a group of $n$ agents equally shares a common resource (e.g., monetary budget, computational resources, physical size). We present a case study in multi-agent coverage where the area of the disk-shaped footprint of agents scales as $1/n$. A formal analysis reveals that the initial coverage rate grows with $n$. However, if the speed of agents decreases proportionally with their radii, groups of all sizes perform equally well, whereas if it decreases proportionally with their footprints, a single agent performs best. We also present computer simulations in which resource splitting increases the failure rates of individual agents. The models and findings help identify optimal distributiveness levels and inform the design of multi-agent systems under resource constraints.
