cs.CGOct 30, 2026

Catenary Visibility: A Geometric Framework for Planning with Tethered Robots

Authors: B. Ábrego, J. M. Díaz-Báñez, S. Fernández, D. Flores-Peñaloza, V. Sánchez-Canales

Organizations: Department of Mathematics, California State University, Northridge · Department of Applied Mathematics II, University of Seville, Spain · Facultad de Ciencias, Universidad Nacional Autónoma de México

Abstract

This paper introduces 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 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.

Figures & tables

Explore similar work

Aug 10, 2026

Entanglement-Free Trajectory Planning for Tethered Mobile Robots with a Slack Tether

In motion planning algorithms for tethered mobile robots, the entanglement state of the tether is a critical aspect to consider during the planning phase. This is particularly important in case of a slack tether, where the shape of the tether is not determined solely by the geometry of the environment and the location of the obstacles, but also by the dynamics of the tether, by the trajectory followed by the robot, and possibly by exogenous forces. In this scenario, preventing entanglement requires planning a robot trajectory that accounts for the entanglement definition and for the dynamics of the robot and of the tether. In this work, we propose a motion planning algorithm for tethered mobile robots with a slack tether that computes dynamically feasible entanglement-free trajectories to navigate through an environment with static obstacles. By considering the entanglement state during all the stages of the planning pipeline, we are able to compute safer trajectories that avoid entanglement during the motion of the robot. We achieve this through a three-step pipeline, which includes (i) the construction of a topological model of the entanglement-free configuration space of the tethered robot, (ii) the generation of a set of candidate paths using this model, and (iii) the computation of a dynamically feasible entanglement-free trajectory by solving a homotopy-constrained trajectory generation problem. The resulting trajectory can then be executed to lead the robot to its target location, while maintaining the tether in an entanglement-free configuration. We demonstrate the benefits of this algorithm in simulations, where we show how the planning algorithm avoids violations of the entanglement constraints, resulting in safer and more reliable trajectories.
Mar 16, 2026

Topological Motion Planning Diffusion: Generative Tangle-Free Path Planning for Tethered Robots in Obstacle-Rich Environments

In extreme environments such as underwater exploration and post-disaster rescue, tethered robots require continuous navigation while avoiding cable entanglement. Traditional planners struggle in these lifelong planning scenarios due to topological unawareness, while topology-augmented graph-search methods face computational bottlenecks in obstacle-rich environments where the number of candidate topological classes increases. To address these challenges, we propose Topological Motion Planning Diffusion (TMPD), a novel generative planning framework that integrates lifelong topological memory. Instead of relying on sequential graph search, TMPD leverages a diffusion model to propose a multimodal front-end of kinematically feasible trajectory candidates across various homotopy classes. A tether-aware topological back-end then filters and optimizes these candidates by computing generalized winding numbers to evaluate their topological energy against the accumulated tether configuration. Benchmarking in obstacle-rich simulated environments demonstrates that TMPD achieves a collision-free reach of 100% and a tangle-free rate of 97.0%, outperforming traditional topological search and purely kinematic diffusion baselines in both geometric smoothness and computational efficiency. Simulation with realistic cable dynamics further validates the practicality of the proposed approach.
Jun 29, 2026

TAPE: Tether-Aware Path Planning for Autonomous Exploration of Unknown 3D Cavities Using a Tangle-Compatible Tethered Aerial Robot

This letter presents the first method for autonomous exploration of unknown cavities in three dimensions (3D) that focuses on minimizing the distance traveled and the length of tether unwound. Considering that the tether entanglements are little influenced by the global path, our approach employs a 2-level hierarchical architecture. The global frontier-based planning solves a Traveling Salesman Problem (TSP) to minimize the distance. The local planning attempts to minimize the path cost and the tether length using an adjustable decision function whose parameters play on the trade-off between these two values. The proposed method, TAPE, is evaluated through detailed simulation studies as well as field tests. On average, our method generates a 4.1% increase in distance traveled compared to the TSP solution without our local planner, with which the length of the tether remains below the maximum allowed value in 53% of the simulated cases against 100% with our method.