Constraint Manifold Exploration for Efficient Continuous Coverage Estimation

• URL: http://arxiv.org/abs/2602.06749v1
• Date: Fri, 06 Feb 2026 14:47:28 GMT
• Title: Constraint Manifold Exploration for Efficient Continuous Coverage Estimation
• Abstract summary: Many automated manufacturing processes rely on industrial robot arms to move process-specific tools along surfaces.<n>In applications like grinding, sanding, spray painting, they need to cover fully while keeping their tools perpendicular to its surface inspection.<n>This work proposes an extended ambient configuration space that explores reachable surface regions in the configuration space.
• Score: 3.237837164701425
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many automated manufacturing processes rely on industrial robot arms to move process-specific tools along workpiece surfaces. In applications like grinding, sanding, spray painting, or inspection, they need to cover a workpiece fully while keeping their tools perpendicular to its surface. While there are approaches to generate trajectories for these applications, there are no sufficient methods for analyzing the feasibility of full surface coverage. This work proposes a sampling-based approach for continuous coverage estimation that explores reachable surface regions in the configuration space. We define an extended ambient configuration space that allows for the representation of tool position and orientation constraints. A continuation-based approach is used to explore it using two different sampling strategies. A thorough evaluation across different kinematics and environments analyzes their runtime and efficiency. This validates our ability to accurately and efficiently calculate surface coverage for complex surfaces in complicated environments.

Related papers

• ErgoSurf: Ergodic Control for the Coverage of Unknown Surfaces [10.42763227391628]
  Contact-centric tasks require robots to systematically cover the surface while maintaining stable contact.<n>Traditional ergodic control methods rely on prior knowledge of surface geometry or require a vision sensory input to scan the geometry beforehand.<n>This paper introduces a novel online ergodic control framework that achieves systematic surface coverage while simultaneously reconstructing unknown surface geometry.
  arXiv  Detail & Related papers  (2026-08-06T16:01:21Z)
• Perception-Aware Autonomous Exploration in Feature-Limited Environments [9.046854275196605]
  We propose a hierarchical perception-aware exploration framework for a stereo-equipped unmanned aerial vehicle (UAV)<n>Our approach associates each candidate frontier with an expected feature quality using a global feature map, and prioritises visually informative subgoals.<n>Compared to baselines that ignore feature quality and/or do not optimise continuous yaw, our method maintains more reliable feature tracking, reduces odometry drift, and on average 30% higher coverage before the odometry error exceeds specified thresholds.
  arXiv  Detail & Related papers  (2026-03-16T17:55:56Z)
• Stability-Guided Exploration for Diverse Motion Generation [9.57948108713335]
  Scaling up datasets is highly effective in improving the performance of deep learning models.<n> Approaches relying on collecting human demonstrations are labor-intensive and inherently limited.<n>We propose a novel method capable of finding diverse long-horizon manipulations through black-box simulation.
  arXiv  Detail & Related papers  (2026-03-06T17:53:29Z)
• 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)
• SpatialActor: Exploring Disentangled Spatial Representations for Robust Robotic Manipulation [63.48859753472547]
  SpatialActor is a framework for robust robotic manipulation that explicitly decouples semantics and geometry.<n>It achieves state-of-the-art performance with 87.4% on RLBench and improves by 13.9% to 19.4% under varying noisy conditions.
  arXiv  Detail & Related papers  (2025-11-12T18:59:08Z)
• Real-time Spatial-temporal Traversability Assessment via Feature-based Sparse Gaussian Process [15.756895046886406]
  We propose a novel spatial-temporal traversability assessment method, which aims to enable autonomous robots to navigate through complex terrains.<n>Our method outper- forms SOTA approaches in both accuracy and computational efficiency.<n>We develop an autonomous navigation framework integrated with the traversability map and validate it with a differential driven vehicle in complex outdoor envi- ronments.
  arXiv  Detail & Related papers  (2025-03-06T06:26:57Z)
• 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)
• Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning [0.0]
  This study develops a novel applied framework for real-world applications of chaotic coverage path planners.<n>It provides techniques for effective obstacle avoidance, chaotic trajectory dispersal, and accurate real-time coverage calculation.<n>The performance of this application was comparable to that of a conventional optimal path planner.
  arXiv  Detail & Related papers  (2023-05-03T00:09:31Z)
• Incremental 3D Scene Completion for Safe and Efficient Exploration Mapping and Planning [60.599223456298915]
  We propose a novel way to integrate deep learning into exploration by leveraging 3D scene completion for informed, safe, and interpretable mapping and planning. We show that our method can speed up coverage of an environment by 73% compared to the baselines with only minimal reduction in map accuracy. Even if scene completions are not included in the final map, we show that they can be used to guide the robot to choose more informative paths, speeding up the measurement of the scene with the robot's sensors by 35%.
  arXiv  Detail & Related papers  (2022-08-17T14:19:33Z)
• Data-driven and Automatic Surface Texture Analysis Using Persistent Homology [1.370633147306388]
  We propose a Topological Data Analysis (TDA) based approach to classify the roughness level of synthetic surfaces. We generate persistence diagrams that encapsulate information on the shape of the surface. We then obtain feature matrices for each surface or profile using Carlsson coordinates, persistence images, and template functions.
  arXiv  Detail & Related papers  (2021-10-19T14:19:58Z)
• Surface Warping Incorporating Machine Learning Assisted Domain Likelihood Estimation: A New Paradigm in Mine Geology Modelling and Automation [68.8204255655161]
  A Bayesian warping technique has been proposed to reshape modeled surfaces based on geochemical and spatial constraints imposed by newly acquired blasthole data. This paper focuses on incorporating machine learning in this warping framework to make the likelihood generalizable. Its foundation is laid by a Bayesian computation in which the geological domain likelihood given the chemistry, p(g|c) plays a similar role to p(y(c)|g.
  arXiv  Detail & Related papers  (2021-02-15T10:37:52Z)
• Refined Plane Segmentation for Cuboid-Shaped Objects by Leveraging Edge Detection [63.942632088208505]
  We propose a post-processing algorithm to align the segmented plane masks with edges detected in the image. This allows us to increase the accuracy of state-of-the-art approaches, while limiting ourselves to cuboid-shaped objects.
  arXiv  Detail & Related papers  (2020-03-28T18:51:43Z)

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.