Efficient Spatial Representation and Routing of Deformable One-Dimensional Objects for Manipulation

• URL: http://arxiv.org/abs/2202.06172v1
• Date: Sun, 13 Feb 2022 01:00:25 GMT
• Title: Efficient Spatial Representation and Routing of Deformable One-Dimensional Objects for Manipulation
• Abstract summary: This paper proposes a novel approach to spatial representation combined with route planning. The proposed method couples the routing and efficient configuration for improved planning time. Our tests and experiments show the method correctly computing the next manipulation action in sub-millisecond time.
• Score: 8.860083597706502
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the field of rigid-body robotics having matured in the last fifty years, routing, planning, and manipulation of deformable objects have emerged in recent years as a more untouched research area in many fields ranging from surgical robotics to industrial assembly and construction. Routing approaches for deformable objects which rely on learned implicit spatial representations (e.g., Learning-from-Demonstration methods) make them vulnerable to changes in the environment and the specific setup. On the other hand, algorithms that entirely separate the spatial representation of the deformable object from the routing and manipulation, often using a representation approach independent of planning, result in slow planning in high dimensional space. This paper proposes a novel approach to spatial representation combined with route planning that allows efficient routing of deformable one-dimensional objects (e.g., wires, cables, ropes, threads). The spatial representation is based on the geometrical decomposition of the space into convex subspaces, which allows an efficient coding of the configuration. Having such a configuration, the routing problem can be solved using a dynamic programming matching method with a quadratic time and space complexity. The proposed method couples the routing and efficient configuration for improved planning time. Our tests and experiments show the method correctly computing the next manipulation action in sub-millisecond time and accomplishing various routing and manipulation tasks.

Related papers

• Fast Expanding Safe Circular Regions for Efficient Local Path Planning [17.07128889722386]
  Local navigation is one of the fundamental problems in robot navigation.<n>This article proposes a more geometric algorithmic approach that enables a local navigation method with faster times and longer planning horizons.
  arXiv  Detail & Related papers  (2026-05-15T14:40:19Z)
• Efficient Hierarchical Any-Angle Path Planning on Multi-Resolution 3D Grids [21.75404161469649]
  We present a method that has the optimality and completeness properties of any-angle planners while overcoming computational tractability issues.<n>Experiments on real and synthetic environments demonstrate the proposed approach's solution quality and speed.<n>The framework is open-sourced to allow the robotics and planning community to build on our research.
  arXiv  Detail & Related papers  (2026-02-24T18:18:36Z)
• Local Path Optimization in The Latent Space Using Learned Distance Gradient [14.220732305518583]
  Constrained motion planning is a common but challenging problem in robotic manipulation.<n>In this paper, we propose a method that trains a neural network to predict the minimum distance between the robot and obstacles.<n>The learned distance gradient is then used to calculate the direction of movement in the latent space to move the robot away from obstacles.
  arXiv  Detail & Related papers  (2025-12-30T14:56:09Z)
• Fast Functionally Redundant Inverse Kinematics for Robotic Toolpath Optimisation in Manufacturing Tasks [53.04487603529418]
  Inverse kinematics algorithms can solve this in a fast, reactive framework.<n>We propose a novel algorithm to solve functionally redundant inverse kinematics for robotic manipulation.
  arXiv  Detail & Related papers  (2025-12-10T22:07:07Z)
• Search-Based Robot Motion Planning With Distance-Based Adaptive Motion Primitives [1.8874301050354767]
  This work proposes a motion planning algorithm for robotic manipulators that combines sampling-based and search-based planning methods.<n>The core contribution of the proposed approach is the usage of burs of free configuration space (C-space) as adaptive motion primitives.<n>Results demonstrate that the bur-based approach outperforms fixed-primitive planning in complex scenarios.
  arXiv  Detail & Related papers  (2025-07-01T21:33:33Z)
• Enhancing Path Planning Performance through Image Representation Learning of High-Dimensional Configuration Spaces [0.4143603294943439]
  We present a novel method for accelerating path-planning tasks in unknown scenes with obstacles. We approximate the distribution of waypoints for a collision-free path using the Rapidly-exploring Random Tree algorithm. Our experiments demonstrate promising results in accelerating path-planning tasks under critical time constraints.
  arXiv  Detail & Related papers  (2025-01-11T21:14:52Z)
• 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. 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)
• SCoTT: Wireless-Aware Path Planning with Vision Language Models and Strategic Chains-of-Thought [78.53885607559958]
  A novel approach using vision language models (VLMs) is proposed for enabling path planning in complex wireless-aware environments. To this end, insights from a digital twin with real-world wireless ray tracing data are explored. Results show that SCoTT achieves very close average path gains compared to DP-WA* while at the same time yielding consistently shorter path lengths.
  arXiv  Detail & Related papers  (2024-11-27T10:45:49Z)
• Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences [20.879194337982803]
  Multi-Agent Path-Finding (MAPF) algorithms have shown promise in discrete 2D domains, providing rigorous guarantees. We propose an approach for accelerating conflict-based search algorithms by leveraging their repetitive and incremental nature.
  arXiv  Detail & Related papers  (2024-03-29T20:31:07Z)
• AI planning in the imagination: High-level planning on learned abstract search spaces [68.75684174531962]
  We propose a new method, called PiZero, that gives an agent the ability to plan in an abstract search space that the agent learns during training. We evaluate our method on multiple domains, including the traveling salesman problem, Sokoban, 2048, the facility location problem, and Pacman.
  arXiv  Detail & Related papers  (2023-08-16T22:47:16Z)
• MANER: Multi-Agent Neural Rearrangement Planning of Objects in Cluttered Environments [8.15681999722805]
  This paper proposes a learning-based framework for multi-agent object rearrangement planning. It addresses the challenges of task sequencing and path planning in complex environments.
  arXiv  Detail & Related papers  (2023-06-10T23:53:28Z)
• Planning with Spatial-Temporal Abstraction from Point Clouds for Deformable Object Manipulation [64.00292856805865]
  We propose PlAnning with Spatial-Temporal Abstraction (PASTA), which incorporates both spatial abstraction and temporal abstraction. Our framework maps high-dimension 3D observations into a set of latent vectors and plans over skill sequences on top of the latent set representation. We show that our method can effectively perform challenging deformable object manipulation tasks in the real world.
  arXiv  Detail & Related papers  (2022-10-27T19:57:04Z)
• Learning Models as Functionals of Signed-Distance Fields for Manipulation Planning [51.74463056899926]
  This work proposes an optimization-based manipulation planning framework where the objectives are learned functionals of signed-distance fields that represent objects in the scene. We show that representing objects as signed-distance fields not only enables to learn and represent a variety of models with higher accuracy compared to point-cloud and occupancy measure representations.
  arXiv  Detail & Related papers  (2021-10-02T12:36:58Z)
• Distributed Allocation and Scheduling of Tasks with Cross-Schedule Dependencies for Heterogeneous Multi-Robot Teams [2.294915015129229]
  We present a distributed task allocation and scheduling algorithm for missions where the tasks of different robots are tightly coupled with temporal and precedence constraints. An application of the planning procedure to a practical use case of a greenhouse maintained by a multi-robot system is given.
  arXiv  Detail & Related papers  (2021-09-07T13:44:28Z)
• Dynamic Convolution for 3D Point Cloud Instance Segmentation [146.7971476424351]
  We propose an approach to instance segmentation from 3D point clouds based on dynamic convolution. We gather homogeneous points that have identical semantic categories and close votes for the geometric centroids. The proposed approach is proposal-free, and instead exploits a convolution process that adapts to the spatial and semantic characteristics of each instance.
  arXiv  Detail & Related papers  (2021-07-18T09:05:16Z)
• Learning to Rearrange Deformable Cables, Fabrics, and Bags with Goal-Conditioned Transporter Networks [36.90218756798642]
  Rearranging and manipulating deformable objects such as cables, fabrics, and bags is a long-standing challenge in robotic manipulation. We develop a suite of simulated benchmarks with 1D, 2D, and 3D deformable structures. We propose embedding goal-conditioning into Transporter Networks, a recently proposed model architecture for learning robotic manipulation.
  arXiv  Detail & Related papers  (2020-12-06T22:21:54Z)
• Jump Operator Planning: Goal-Conditioned Policy Ensembles and Zero-Shot Transfer [71.44215606325005]
  We propose a novel framework called Jump-Operator Dynamic Programming for quickly computing solutions within a super-exponential space of sequential sub-goal tasks. This approach involves controlling over an ensemble of reusable goal-conditioned polices functioning as temporally extended actions. We then identify classes of objective functions on this subspace whose solutions are invariant to the grounding, resulting in optimal zero-shot transfer.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Learning Dynamic Routing for Semantic Segmentation [86.56049245100084]
  This paper studies a conceptually new method to alleviate the scale variance in semantic representation, named dynamic routing. The proposed framework generates data-dependent routes, adapting to the scale distribution of each image. To this end, a differentiable gating function, called soft conditional gate, is proposed to select scale transform paths on the fly.
  arXiv  Detail & Related papers  (2020-03-23T17:22:14Z)
• Latent Space Roadmap for Visual Action Planning of Deformable and Rigid Object Manipulation [74.88956115580388]
  Planning is performed in a low-dimensional latent state space that embeds images. Our framework consists of two main components: a Visual Foresight Module (VFM) that generates a visual plan as a sequence of images, and an Action Proposal Network (APN) that predicts the actions between them.
  arXiv  Detail & Related papers  (2020-03-19T18:43:26Z)

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.