Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.20968 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912857521651712 |
|---|---|
| author | Arad, Yulie Ashur, Stav Amato, Nancy M. |
| author_facet | Arad, Yulie Ashur, Stav Amato, Nancy M. |
| contents | In this paper we tackle the problem of adjusting roadmap graphs for robot motion planning to non-static environments. We introduce the "Red-Green-Gray" paradigm, a modification of the SPITE method, capable of classifying the validity status of nodes and edges using cheap heuristic checks, allowing fast semi-lazy roadmap updates. Given a roadmap, we use simple computational geometry methods to approximate the swept volumes of robots and perform lazy collision checks, and label a subset of the edges as invalid (red), valid (green), or unknown (gray). We present preliminary experimental results comparing our method to the well-established technique of Leven and Hutchinson, and showing increased accuracy as well as the ability to correctly label edges as invalid while maintaining comparable update runtimes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20968 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quick Heuristic Validation of Edges in Dynamic Roadmap Graphs Arad, Yulie Ashur, Stav Amato, Nancy M. Robotics In this paper we tackle the problem of adjusting roadmap graphs for robot motion planning to non-static environments. We introduce the "Red-Green-Gray" paradigm, a modification of the SPITE method, capable of classifying the validity status of nodes and edges using cheap heuristic checks, allowing fast semi-lazy roadmap updates. Given a roadmap, we use simple computational geometry methods to approximate the swept volumes of robots and perform lazy collision checks, and label a subset of the edges as invalid (red), valid (green), or unknown (gray). We present preliminary experimental results comparing our method to the well-established technique of Leven and Hutchinson, and showing increased accuracy as well as the ability to correctly label edges as invalid while maintaining comparable update runtimes. |
| title | Quick Heuristic Validation of Edges in Dynamic Roadmap Graphs |
| topic | Robotics |
| url | https://arxiv.org/abs/2601.20968 |