日本フィジカルAI新聞

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

群制御arXiv:1602.08361

無記憶移動ロボットのための形式検証済み万能集合アルゴリズム

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots

シェア:XThreadsFacebookLINEはてブBluesky

2次元平面上の無記憶移動ロボットが共通方位やカイラリティなしで任意の非二価初期配置から集合するアルゴリズムを提案し、Coqで正しさを形式証明した。

著者: Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

分類: cs.DC, cs.DS, cs.LO, cs.RO

原文アブストラクト

We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that takes advantage of this formal framework. As a case study, we present the first formally certified protocol for oblivious mobile robots evolving in a two-dimensional Euclidean space. In more details, we provide a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite number of steps the same position, not known beforehand) without relying on a common orientation nor chirality. We give very strong guaranties on the correctness of our algorithm by proving formally that it is correct, using the COQ proof assistant. This result demonstrates both the effectiveness of the approach to obtain new algorithms that use as few assumptions as necessary, and its manageability since the amount of developed code remains human readable.

関連論文

  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