日本フィジカルAI新聞

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

経路計画arXiv:2402.17071

複数エージェントを逐次支援する協調航法支援車両の経路計画

Path Planning for a Cooperative Navigation Aid Vehicle to Assist Multiple Agents Sequentially

シェア:XThreadsFacebookLINEはてブBluesky

1台の水中協調航法支援車両が複数のエージェントを順番に支援し、平均航法不確かさを最小化するための経路計画手法を提案し、貪欲法と最適法を比較した。

著者: Artur Wolek

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

原文アブストラクト

This paper considers planning a path for a single underwater cooperative navigation aid (CNA) vehicle to sequentially aid a set of N agents to minimize average navigation uncertainty. Both the CNA and agents are modeled as constant-velocity vehicles. The agents travel along known nominal trajectories and the CNA plans a path to sequentially intercept them. Navigation aiding is modeled by a scalar discrete time Kalman filter. During path planning, the CNA considers surfacing to reduce its own navigation uncertainty. A greedy planning algorithm is proposed that uses a heuristic to schedule agents to the CNA that is based on the optimal time-to-aid, the overall navigation uncertainty reduction, and the transit time. The approach is compared to an optimal (exhaustive enumeration) algorithm through a Monte Carlo experiment with randomized agent trajectories and initial navigation uncertainty.

関連論文

  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・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

FRONTIER(GPU搭載BTOパソコン)の公式広告バナーFRONTIERでGPU搭載PCを見る ↗
PR本紙発行元 EmplifAI