Optimal Knock-Pick Planning for Tightly Packed Tabletop Blocks With Parallel Grippers

• URL: http://arxiv.org/abs/2605.17800v1
• Date: Mon, 18 May 2026 03:24:49 GMT
• Title: Optimal Knock-Pick Planning for Tightly Packed Tabletop Blocks With Parallel Grippers
• Abstract summary: Rearranging densely packed tabletop objects is challenging when parallel-gripper picks are infeasible without sufficient clearance around an object.<n>This work studies the problem characteristics for practically motivated settings with uniformly sized blocks placed at planar tabletop grid locations.<n>Experiments are reported for increasing grid sizes in synthetic settings as well as in IsaacSim.
• Score: 14.463441841507477
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rearranging densely packed tabletop objects is challenging when parallel-gripper picks are infeasible without sufficient clearance around an object. This work studies the problem characteristics for practically motivated settings with uniformly sized blocks placed at planar tabletop grid locations. Since purely prehensile removal can become infeasible, a directional knock primitive is therefore introduced and the optimal knock-pick variant of the problem is formulated. The work proposes a series of abstractions wherein minimal constraining gadgets are covered to identify the necessary knocks. Utilizing a maximum-weight perfect matching on a graphical abstraction yields efficient polynomial-time computation of the optimal plan that minimizes the number of actions. Experiments are reported for increasing grid sizes in synthetic settings as well as in IsaacSim. The theoretical observations provide a promising stepping stone towards rigorously building efficient manipulation strategies that interleave prehensile and non-prehensile actions.

Related papers

• 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)
• 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)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Virtues of Ordered Chaos: Planning with Topple Actions in Tabletop Stack Rearrangement [14.463441841507477]
  This work focuses on augmenting the task planning domain with richer nonprehensile aggregating actions.<n>In order to generate the task plan and model an abstraction to compute solutions that include both pick-and-place and topple actions, a novel aggregating gadget for topple is introduced.<n>Results highlight clear benefits of achieving faster execution than solely using pick-and-place actions.
  arXiv  Detail & Related papers  (2026-05-18T03:41:59Z)
• Learning to Sparsify Stochastic Linear Bandits [12.61900668356141]
  This paper addresses the problem of learning to sparsify linear bandits, where a decision-maker sequentially selects actions from a high-dimensional space.<n>We propose an adaptively phased exploration and exploitation algorithmic framework, utilizing ordinary least squares for parameter learning and specialized subroutines for sparse action selection.
  arXiv  Detail & Related papers  (2026-05-11T07:57:37Z)
• Analysis of Optimality of Large Language Models on Planning Problems [12.31072556856411]
  We show that Reasoning-enhanced Large Language Model (LLM) planners track theoretical optimality limits with near-perfect precision.<n>We also study a formally equivalent task, the generalized Path-Star ($P*$) graph, in order to isolate true topological reasoning from semantic priors.
  arXiv  Detail & Related papers  (2026-04-03T09:27:16Z)
• ReloPush-BOSS: Optimization-guided Nonmonotone Rearrangement Planning for a Car-like Robot Pusher [1.0828616610785522]
  We focus on multi-object rearrangement planning in densely cluttered environments using a car-like robot pusher.<n>Our framework, ReloPush-BOSS, exhibits consistently highest success rates and shortest pushing paths compared to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-01-29T20:03:33Z)
• Constrained Sliced Wasserstein Embedding [15.569545184712942]
  We introduce a constrained learning approach to optimize the slicing directions for SW distances.<n>We demonstrate how this constrained slicing approach can be applied to pool high-dimensional embeddings into fixed-length permutation-invariant representations.
  arXiv  Detail & Related papers  (2025-06-02T19:43:40Z)
• Submodular Framework for Structured-Sparse Optimal Transport [7.030105924295838]
  Unbalanced optimal transport (UOT) has recently gained much attention due to its flexible framework for handling unnormalized measures and its robustness.<n>In this work, we explore learning (structured) sparse transport plans in the UOT setting, i.e., transport plans have an upper bound on the number of non-sparse entries in each column.<n>We propose novel sparsity-constrained UOT formulations building on the recently explored mean discrepancy based UOT.
  arXiv  Detail & Related papers  (2024-06-07T13:11:04Z)
• 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)
• 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)
• Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds [54.51566432934556]
  We consider distributed optimization methods for problems where forming the Hessian is computationally challenging. We leverage randomized sketches for reducing the problem dimensions as well as preserving privacy and improving straggler resilience in asynchronous distributed systems.
  arXiv  Detail & Related papers  (2022-03-18T05:49:13Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• Minimax Optimization with Smooth Algorithmic Adversaries [59.47122537182611]
  We propose a new algorithm for the min-player against smooth algorithms deployed by an adversary. Our algorithm is guaranteed to make monotonic progress having no limit cycles, and to find an appropriate number of gradient ascents.
  arXiv  Detail & Related papers  (2021-06-02T22:03:36Z)
• 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)

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.