Two-Stage Path Following for Mobile Manipulators via Dimensionality-Reduced Graph Search and Numerical Optimization

• URL: http://arxiv.org/abs/2603.07003v1
• Date: Sat, 07 Mar 2026 02:54:02 GMT
• Title: Two-Stage Path Following for Mobile Manipulators via Dimensionality-Reduced Graph Search and Numerical Optimization
• Abstract summary: Efficient path following for mobile manipulators is often hindered by high-dimensional configuration spaces and kinematic constraints.<n>This paper presents a robust two-stage configuration planning framework that decouples the 8-DoF planning problem into a tractable 2-DoF base optimization.
• Score: 13.862491697262037
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Efficient path following for mobile manipulators is often hindered by high-dimensional configuration spaces and kinematic constraints. This paper presents a robust two-stage configuration planning framework that decouples the 8-DoF planning problem into a tractable 2-DoF base optimization under a yaw-fixed base planning assumption. In the first stage, the proposed approach utilizes IRM to discretize the task-space path into a multi-layer graph, where an initial feasible path is extracted via a Dijkstra-based dynamic programming approach to ensure computational efficiency and global optimality within the discretized graph. In the second stage, to overcome discrete search quantization, feasible base regions are transformed into convex hulls, enabling subsequent continuous refinement via the L-BFGS algorithm to maximize trajectory smoothness while strictly enforcing reachability constraints. Simulation results demonstrate the theoretical precision of the proposed method by achieving sub-millimeter kinematic accuracy in simulation, and physical experiments on an omnidirectional mobile manipulator further validate the framework's robustness and practical applicability.

Related papers

• Integrated Graph Search and Model Predictive Control for Smooth and Efficient Path Planning in Autonomous Vehicles [1.228397872697275]
  A rough path is first obtained via Dijkstra search on a discretized grid.<n>A Model Predictive Control problem is formulated to refine the path.<n>The proposed algorithm is evaluated in multiple overtaking scenarios on both straight and curved roads.
  arXiv  Detail & Related papers  (2026-07-05T12:14:33Z)
• 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)
• VisPCO: Visual Token Pruning Configuration Optimization via Budget-Aware Pareto-Frontier Learning for Vision-Language Models [74.05545957865228]
  Visual token pruning methods effectively mitigate the quadratic computational growth caused by processing high-resolution images and video frames in vision-language models (VLMs)<n>We introduce, a novel framework that formulates visual token pruning as a Pareto configuration optimization problem to automatically identify optimal configurations.<n>Our approach employs continuous relaxation and straight-through estimators to enable gradient-based search, solved via the Augmented Lagrangian method.
  arXiv  Detail & Related papers  (2026-04-16T16:21:05Z)
• DRAFTO: Decoupled Reduced-space and Adaptive Feasibility-repair Trajectory Optimization for Robotic Manipulators [4.0407133618465005]
  This paper introduces a new algorithm for trajectory optimization, Decoupled Reduced-space and Adaptive Feasibility-repair Trajectory Optimization (DRAFTO)<n>To reduce the number of repeated constrained optimizations while handling joint-limit feasibility, the optimization is decoupled into a reduced-space Gauss-Newton (GN) descent.<n>The results of our benchmark tests against optimization-based planners, such as CHOMP, TrajOpt, GPMP2, and FACTO, validate the high efficiency and reliability across diverse scenarios and tasks.
  arXiv  Detail & Related papers  (2026-03-10T20:24:42Z)
• FACTO: Function-space Adaptive Constrained Trajectory Optimization for Robotic Manipulators [4.0407133618465005]
  This paper introduces Function-space Adaptive Constrained Trajectory Optimization (FACTO) for single- and multi-arm manipulators.<n>To address nonlinearity, FACTO uses a Gauss-Newton approximation with exponential moving averaging, yielding a smoothed quadratic subproblem.<n>The experimental evaluation of FACTO on Franka robots verifies the feasibility of deployment.
  arXiv  Detail & Related papers  (2026-02-23T16:38:13Z)
• Robust Inference-Time Steering of Protein Diffusion Models via Embedding Optimization [6.097829741846035]
  EmbedOpt is an inference-time approach for steering diffusion models to optimize experimental likelihoods in the conditional embedding space.<n>We show that EmbedOpt outperforms the coordinate-based posterior sampling method in map fitting tasks and matches performance on distance constraint tasks.
  arXiv  Detail & Related papers  (2026-02-05T04:13:33Z)
• Robust Rigid Body Assembly via Contact-Implicit Optimal Control with Exact Second-Order Derivatives [0.9079873854272275]
  This paper proposes a sample-efficient robust optimal control approach for the determination of assembly motions.<n>A differentiable physics simulation is constructed that provides second-order analytic derivatives to the numerical solver.<n>The solution of the physics simulation problem is made differentiable by using smoothing inspired by interior-point methods applied to both the collision detection and the contact resolution problem.
  arXiv  Detail & Related papers  (2026-01-30T11:21:20Z)
• Towards a Unified Analysis of Neural Networks in Nonparametric Instrumental Variable Regression: Optimization and Generalization [66.08522228989634]
  We establish the first global convergence result of neural networks for two stage least squares (2SLS) approach in nonparametric instrumental variable regression (NPIV)<n>This is achieved by adopting a lifted perspective through mean-field Langevin dynamics (MFLD)
  arXiv  Detail & Related papers  (2025-11-18T17:51:17Z)
• Aligning Latent Spaces with Flow Priors [72.24305287508474]
  This paper presents a novel framework for aligning learnable latent spaces to arbitrary target distributions by leveraging flow-based generative models as priors.<n> Notably, the proposed method eliminates computationally expensive likelihood evaluations and avoids ODE solving during optimization.
  arXiv  Detail & Related papers  (2025-06-05T16:59:53Z)
• Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models [57.52124921268249]
  We propose a Trust Sequential Quadratic Programming method to find both first and second-order stationary points. To converge to first-order stationary points, our method computes a gradient step in each iteration defined by minimizing a approximation of the objective subject. To converge to second-order stationary points, our method additionally computes an eigen step to explore the negative curvature the reduced Hessian matrix.
  arXiv  Detail & Related papers  (2024-09-24T04:39:47Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• RL-PGO: Reinforcement Learning-based Planar Pose-Graph Optimization [1.4884785898657995]
  This paper presents a state-of-the-art Deep Reinforcement Learning (DRL) based environment and proposed agent for 2D pose-graph optimization. We demonstrate that the pose-graph optimization problem can be modeled as a partially observable Decision Process and evaluate performance on real-world and synthetic datasets.
  arXiv  Detail & Related papers  (2022-02-26T20:10:14Z)
• Escaping Poor Local Minima in Large Scale Robust Estimation [41.304283715031204]
  We introduce two novel approaches for robust parameter estimation. The first algorithm uses an adaptive kernel scaling strategy that enjoys a strong ability to escape poor minima. The second algorithm combines a generalized Majorization Minimization framework with the half-quadratic lifting formulation to obtain a simple yet efficient solver.
  arXiv  Detail & Related papers  (2021-02-22T11:58:29Z)
• Cogradient Descent for Bilinear Optimization [124.45816011848096]
  We introduce a Cogradient Descent algorithm (CoGD) to address the bilinear problem. We solve one variable by considering its coupling relationship with the other, leading to a synchronous gradient descent. Our algorithm is applied to solve problems with one variable under the sparsity constraint.
  arXiv  Detail & Related papers  (2020-06-16T13:41: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.