移動ロボットネットワークにおける被覆制御と空間分割のための適応アルゴリズム
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
イベント発生分布が未知の環境で、移動ロボット群が分散的に配置を最適化する確率的勾配アルゴリズムを提案し、被覆制御・空間分割・動的車両経路問題に適用した論文。
著者: Jerome Le Ny, George J. Pappas
分類: math.OC, cs.RO
原文アブストラクト
This paper considers deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Moreover, it is assumed that the event location distribution is a priori unknown, and can only be progressively inferred from the observation of the actual event occurrences. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. In each case, distributed stochastic gradient algorithms optimizing the performance objective are presented. The stochastic gradient view simplifies and generalizes previously proposed solutions, and is applicable to new complex scenarios, such as adaptive coverage involving heterogeneous agents. Remarkably, these algorithms often take the form of simple distributed rules that could be implemented on resource-limited platforms.
