日本フィジカルAI新聞

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

経路計画arXiv:1809.03712

視野制約付きカルーラ・ロボットの経由点巡回経路計画

Path Planning Algorithms for a Car-Like Robot visiting a set of Waypoints with Field of View Constraints

シェア:XThreadsFacebookLINEはてブBluesky

車両型ロボットが各経由点で視野角制約を満たしつつ巡回する最短経路問題を、2点間の最適解と上下界を用いて解く手法を提案した。

著者: Sivakumar Rathinam, Satyanarayana Gupta Manyam, Yuntao Zhang

分類: cs.RO

原文アブストラクト

This article considers two variants of a shortest path problem for a car-like robot visiting a set of waypoints. The sequence of waypoints to be visited is specified in the first variant while the robot is allowed to visit the waypoints in any sequence in the second variant. Field of view constraints are also placed when the robot arrives at a waypoint, i.e., the orientation of the robot at any waypoint is restricted to belong to a given interval of angles at the waypoint. The shortest path problem is first solved for two waypoints with the field of view constraints using Pontryagin's minimum principle. Using the results for the two point problem, tight lower and upper bounds on the length of the shortest path are developed for visiting n points by relaxing the requirement that the arrival angle must be equal to the departure angle of the robot at each waypoint. Theoretical bounds are also provided on the length of the feasible solutions obtained by the proposed algorithm. Simulation results verify the performance of the bounds for instances with 20 waypoints.

関連論文

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

MINISFORUM(ミニPC)

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