Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.02807 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914824603041792 |
|---|---|
| author | Ramsey, Clayton W. Kingston, Zachary Thomason, Wil Kavraki, Lydia E. |
| author_facet | Ramsey, Clayton W. Kingston, Zachary Thomason, Wil Kavraki, Lydia E. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02807 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Collision Checking Ramsey, Clayton W. Kingston, Zachary Thomason, Wil Kavraki, Lydia E. Robotics 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. |
| title | Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Collision Checking |
| topic | Robotics |
| url | https://arxiv.org/abs/2406.02807 |