Saved in:
Bibliographic Details
Main Authors: Arad, Yulie, Ashur, Stav, Markowicz, Marta, Motes, James D., Morales, Marco, Amato, Nancy M.
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.28674
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908921686392832
author Arad, Yulie
Ashur, Stav
Markowicz, Marta
Motes, James D.
Morales, Marco
Amato, Nancy M.
author_facet Arad, Yulie
Ashur, Stav
Markowicz, Marta
Motes, James D.
Morales, Marco
Amato, Nancy M.
contents Motion planning in dynamic environments, such as robotic warehouses, requires fast adaptation to frequent changes in obstacle poses. Traditional roadmap-based methods struggle in such settings, relying on inefficient reconstruction of a roadmap or expensive collision detection to update the existing roadmap. To address these challenges we introduce the Red-Green-Gray (RGG) framework, a method that builds on SPITE to quickly classify roadmap edges as invalid (red), valid (green), or uncertain (gray) using conservative geometric approximations. Serial RGG provides a high-performance variant leveraging batch serialization and vectorization to enable efficient GPU acceleration. Empirical results demonstrate that while RGG effectively reduces the number of unknown edges requiring full validation, SerRGG achieves a 2-9x speedup compared to the sequential implementation. This combination of geometric precision and computational speed makes SerRGG highly effective for time-critical robotic applications.
format Preprint
id arxiv_https___arxiv_org_abs_2603_28674
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Serialized Red-Green-Gray: Quicker Heuristic Validation of Edges in Dynamic Roadmap Graphs
Arad, Yulie
Ashur, Stav
Markowicz, Marta
Motes, James D.
Morales, Marco
Amato, Nancy M.
Robotics
Motion planning in dynamic environments, such as robotic warehouses, requires fast adaptation to frequent changes in obstacle poses. Traditional roadmap-based methods struggle in such settings, relying on inefficient reconstruction of a roadmap or expensive collision detection to update the existing roadmap. To address these challenges we introduce the Red-Green-Gray (RGG) framework, a method that builds on SPITE to quickly classify roadmap edges as invalid (red), valid (green), or uncertain (gray) using conservative geometric approximations. Serial RGG provides a high-performance variant leveraging batch serialization and vectorization to enable efficient GPU acceleration. Empirical results demonstrate that while RGG effectively reduces the number of unknown edges requiring full validation, SerRGG achieves a 2-9x speedup compared to the sequential implementation. This combination of geometric precision and computational speed makes SerRGG highly effective for time-critical robotic applications.
title Serialized Red-Green-Gray: Quicker Heuristic Validation of Edges in Dynamic Roadmap Graphs
topic Robotics
url https://arxiv.org/abs/2603.28674