In this paper, the authors formulate efficiency of cooperation among autonomous mobile agents. We focus on a kind of collaborative stick pulling task. We consinder a range to recruit other agents when an individual agent finds new job. There is non-trivial range that maximize performance of a whole system because the performance depends on condition of tasks. We have verified the formulated results, and evaluate our proposing algorithm by comparing with random walk and greedy-recruiting algorithm.
各種検索
サポート
ヘルプ