衝突判定可能な点木:SIMD対応の高速最近傍探索による衝突チェック
Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Collision Checking
点群との衝突判定を10ナノ秒未満で行える新しい空間データ構造CAPTを提案し、サンプリングベースの動作計画を単一CPUスレッドで60FPS超のリアルタイム速度で実行可能にした。
著者: Clayton W. Ramsey, Zachary Kingston, Wil Thomason, Lydia E. Kavraki
分類: cs.RO
原文アブストラクト
Motion planning against sensor data is often a critical bottleneck in real-time robot control. For sampling-based motion planners, which are effective for high-dimensional systems such as manipulators, the most time-intensive component is collision checking. We present a novel spatial data structure, the collision-affording point tree (CAPT): an exact representation of point clouds that accelerates collision-checking queries between robots and point clouds by an order of magnitude, with an average query time of less than 10 nanoseconds on 3D scenes comprising thousands of points. With the CAPT, sampling-based planners can generate valid, high-quality paths in under a millisecond, with total end-to-end computation time faster than 60 FPS, on a single thread of a consumer-grade CPU. We also present a point cloud filtering algorithm, based on space-filling curves, which reduces the number of points in a point cloud while preserving structure. Our approach enables robots to plan at real-time speeds in sensed environments, opening up potential uses of planning for high-dimensional systems in dynamic, changing, and unmodeled environments.
