Metraipolis › archive › dc_ddf01d22461d
Planning Trajectories that Bounce: Reflection Classes for Collision-Tolerant Robots — arXiv:2609.27145
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27145
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:51:20.156Z
- SHA-256 of the archived text
e4e5eea4798e3188fe2803895747310c9b233acb35e2164432317a1c8f3e1e80- Stable URL of this page
https://metraipolis.com/documento/dc_ddf01d22461d
How to cite
Planning Trajectories that Bounce: Reflection Classes for Collision-Tolerant Robots — arXiv:2609.27145 — arXiv (en), https://arxiv.org/abs/2609.27145 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ddf01d22461d (Metraipolis archive dc_ddf01d22461d, sha256 e4e5eea4798e3188fe2803895747310c9b233acb35e2164432317a1c8f3e1e80)
BibTeX
@misc{dcddf01d22461d,
title = {Planning Trajectories that Bounce: Reflection Classes for Collision-Tolerant Robots — arXiv:2609.27145},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27145},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ddf01d22461d; sha256 e4e5eea4798e3188fe2803895747310c9b233acb35e2164432317a1c8f3e1e80},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27145. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Robot navigation methods tend to avoid contact, and consequently search for collision-free trajectories. For robots with high inertia and limited maneuverability, however, avoiding contact can require substantial steering effort and time, even when interactions with surrounding surfaces could be safely exploited. In this paper, we develop a planning method that deliberately uses controlled wall reflections to generate trajectories that can be easier and more efficient to execute than purely collision-free motion. We consider planar navigation in environments where a mobile robot is permitted to bounce off surrounding surfaces. To represent the resulting alternatives, we construct a reflection-augmented state graph in which paths are partitioned into distinct classes according to the sequence of walls used for reflection. This representation enables systematic enumeration of reflection strategies and identification of the lowest-cost path within each class. We show that, although a reflecting path cannot be shorter than the shortest collision-free path, it can reduce execution time and actuation effort by replacing costly changes in heading with controlled environmental interactions. The planned trajectories are executed using a contact-aware sampling-based controller with the robot's full dynamics. In our experiments, we demonstrate that in our simulated test scenario, the best reflecting class can reduce time and control effort. Our results show that controlled contact can provide dynamically advantageous navigation strategies that are excluded by conventional collision-avoidance formulations. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-24 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.27145 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T12:21:19.434Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).