COAD: Constant-Time Planning for Continuous Goal Manipulation with Compressed Library and Online Adaptation

• URL: http://arxiv.org/abs/2603.12488v1
• Date: Thu, 12 Mar 2026 22:14:02 GMT
• Title: COAD: Constant-Time Planning for Continuous Goal Manipulation with Compressed Library and Online Adaptation
• Abstract summary: We present COAD, a framework that provides constant-time planning over a continuous goal- parameterized task space.<n>Instead of planning and storing solutions for every region offline, COAD constructs a compressed library by only solving representative root problems.<n>We evaluate the framework on various manipulators and environments in simulation and the real world, showing that COAD achieves substantial compression of the motion library.
• Score: 1.2425910171551517
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In many robotic manipulation tasks, the robot repeatedly solves motion-planning problems that differ mainly in the location of the goal object and its associated obstacle, while the surrounding workspace remains fixed. Prior works have shown that leveraging experience and offline computation can accelerate repeated planning queries, but they lack guarantees of covering the continuous task space and require storing large libraries of solutions. In this work, we present COAD, a framework that provides constant-time planning over a continuous goal-parameterized task space. COAD discretizes the continuous task space into finitely many Task Coverage Regions. Instead of planning and storing solutions for every region offline, it constructs a compressed library by only solving representative root problems. Other problems are handled through fast adaptation from these root solutions. At query time, the system retrieves a root motion in constant time and adapts it to the desired goal using lightweight adaptation modules such as linear interpolation, Dynamic Movement Primitives, or simple trajectory optimization. We evaluate the framework on various manipulators and environments in simulation and the real world, showing that COAD achieves substantial compression of the motion library while maintaining high success rates and sub-millisecond-level queries, outperforming baseline methods in both efficiency and path quality. The source code is available at https://github.com/elpis-lab/CoAd.

Related papers

• Advancing Omnimodal Embodied Agents from Isolated Skills to Everyday Physical Autonomy [79.09714980186278]
  Building persistent embodied agents in unstructured environments requires unified orchestration of heterogeneous tools.<n>We present OmniAct, a framework integrating a multimodal semantic planner for skill routing across unified action spaces.<n>It achieves consistent improvements in end-to-end success across all complexity levels.
  arXiv  Detail & Related papers  (2026-06-25T16:36:35Z)
• Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets [1.0323063834827415]
  Multi-agent task planning in dynamic environments requires assigning tasks to agents while simultaneously determining safe, time-efficient trajectories through the environment.<n>This paper presents a solution, which combines Graphs of Convex Sets for trajectory optimization with the Consensus-Based Bundle Algorithm (CBBA) for distributed task allocation.<n>We then connect allocation and planning to allow the agents to avoid collisions in the 3D+time configuration space and provide accurate time estimates for task completion.
  arXiv  Detail & Related papers  (2026-06-16T22:14:15Z)
• The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches [0.5219568203653523]
  This paper introduces the Multi-AMR BSRRP, coordinating a robot fleet to manage concurrent reshuffling tasks.<n>We formulate a Binary Programming (IP) model to obtain exact solutions for benchmarking purposes.
  arXiv  Detail & Related papers  (2026-03-27T15:51:38Z)
• UMBRELLA: Uncertainty-aware Multi-robot Reactive Coordination under Dynamic Temporal Logic Tasks [5.794342083222513]
  This paper addresses the problem of coordinating multi-robot systems for collaborative tasks involving dynamic and moving targets.<n>We explicitly model the uncertainty in target motion prediction via Conformal Prediction (CP)<n>The proposed framework (UMBRELLA) combines the Monte Carlo Tree Search (MCTS) over partial plans with uncertainty-aware rollouts.
  arXiv  Detail & Related papers  (2026-03-26T12:40:04Z)
• Graph-of-Constraints Model Predictive Control for Reactive Multi-agent Task and Motion Planning [14.664456948527294]
  We introduce GoC-MPC, a generalized sequence-of-constraints framework integrated with MPC.<n>GoC-MPC naturally supports partially ordered tasks, dynamic agent coordination, and disturbance recovery.<n> Experiments demonstrate that GoC-MPC achieves higher success rates, significantly faster TAMP computation, and shorter overall paths compared to recent baselines.
  arXiv  Detail & Related papers  (2026-03-19T01:45:14Z)
• AdaSpot: Spend Resolution Where It Matters for Precise Event Spotting [59.31340724915079]
  Event Spotting is a key task for applications in sports analytics, robotics, and autonomous systems.<n>bfAdaSpot achieves state-of-the-art performance under strict evaluation metrics.
  arXiv  Detail & Related papers  (2026-02-25T16:24:48Z)
• Reliable and Efficient Multi-Agent Coordination via Graph Neural Network Variational Autoencoders [14.523909983384433]
  Multi-agent coordination is crucial for reliable multi-robot navigation in shared spaces such as automated warehouses.<n>We propose to leverage Graph Neural Network Variational Autoencoders (GNN-VAE) to solve the multi-agent coordination problem at scale faster than through centralized optimization.
  arXiv  Detail & Related papers  (2025-03-04T19:20:11Z)
• 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)
• FAMO: Fast Adaptive Multitask Optimization [48.59232177073481]
  We introduce Fast Adaptive Multitask Optimization FAMO, a dynamic weighting method that decreases task losses in a balanced way. Our results indicate that FAMO achieves comparable or superior performance to state-of-the-art gradient manipulation techniques.
  arXiv  Detail & Related papers  (2023-06-06T15:39:54Z)
• Continual Test-Time Domain Adaptation [94.51284735268597]
  Test-time domain adaptation aims to adapt a source pre-trained model to a target domain without using any source data. CoTTA is easy to implement and can be readily incorporated in off-the-shelf pre-trained models.
  arXiv  Detail & Related papers  (2022-03-25T11:42:02Z)
• Goal Kernel Planning: Linearly-Solvable Non-Markovian Policies for Logical Tasks with Goal-Conditioned Options [54.40780660868349]
  We introduce a compositional framework called Linearly-Solvable Goal Kernel Dynamic Programming (LS-GKDP)<n>LS-GKDP combines the Linearly-Solvable Markov Decision Process (LMDP) formalism with the Options Framework of Reinforcement Learning.<n>We show how an LMDP with a goal kernel enables the efficient optimization of meta-policies in a lower-dimensional subspace defined by the task grounding.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints [52.58352707495122]
  We present a multi-robot allocation algorithm that decouples the key computational challenges of sequential decision-making under uncertainty and multi-agent coordination. We validate our results over a wide range of simulations on two distinct domains: multi-arm conveyor belt pick-and-place and multi-drone delivery dispatch in a city.
  arXiv  Detail & Related papers  (2020-05-27T01:10:41Z)

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.