mlsanityData to 14 Oct 2026

MO-SeGMan: Rearrangement Planning Framework for Multi Objective Sequential and Guided Manipulation in Constrained Environments

arXiv 2511.01476 ↗First posted 3 Nov 2025cs.RO cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In this work, we introduce MO-SeGMan, a Multi-Objective Sequential and Guided Manipulation planner for highly constrained rearrangement problems. MO-SeGMan generates object placement sequences that minimize both replanning per object and robot travel distance while preserving critical dependency structures with a lazy evaluation method. To address highly cluttered, non-monotone scenarios, we propose a Selective Guided Forward Search (SGFS) that efficiently relocates only critical obstacles and to feasible relocation points. Furthermore, we adopt a refinement method for adaptive subgoal selection to eliminate unnecessary pick-and-place actions, thereby improving overall solution quality. Extensive evaluations on nine benchmark rearrangement tasks demonstrate that MO-SeGMan generates feasible motion plans in all cases, consistently achieving faster solution times and superior solution quality compared to the baselines. These results highlight the robustness and scalability of the proposed framework for complex rearrangement planning problems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 26 references that are in the map. First posted on arXiv 3 Nov 2025.

Builds on

16 of 26 references.

References · 16

  1. 2021Long-Horizon Multi-Robot Rearrangement Planning for Construction Assemblycited by 24
  2. 2020Where to relocate?: Object rearrangement inside cluttered and confined environments for robotic manipulationcited by 16
  3. 2017Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Graspscited by 10
  4. 2021Fast High-Quality Tabletop Rearrangement in Bounded Workspacecited by 9
  5. 2014Newton methods for k-order Markov Constrained Motion Problemscited by 6
  6. 2023Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applicationscited by 4
  7. 2023Toward Optimal Tabletop Rearrangement with Multiple Manipulation Primitivescited by 4
  8. 2023ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A Starcited by 3
  9. 2017High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methodscited by 2
  10. 2022Rearrangement-Based Manipulation via Kinodynamic Planning and Dynamic Planning Horizonscited by 2
  11. 2023Multi-Stage Monte Carlo Tree Search for Non-Monotone Object Rearrangement Planning in Narrow Confined Environmentscited by 2
  12. 2024Planning for Tabletop Object Rearrangementcited by 2
4 more
  1. 2022Solving Rearrangement Puzzles using Path Defragmentation in Factored State Spacescited by 1
  2. 2024Solving Sequential Manipulation Puzzles by Finding Easier Subproblemscited by 1
  3. 2025SeGMan: Sequential and Guided Manipulation Planner for Robust Planning in 2D Constrained Environmentscited by 1
  4. 2025Mobile Manipulation Planning for Tabletop Rearrangementcited by 1

Built on by

Not cited yet.