Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets

• URL: http://arxiv.org/abs/2607.00444v1
• Date: Wed, 01 Jul 2026 04:58:00 GMT
• Title: Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets
• Abstract summary: We present an algorithmic framework based on graphs of space-time convex sets (ST-GCSs)<n>For multi-robot motion planning, we integrate ST-GCS planning and ECD into prioritized planning methods.<n>For large-scale demonstrations, the proposed multi-robot motion planner can solve instances with up to $100$ robots within only a few minutes.
• Score: 4.512110686124693
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transient and geometrically constrained. We present an algorithmic framework based on graphs of space-time convex sets (ST-GCSs), where collision-free regions are represented as convex sets in space-time and trajectories correspond to paths on the graph together with continuous motions within the selected sets. We formulate time-optimal planning on ST-GCSs as a graph-search problem over path-indexed states and develop a best-first search solver that evaluates partial paths via continuous trajectory optimization, guided by admissible heuristics and dominance checks. We further present an Exact Convex Decomposition (ECD) scheme to reserve trajectory occupancies in space-time, enabling unified handling of dynamic obstacles and multi-robot interactions. For multi-robot motion planning, we integrate ST-GCS planning and ECD into prioritized planning methods and introduce a windowed coordination scheme to improve efficiency. Extensive experiments on single-robot and multi-robot problems demonstrate substantial speedups over various planners while maintaining high solution quality, particularly in environments with narrow and transient feasible regions. Large-scale demonstrations further show that the proposed multi-robot motion planner can solve instances with up to $100$ robots within only a few minutes. Project homepage: https://sites.google.com/view/stgcs

Related papers

• Simulation-Informed Diffusion for Decentralized Multi-robot Motion Planning [56.240199425429445]
  Multi-robot motion planning requires each robot to generate collision-free trajectories from local observations.<n>Most existing planners generate trajectories from a static snapshot of the local observation.<n>This paper introduces Simulation-Informed Diffusion (SID), a decentralized framework built on constraint-aware diffusion models.
  arXiv  Detail & Related papers  (2026-05-26T21:17:53Z)
• Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems [54.887871365121775]
  Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints.<n>We propose a hybrid multi-robot control framework that jointly optimize task and motion planning.<n>Our approach consistently improves task success over motion-agnostic and VLA-based baselines.
  arXiv  Detail & Related papers  (2026-04-22T22:58:47Z)
• Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness [15.37007491684187]
  AkinoPDF is a fast parallelized sampling-based kinodynamic motion planning technique for a broad class of differentially flat robot systems.<n>Our method is fast, exact, and compatible with any sampling-based motion planner.
  arXiv  Detail & Related papers  (2026-03-17T01:53:10Z)
• Fast Motion Planning for Non-Holonomic Mobile Robots via a Rectangular Corridor Representation of Structured Environments [43.11194204846493]
  We present a complete framework for fast motion planning of non-holonomic autonomous mobile robots.<n>Our approach introduces a deterministic free-space decomposition that creates a compact graph of overlapping rectangular corridors.<n>The framework then performs online motion planning by finding a sequence of rectangles and generating a near-time-optimal, kinematically-feasible trajectory.
  arXiv  Detail & Related papers  (2026-02-10T12:18:14Z)
• Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning [2.3416394753138037]
  Multi-Robot Motion Planning (MRMP) is a problem of computing problem of collision-free trajectories for multiple robots in continuous environments.<n>We propose Space-Time Graphs of Convex Sets (ST-GCS), a novel planner that systematically covers the collision-free space-time domain with convex sets instead of relying on random sampling.<n>We also propose Convex Decomposition (ECD) to "reserve" trajectories astemporal obstacles, addressing maintaining a collision-free space-time graph sets for subsequent planning.
  arXiv  Detail & Related papers  (2025-03-01T18:28:57Z)
• Risk-aware Integrated Task and Motion Planning for Versatile Snake Robots under Localization Failures [6.250953826294371]
  Snake robots enable mobility through extreme terrains and confined environments in terrestrial and space applications.<n>To address this issue, we propose Blind-motion with Intermittently Scheduled Scans (BLISS)<n>BLISS combines proprioception-only mobility with intermittent scans to be resilient against both localization failures and collision risks.
  arXiv  Detail & Related papers  (2025-02-27T02:02:51Z)
• Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models [57.45019514036948]
  Simultaneous MRMP Diffusion (SMD) is a novel approach integrating constrained optimization into the diffusion sampling process to produce collision-free, kinematically feasible trajectories.<n>The paper introduces a comprehensive MRMP benchmark to evaluate trajectory planning algorithms across scenarios with varying robot densities, obstacle complexities, and motion constraints.
  arXiv  Detail & Related papers  (2025-02-05T20:51:28Z)
• Monte Carlo Tree Search with Velocity Obstacles for safe and efficient motion planning in dynamic environments [49.30744329170107]
  We propose a novel approach for optimal online motion planning with minimal information about dynamic obstacles.<n>The proposed methodology combines Monte Carlo Tree Search (MCTS), for online optimal planning via model simulations, with Velocity Obstacles (VO), for obstacle avoidance.<n>We show the superiority of our methodology with respect to state-of-the-art planners, including Non-linear Model Predictive Control (NMPC), in terms of improved collision rate, computational and task performance.
  arXiv  Detail & Related papers  (2025-01-16T16:45:08Z)
• A Hybrid Evolutionary Approach for Multi Robot Coordinated Planning at Intersections [0.0]
  Coordinated multi-robot motion planning at intersections is key for safe mobility in roads, factories and warehouses.<n>We propose a new evolutionary-based algorithm using a parametric lattice-based configuration and the discrete-based RRT for collision-free multi-robot planning at intersections.
  arXiv  Detail & Related papers  (2024-12-02T03:40:04Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• Simultaneous Contact-Rich Grasping and Locomotion via Distributed Optimization Enabling Free-Climbing for Multi-Limbed Robots [60.06216976204385]
  We present an efficient motion planning framework for simultaneously solving locomotion, grasping, and contact problems. We demonstrate our proposed framework in the hardware experiments, showing that the multi-limbed robot is able to realize various motions including free-climbing at a slope angle 45deg with a much shorter planning time.
  arXiv  Detail & Related papers  (2022-07-04T13:52:10Z)

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.