グラフ同型に基づくモジュールロボットの分散型構成形成アルゴリズム
A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
モジュールロボット群が初期配置から目標配置へ移行する際、グラフ同型を用いて元の構成を最大限保ちつつ各モジュールの配置を分散的に決定し、時間とエネルギーを削減するアルゴリズムを提案した論文。
著者: Ayan Dutta, Prithviraj Dasgupta, Carl Nelson
分類: cs.RO, cs.DC, cs.DS
原文アブストラクト
We consider the problem of configuration formation in modular robot systems where a set of modules that are initially in different configurations and located at different locations are required to assume appropriate positions so that they can get into a new, user-specified, target configuration. We propose a novel algorithm based on graph isomorphism, where the modules select locations or spots in the target configuration using a utility-based framework, while retaining their original configuration to the greatest extent possible, to reduce the time and energy required by the modules to assume the target configuration. We have shown analytically that our proposed algorithm is complete and guarantees a Pareto-optimal allocation. Experimental simulations of our algorithm with different number of modules in different initial configurations and located initially at different locations, show that the planning time of our algorithm is nominal (order of msec. for 100 modules). We have also compared our algorithm against a market-based allocation algorithm and shown that our proposed algorithm performs better in terms of time and number of messages exchanged.
