日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

群制御arXiv:1302.0450

確率的に揺らぐ合意ネットワークにおけるリーダー選択アルゴリズム

Algorithms for leader selection in stochastically forced consensus networks

シェア:XThreadsFacebookLINEはてブBluesky

ノイズを受けるネットワークで合意からの平均二乗偏差を最小化するリーダーノード選択問題を扱い、凸緩和による下界と貪欲法による上界、さらに大規模ネットワーク向けの半正定値計画の専用解法を提案した。

著者: Fu Lin, Makan Fardad, Mihailo R. Jovanović

分類: math.OC, cs.RO, cs.SY, eess.SY

原文アブストラクト

We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of vehicular formations and localization in sensor networks. For networks with leaders subject to noise, we show that the Boolean constraints (a node is either a leader or it is not) are the only source of nonconvexity. By relaxing these constraints to their convex hull we obtain a lower bound on the global optimal value. We also use a simple but efficient greedy algorithm to identify leaders and to compute an upper bound. For networks with leaders that perfectly follow their desired trajectories, we identify an additional source of nonconvexity in the form of a rank constraint. Removal of the rank constraint and relaxation of the Boolean constraints yields a semidefinite program for which we develop a customized algorithm well-suited for large networks. Several examples ranging from regular lattices to random graphs are provided to illustrate the effectiveness of the developed algorithms.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  3. 3Google DeepMind、ロボット向けAIを発表新製品・発表
  4. 4NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  5. 5GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開

PR・アフィリエイト広告

MINISFORUM(ミニPC)

MINISFORUM(ミニPC)の公式広告バナーMINISFORUM公式ストアを見る ↗
PR本紙発行元 EmplifAI