Sampling-Based Motion Planning with Discrete Configuration-Space Symmetries

When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter trajectories. However, finite symmetries lead to complicated changes to the underlying topology of configuration space, preventing the use of standard algorithms. We demonstrate how the key primitives used for sampling-based planning can be efficiently implemented in spaces with finite symmetries. A rigorous theoretical analysis, building upon a study of the geometry of the configuration space, shows improvements in the sample complexity of several standard algorithms. Furthermore, a comprehensive slate of experiments demonstrates the practical improvements in both path length and runtime.

@article{cohn2025_2503.00614,
  title={ Sampling-Based Motion Planning with Discrete Configuration-Space Symmetries },
  author={ Thomas Cohn and Russ Tedrake },
  journal={arXiv preprint arXiv:2503.00614},
  year={ 2025 }
}