日本フィジカルAI新聞

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

マニピュレーションarXiv:2205.02662

貪欲クラスタリングによる多点多関節ロボットマニピュレーションの順序最適化

Greedy Clustering-Based Algorithm for Improving Multi-point Robotic Manipulation Sequencing

シェア:XThreadsFacebookLINEはてブBluesky

ロボットの多点多関節作業の順序決定を、ウェイポイント生成・空間クラスタリング・局所最適化の3段階で行い、計画時間と実行時間の合計を短縮する手法を提案し、UR5実機で検証した。

著者: Gavin Strunk

分類: cs.RO

原文アブストラクト

The problem of optimizing a sequence of tasks for a robot, also known as multi-point manufacturing, is a well-studied problem. Many of these solutions use a variant of the Traveling Salesman Problem (TSP) and seek to find the minimum distance or time solution. Optimal solution methods struggle to run in real-time and scale for larger problems. In online planning applications where the tasks being executed are fast, the computational time to optimize the ordering can dominate the total execution time. The optimal solution in this application is defined as the computational time for planning plus the execution time. Therefore, the algorithm presented here balances the quality of the solution with the total execution time by finding a locally optimal sequence. The algorithm is comprised of waypoint generation, spatial clustering, and waypoint optimization. Significant improvements in time reduction were seen and validated against a base case algorithm in simulation and on a real UR5 robot.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  3. 3パナソニックHDなど、触覚に即応する両手作業AI「T-Rex」を共同開発研究・技術
  4. 4SoftBank主導、Agile Robotsが5億ドル調達 NVIDIAと日立も参加資金調達
  5. 5NTT、ロボットの行動前に荷崩れを予測研究・技術

PR・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

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