Skip to content
Preprint

Continuous-Time Motion Planning and Steering with Global Convergence

Oct 2026 · 0 citations
Computer Science

TL;DR

GlobMP (Global Motion Planning), a gradient projection method over piecewise-polynomial curves, on which each constraint is one polynomial per piece that must stay nonnegative over the whole motion; it alternates cost reduction with feasibility restoration.

Abstract

Motion planning is central to robotics, and it is increasingly used to correct the motions proposed by learned planners and policies. In both uses, constraints must hold at every instant of the motion, not only at sampled times. To our knowledge, no algorithm provably converges to a globally optimal motion once a smoothness cost is combined with such constraints. We cast planning and steering as a single continuous-time program: robots avoid one another and static or moving obstacles, and a learned proposal is steered by keeping the motion close to it. The program is elementary to state, yet nonconvex. We propose GlobMP (Global Motion Planning), a gradient projection method over piecewise-polynomial curves, on which each constraint is one polynomial per piece that must stay nonnegative over the whole motion; it alternates cost reduction with feasibility restoration. Under mild assumptions, we show that, from a fine grid start, its cost approaches the global optimum as the number of polynomial pieces grows, with every constraint met to any chosen tolerance, or exactly on stable instances. We demonstrate its superior performance over strong baselines in real and synthetic experiments, including teams of up to $200$ robots, multi-robot planning on the Robotarium testbed and an extended benchmark, maze navigation, and steering tactile-reactive policies on a bimanual humanoid.

View source

Similar papers

Sep 2026

Fast and Robust Temporal Logic Planning via ADMM-based Trajectory Optimization

A nonconvex splitting method based on the Alternating Direction Method of Multipliers (ADMM), which decouples smooth spatio-temporal trajectory optimization from nonsmooth discrete constraint handling within the optimization, providing a 4.7x average speedup over the state of the art on discrete and continuous-time log...

Lukas Pries, Joris Verhagen, Jon Arrizabalaga et al. · 0 citations
Preprint Oct 2026

Continuous-Time Safe Planning and Control for Agile Quadrupeds

Agile quadruped navigation in dynamic environments demands trajectories that are both dynamically feasible and provably collision-free. Most real-time planners achieve tractability through a convex reduction that requires simplified kinematic models, discarding motion that the robot can readily execute, and certify saf...

Gage MacLin, Mason B. Peterson, Camilla Tabasso et al. · 0 citations
Open access Oct 2026

Diffusion-Guided Trajectory Priors for Efficient Robotic Manipulator Motion Planning in Dynamic Environments

A hierarchical conditional diffusion framework is proposed for structured joint-space trajectory generation, which is conditioned on start and goal positions, static workspace geometry, and dynamic obstacle motions, and achieves 93.5% planning success versus 82.5% for the best learning-based baseline, Hierarchical Diff...

R. Megalingam, Sakthiprasad Kuttankulangara Manoharan, Sindhu Sankar · 0 citations
Preprint Oct 2026

Contact-based optimization for collision-free motion planning for a million robots

Multi-agent robotic systems have attracted growing interest in recent years, with applications ranging from coordinated drone shows to autonomous operations on land, in the air, and on water. At the planning level, robot motion is often modeled using double-integrator dynamics (with low-level controllers handling the p...

Jan Kamm, Antonio Terpin, R. D'Andrea · 1 citation
Preprint Oct 2026

Distributed Motion Planning for Multi-Robot Systems under Topological Constraints

Efficient and distributed coordination of mobile robots is one of the main challenges in multi-robot systems. Topological constraints, often expressed as topological braids, are a popular tool to encode complex coordination patterns between multiple mobile robots, as they offer a compact and abstract representation of...

Gianpietro Battocletti, Dimitris Boskos, D. Dimarogonas et al. · 0 citations
#artificial intelligence Preprint Oct 2026

MeshSIPP: Efficient Lattice Planning in Dynamic Environment

Autonomous navigation in dynamic environments requires computing spatiotemporal trajectories that satisfy non-holonomic motion constraints. When the trajectories of the moving obstacles are predictable or known, a promising approach is to rely on the combination of state lattices constructed from precomputed feasible m...

Marat Agranovskiy, K. Yakovlev · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.