Efficient Computation of a Continuous Topological Model of the Configuration Space of Tethered Mobile Robots

• URL: http://arxiv.org/abs/2512.07303v1
• Date: Mon, 08 Dec 2025 08:45:17 GMT
• Title: Efficient Computation of a Continuous Topological Model of the Configuration Space of Tethered Mobile Robots
• Abstract summary: 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.
• Score: 9.67618824743514
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite the attention that the problem of path planning for tethered robots has garnered in the past few decades, the approaches proposed to solve it typically rely on a discrete representation of the configuration space and do not exploit a model that can simultaneously capture the topological information of the tether and the continuous location of the robot. In this work, we explicitly build a topological model of the configuration space of a tethered robot starting from a polygonal representation of the workspace where the robot moves. To do so, we first establish a link between the configuration space of the tethered robot and the universal covering space of the workspace, and then we exploit this link to develop an algorithm to compute a simplicial complex model of the configuration space. We show how this approach improves the performances of existing algorithms that build other types of representations of the configuration space. The proposed model can be computed in a fraction of the time required to build traditional homotopy-augmented graphs, and is continuous, allowing to solve the path planning task for tethered robots using a broad set of path planning algorithms.

Related papers

• Entanglement-Free Trajectory Planning for Tethered Mobile Robots with a Slack Tether [9.67618824743514]
  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.
  arXiv  Detail & Related papers  (2026-08-10T17:17:53Z)
• 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)
• Scalable Multi-robot Motion Planning via Hierarchical Subproblem Expansion and Workspace Decomposition Refinement [0.9199488958939335]
  A fundamental challenge in multi-robot motion planning is achieving sufficient coordination without incurring the large computational expense of searching the joint configuration space of the robot group.<n>We present a method for multiple mobile robot motion planning that achieves an improvement in planning time up to an order of magnitude by leveraging the insight that we can use discrete search over a workspace decomposition to provide coordination between robots during planning.
  arXiv  Detail & Related papers  (2026-05-19T18:44:09Z)
• 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)
• Joint Task Assistance Planning via Nested Branch and Bound (Extended Version) [6.531546527140475]
  We introduce and study the Joint Task Assistance Planning problem which generalizes prior work on optimizing assistance in robotic collaboration.<n>One robot, the task robot, must execute a timed mission, while the other, the assistance robot, provides sensor-based support that depends on their spatial relationship.<n>The objective is to compute a path for both robots that maximizes the total duration of assistance given.
  arXiv  Detail & Related papers  (2026-02-15T00:04:51Z)
• Fast Motion Planning for Non-Holonomic Mobile Robots via a Rectangular Corridor Representation of Structured Environments [43.11194204846493]
  We present a complete framework for fast motion planning of non-holonomic autonomous mobile robots.<n>Our approach introduces a deterministic free-space decomposition that creates a compact graph of overlapping rectangular corridors.<n>The framework then performs online motion planning by finding a sequence of rectangles and generating a near-time-optimal, kinematically-feasible trajectory.
  arXiv  Detail & Related papers  (2026-02-10T12:18:14Z)
• A Hybrid Evolutionary Approach for Multi Robot Coordinated Planning at Intersections [0.0]
  Coordinated multi-robot motion planning at intersections is key for safe mobility in roads, factories and warehouses.<n>We propose a new evolutionary-based algorithm using a parametric lattice-based configuration and the discrete-based RRT for collision-free multi-robot planning at intersections.
  arXiv  Detail & Related papers  (2024-12-02T03:40:04Z)
• 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)
• Neural Scene Representation for Locomotion on Structured Terrain [56.48607865960868]
  We propose a learning-based method to reconstruct the local terrain for a mobile robot traversing urban environments. Using a stream of depth measurements from the onboard cameras and the robot's trajectory, the estimates the topography in the robot's vicinity. We propose a 3D reconstruction model that faithfully reconstructs the scene, despite the noisy measurements and large amounts of missing data coming from the blind spots of the camera arrangement.
  arXiv  Detail & Related papers  (2022-06-16T10:45:17Z)
• 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)
• Large Scale Distributed Collaborative Unlabeled Motion Planning with Graph Policy Gradients [122.85280150421175]
  We present a learning method to solve the unlabelled motion problem with motion constraints and space constraints in 2D space for a large number of robots. We employ a graph neural network (GNN) to parameterize policies for the robots.
  arXiv  Detail & Related papers  (2021-02-11T21:57:43Z)
• Nothing But Geometric Constraints: A Model-Free Method for Articulated Object Pose Estimation [89.82169646672872]
  We propose an unsupervised vision-based system to estimate the joint configurations of the robot arm from a sequence of RGB or RGB-D images without knowing the model a priori. We combine a classical geometric formulation with deep learning and extend the use of epipolar multi-rigid-body constraints to solve this task.
  arXiv  Detail & Related papers  (2020-11-30T20:46:48Z)
• 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)
• Combinatorics of a Discrete Trajectory Space for Robot Motion Planning [4.477410849696538]
  complexity of the problem is directly related to the dimension of the robot's configuration space. We present a discrete robot model based on the fundamental hardware specifications of a robot.
  arXiv  Detail & Related papers  (2020-05-25T12:14:20Z)

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.