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

• URL: http://arxiv.org/abs/2608.09860v1
• Date: Mon, 10 Aug 2026 17:17:53 GMT
• Title: Entanglement-Free Trajectory Planning for Tethered Mobile Robots with a Slack Tether
• Abstract summary: In motion planning algorithms for tethered mobile robots, the entanglement state of the tether is a critical aspect to consider.<n>We propose a motion planning algorithm for tethered mobile robots with a slack tether that computes dynamically feasible entanglement-free trajectories.<n>We show how this algorithm avoids violations of the entanglement constraints, resulting in safer and more reliable trajectories.
• Score: 9.67618824743514
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Safe Polytope-in-Polytope Motion Planning and Control with Control Barrier Functions [45.68209588239261]
  This work proposes a safe local motion planning and control method that guarantees that a polytopic robot footprint stays inside a convex free-space region.<n>The proposed free-space formulation does not need any obstacle detection or segmentation.<n>The approach is validated in simulation with an autonomous surface vehicle and on hardware with a non-holonomic mobile robot.
  arXiv  Detail & Related papers  (2026-06-08T16:44:28Z)
• Simulation-Informed Diffusion for Decentralized Multi-robot Motion Planning [56.240199425429445]
  Multi-robot motion planning requires each robot to generate collision-free trajectories from local observations.<n>Most existing planners generate trajectories from a static snapshot of the local observation.<n>This paper introduces Simulation-Informed Diffusion (SID), a decentralized framework built on constraint-aware diffusion models.
  arXiv  Detail & Related papers  (2026-05-26T21:17:53Z)
• Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems [54.887871365121775]
  Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints.<n>We propose a hybrid multi-robot control framework that jointly optimize task and motion planning.<n>Our approach consistently improves task success over motion-agnostic and VLA-based baselines.
  arXiv  Detail & Related papers  (2026-04-22T22:58:47Z)
• Learning Smooth and Robust Space Robotic Manipulation of Dynamic Target via Inter-frame Correlation [12.529803316934176]
  In microgravity environments, objects are typically free-floating, lacking the support and frictional constraints found on Earth.<n>This letter proposes a data-driven space robotic manipulation approach that integrates historical temporal information and inter-frame correlation mechanisms.
  arXiv  Detail & Related papers  (2026-03-29T06:27:30Z)
• Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness [15.37007491684187]
  AkinoPDF is a fast parallelized sampling-based kinodynamic motion planning technique for a broad class of differentially flat robot systems.<n>Our method is fast, exact, and compatible with any sampling-based motion planner.
  arXiv  Detail & Related papers  (2026-03-17T01:53:10Z)
• Hierarchical Trajectory Planning of Floating-Base Multi-Link Robot for Maneuvering in Confined Environments [9.325443556436436]
  Floating-base multi-link robots can change their shape during flight, making them well-suited for applications in confined environments.<n>This work introduces a hierarchical trajectory planning framework that integrates global guidance with configuration-aware local optimization.<n>To the best of our knowledge, this is the first planning framework for floating-base multi-link robots that has been demonstrated on a real robot.
  arXiv  Detail & Related papers  (2026-02-25T22:49:54Z)
• Trajectory Tracking for Multi-Manipulator Systems in Constrained Environments [9.385066923415936]
  We consider the problem of cooperative manipulation by a mobile multi-manulator system operating in obstacle-cluttered environments.<n>The task requires transporting a grasped object while respecting both continuous robot dynamics and discrete geometric constraints arising from obstacles and narrow passages.<n>We propose a multi-rate planning and control framework that combines offline generation of an STL-satisfying object collision-free base footprints with online constrained inverse trajectorys and continuous-time feedback control.
  arXiv  Detail & Related papers  (2025-12-16T09:01:49Z)
• Efficient Computation of a Continuous Topological Model of the Configuration Space of Tethered Mobile Robots [9.67618824743514]
  We build a topological model of the configuration space of a tethered robot starting from a polygonal representation of the workspace where the robot moves.<n>We show how this approach improves the performances of existing algorithms that build other types of representations of the configuration space.<n>The proposed model can be computed in a fraction of the time required to build traditional homotopy-augmented graphs.
  arXiv  Detail & Related papers  (2025-12-08T08:45:17Z)
• Neural Potential Field for Obstacle-Aware Local Motion Planning [46.42871544295734]
  We propose a neural network model that returns a differentiable collision cost based on robot pose, obstacle map, and robot footprint. Our architecture includes neural image encoders, which transform obstacle maps and robot footprints into embeddings. Experiment on Husky UGV mobile robot showed that our approach allows real-time and safe local planning.
  arXiv  Detail & Related papers  (2023-10-25T05:00:21Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• Risk-Averse MPC via Visual-Inertial Input and Recurrent Networks for Online Collision Avoidance [95.86944752753564]
  We propose an online path planning architecture that extends the model predictive control (MPC) formulation to consider future location uncertainties. Our algorithm combines an object detection pipeline with a recurrent neural network (RNN) which infers the covariance of state estimates. The robustness of our methods is validated on complex quadruped robot dynamics and can be generally applied to most robotic platforms.
  arXiv  Detail & Related papers  (2020-07-28T07:34:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.