日本フィジカルAI新聞

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

経路計画arXiv:1909.05711

通路構造を走行するロボットの最適経路スケジューリング

Optimal Routing Schedules for Robots Operating in Aisle-Structures

シェア:XThreadsFacebookLINEはてブBluesky

通路グラフ上で限られた移動予算のもと最大報酬の経路を選ぶ問題に対し、2つの特殊ケースを多項式時間で最適に解き、それらを組み合わせた新ヒューリスティックで一般ケースの最先端性能を上回った。

著者: Francesco Betti Sorbelli, Stefano Carpin, Federico Corò, Alfredo Navarra, Cristina M. Pinotti

分類: cs.DS, cs.RO

原文アブストラクト

In this paper, we consider the Constant-cost Orienteering Problem (COP) where a robot, constrained by a limited travel budget, aims at selecting a path with the largest reward in an aisle-graph. The aisle-graph consists of a set of loosely connected rows where the robot can change lane only at either end, but not in the middle. Even when considering this special type of graphs, the orienteering problem is known to be NP-hard. We optimally solve in polynomial time two special cases, COP-FR where the robot can only traverse full rows, and COP-SC where the robot can access the rows only from one side. To solve the general COP, we then apply our special case algorithms as well as a new heuristic that suitably combines them. Despite its light computational complexity and being confined into a very limited class of paths, the optimal solutions for COP-FR turn out to be competitive even for COP in both real and synthetic scenarios. Furthermore, our new heuristic for the general case outperforms state-of-art algorithms, especially for input with highly unbalanced rewards.

関連論文

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

PR・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

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