Metraipolis › archive › dc_a52dcfcf7788
Catenary Visibility: A Geometric Framework for Planning with Tethered Robots — arXiv:2611.00324
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00324
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:58:44.054Z
- SHA-256 of the archived text
6a105bacf5db524c8a573b4ad9f6bdba0a47ea83289482c69cc1d15806c6f458- Stable URL of this page
https://metraipolis.com/documento/dc_a52dcfcf7788
How to cite
Catenary Visibility: A Geometric Framework for Planning with Tethered Robots — arXiv:2611.00324 — arXiv (en), https://arxiv.org/abs/2611.00324 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a52dcfcf7788 (Metraipolis archive dc_a52dcfcf7788, sha256 6a105bacf5db524c8a573b4ad9f6bdba0a47ea83289482c69cc1d15806c6f458)
BibTeX
@misc{dca52dcfcf7788,
title = {Catenary Visibility: A Geometric Framework for Planning with Tethered Robots — arXiv:2611.00324},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00324},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a52dcfcf7788; sha256 6a105bacf5db524c8a573b4ad9f6bdba0a47ea83289482c69cc1d15806c6f458},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00324. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper introduces \emph{catenary visibility}, a new geometric visibility concept for a robotic system consisting of a ground robot tethered to an aerial drone. The tether is modeled as an extensible catenary curve with bounded length, providing sustained power and significantly extending operational range. We define a point on the ground plane as \emph{catenary-visible} from a target point in 3D if there exists a collision-free catenary connecting them, given a set of obstacles. This paper introduces a geometric framework for visibility-aware planning of a tethered marsupial system, addressing the computational challenge of determining the feasible deployment locus: the collection of points in the ground plane that are catenary-visible from a given target in 3D space. We begin by solving the 2D subproblem, where the obstacles, target, and the ground vehicle's line of motion are all constrained to a single vertical plane. Our algorithm for this case computes the complete set of feasible launch points along the motion line and simultaneously determines the range of viable cable lengths for each. We also consider the query problem of finding all collision-free length ranges for a given location of the ground robot. Building upon this planar solution, we then generalize the approach to three dimensions, deriving a 3D solution for a constrained class of obstacles.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno).
Categorie arXiv: Computational Geometry (cs.CG) ; Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2611.00324 — 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-11-03T18:17:07.788Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).