Motion Planning for a Pair of Tethered Robots

• URL: http://arxiv.org/abs/2102.13212v1
• Date: Thu, 25 Feb 2021 22:45:46 GMT
• Title: Motion Planning for a Pair of Tethered Robots
• Abstract summary: We address the problem of planning motions for a pair of planar robots connected to one another via a cable of limited length. Much like prior problems with a single robot connected via a cable to a fixed base, straight line-of-sight visibility plays an important role. We show how the reduced visibility graph provides a natural discretization and captures the essential topological considerations.
• Score: 16.63034885398417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Considering an environment containing polygonal obstacles, we address the problem of planning motions for a pair of planar robots connected to one another via a cable of limited length. Much like prior problems with a single robot connected via a cable to a fixed base, straight line-of-sight visibility plays an important role. The present paper shows how the reduced visibility graph provides a natural discretization and captures the essential topological considerations very effectively for the two robot case as well. Unlike the single robot case, however, the bounded cable length introduces considerations around coordination (or equivalently, when viewed from the point of view of a centralized planner, relative timing) that complicates the matter. Indeed, the paper has to introduce a rather more involved formalization than prior single-robot work in order to establish the core theoretical result -- a theorem permitting the problem to be cast as one of finding paths rather than trajectories. Once affirmed, the planning problem reduces to a straightforward graph search with an elegant representation of the connecting cable, demanding only a few extra ancillary checks that ensure sufficiency of cable to guarantee feasibility of the solution. We describe our implementation of A${}^\star$ search, and report experimental results. Lastly, we prescribe an optimal execution for the solutions provided by the algorithm.

Related papers

• Pair-Centric Graph Rewiring for Over-Squashing via Optimal Transport-Guided Communication Alignment [24.215683640150413]
  Graph rewiring provides a structural response to over-squashing.<n>With a limited rewiring budget, the key question is which pairwise communications most need structural support.<n>This paper proposes PairAlign, a pair-centric graph rewiring framework.
  arXiv  Detail & Related papers  (2026-08-11T08:05:32Z)
• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles [49.315843050082925]
  We present a bi approach for minimum-time motion planning convex obstacles that is guaranteed to converge.<n>We find that the proposed method produces high-quality trajectories with times to produce state-of-the-art decomposition of variables.
  arXiv  Detail & Related papers  (2026-08-03T19:48:24Z)
• Socially Consistent Multi-Robot Navigation Using Decoupled Planning and Trajectory Coordination [0.0]
  Successful integration of mobile robots in human-centric environments requires navigation that is safe and efficient.<n>This paper introduces a partially decentralized framework that generates predictable and socially consistent multi-robot motion.
  arXiv  Detail & Related papers  (2026-07-22T22:38:07Z)
• From Non-Rigid to Rigid: Safe Acquisition of Rigid Communication Graphs under Limited Sensing [1.8619748472447968]
  This paper provides a method for achieving an inter robot collision free, rigid time varying communication graph.<n>The proposed approach guarantees the realization of a rigid graph for nonlinear multi robot systems.
  arXiv  Detail & Related papers  (2026-07-11T07:20:20Z)
• Semidefinite Relaxations for Collision-Free Motion Planning [53.160637667144876]
  We focus on a point robot moving from start to goal through inmathbbRn constraints in terms of $C4 trajectories.<n>We demonstrate its effectiveness as a planner for minimum-snap continuous planning with $C4 trajectories.
  arXiv  Detail & Related papers  (2026-06-12T03:18:03Z)
• 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)
• Scalable Inspection Planning via Flow-based Mixed Integer Linear Programming [8.568142982906755]
  Inspection planning is concerned with computing the shortest robot path to inspect a given set of points of interest.<n>We present highly scalable Mixed Linear Programming (MILP) solutions for GIP that significantly advance the state-of-the-art in both runtime and solution quality.
  arXiv  Detail & Related papers  (2026-03-17T14:40:26Z)
• Scalable Multi-Robot Path Planning via Quadratic Unconstrained Binary Optimization [0.0]
  Multi-Agent Path Finding (MAPF) remains a fundamental challenge in robotics.<n>This paper investigates Quadratic Unconstrained Binary Optimization (QUBO) as a structurally scalable alternative for simultaneous multi-robot path planning.
  arXiv  Detail & Related papers  (2026-02-16T14:50:04Z)
