マルチエージェントシステムにおける到達可能集合の分散計算アルゴリズム
An Algorithm for Distributed Computation of Reachable Sets for Multi-Agent Systems
無向グラフで相互作用するマルチエージェント系に対し、各エージェントが自身の状態のみを用いて到達可能集合を分散的に計算するアルゴリズムを提案し、静的グラフと制限付き時変グラフでの収束を保証した。
著者: Omanshu Thapliyal, Shanelle Clarke, Inseok Hwang
分類: eess.SY, cs.RO, cs.SY
原文アブストラクト
In this paper, we consider the problem of distributed reachable set computation for multi-agent systems (MASs) interacting over an undirected, stationary graph. A full state-feedback control input for such MASs depends no only on the current agent's state, but also of its neighbors. However, in most MAS applications, the dynamics are obscured by individual agents. This makes reachable set computation, in a fully distributed manner, a challenging problem. We utilize the ideas of polytopic reachable set approximation and generalize it to a MAS setup. We formulate the resulting sub-problems in a fully distributed manner and provide convergence guarantees for the associated computations. The proposed algorithm's convergence is proved for two cases: static MAS graphs, and time-varying graphs under certain restrictions.