• Structural Induced Exploration for Balanced and Scalable Multi-Robot Path Planning [6.823580643749891]
  Multi-robot path planning is a fundamental yet challenging problem due to its complexity and the need to balance global efficiency with fair task allocation among robots.<n>Traditional swarm intelligence methods, although effective on small instances, often converge prematurely and struggle to scale to complex environments.<n>We present a structure-induced exploration framework that integrates structural priors into the search process of the ant colony optimization (ACO)
  arXiv  Detail & Related papers  (2025-12-25T12:53:24Z)
• Generalizability of Graph Neural Networks for Decentralized Unlabeled Motion Planning [72.86540018081531]
  Unlabeled motion planning involves assigning a set of robots to target locations while ensuring collision avoidance. This problem forms an essential building block for multi-robot systems in applications such as exploration, surveillance, and transportation. We address this problem in a decentralized setting where each robot knows only the positions of its $k$-nearest robots and $k$-nearest targets.
  arXiv  Detail & Related papers  (2024-09-29T23:57:25Z)
• Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints [56.283944756315066]
  We propose an alternative TAMP approach that unifies task and motion planning into a single search. Our approach is based on an object-centric abstraction of motion constraints that permits leveraging the computational efficiency of off-the-shelf AI search to yield physically feasible plans.
  arXiv  Detail & Related papers  (2023-12-29T14:00:20Z)
• The Complexity of Optimizing Atomic Congestion [14.845310803203724]
  Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory. We show that the problem remains highly intractable even on extremely simple networks. We conclude by extending our analysis towards the (even more challenging) min-max variant of the problem.
  arXiv  Detail & Related papers  (2023-12-15T21:31:30Z)
• Symmetry-preserving graph attention network to solve routing problems at multiple resolutions [1.9304772860080408]
  We introduce the first-ever completely equivariant model and training to solve problems. It is essential to capture the multiscale structure of the input graph. We propose a Multiresolution scheme in combination with Equi Graph Attention network (mEGAT) architecture.
  arXiv  Detail & Related papers  (2023-10-24T06:22:20Z)
• TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers [64.88759709443819]
  We suggest learning the instance-dependent proxies that are supposed to notably increase the efficiency of the search. The first proxy we suggest to learn is the correction factor, i.e. the ratio between the instance independent cost-to-go estimate and the perfect one. The second proxy is the path probability, which indicates how likely the grid cell is lying on the shortest path.
  arXiv  Detail & Related papers  (2022-12-22T14:26:11Z)
• Collaborative Navigation and Manipulation of a Cable-towed Load by Multiple Quadrupedal Robots [17.06752611128701]
  This paper tackles the problem of robots collaboratively towing a load with cables to a specified goal location while avoiding collisions in real time. The introduction of cables (as opposed to rigid links) enables the robotic team to travel through narrow spaces by changing its intrinsic dimensions through slack/taut switches of the cable. We develop and demonstrate one of the first collaborative autonomy framework that is able to move a cable-towed load, which is too heavy to move by a single robot, through narrow spaces with real-time feedback and reactive planning in experiments.
  arXiv  Detail & Related papers  (2022-06-29T06:44:23Z)
• Minimum Displacement Motion Planning for Movable Obstacles [1.7513645771137178]
  We define a metric for robot-obstacle intersection that measures the extent of the intersection. The planner first finds a path through the obstacles that minimizes the robot-obstacle intersections. The metric is then used to iteratively displace the obstacles to achieve a feasible path.
  arXiv  Detail & Related papers  (2022-04-27T07:14:13Z)
• Assembly Planning from Observations under Physical Constraints [65.83676649042623]
  The proposed algorithm uses a simple combination of physical stability constraints, convex optimization and Monte Carlo tree search to plan assemblies. It is efficient and, most importantly, robust to the errors in object detection and pose estimation unavoidable in any real robotic system.
  arXiv  Detail & Related papers  (2022-04-20T16:51:07Z)
• Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search [12.457788665461312]
  We propose a hybrid solving planner that combines machine learning models and an optimal solver. We conduct experiments on realistic scenarios and show that GCN support enables substantial speedup and smoother scaling to harder problems.
  arXiv  Detail & Related papers  (2021-08-02T16:53:21Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• Orientation Attentive Robotic Grasp Synthesis with Augmented Grasp Map Representation [62.79160608266713]
  morphological characteristics in objects may offer a wide range of plausible grasping orientations that obfuscates the visual learning of robotic grasping. Existing grasp generation approaches are cursed to construct discontinuous grasp maps by aggregating annotations for drastically different orientations per grasping point. We propose a novel augmented grasp map representation, suitable for pixel-wise synthesis, that locally disentangles grasping orientations by partitioning the angle space into multiple bins.
  arXiv  Detail & Related papers  (2020-06-09T08:54:54Z)

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.