Skip to content

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

Sep 2026 · arXiv.org · Vol abs/2609.23037 · 0 citations · 23 references
Computer Science

TL;DR

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 logic problems.

Abstract

We present a fast numerical method for safe continuous-time motion planning under Temporal Logic (TL) specifications. The method generates smooth continuous trajectories that remain collision-free while robustly satisfying temporal and logical task requirements. A central component of our method is the formulation of nonconvex safety and logic constraints as unions of convex sets where associated discrete decisions are encoded in a joint feasibility graph. This graph representation allows Euclidean projection onto the feasible set and proximal robustness maximization to be reformulated as shortest- and widest-path problems, respectively. Building on this structure, we develop 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. The resulting algorithm exhibits reliable convergence across benchmarks and scales to large-scale motion-planning problems, providing a 4.7x average speedup over the state of the art on discrete and continuous-time logic problems.

View source

Similar papers

#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
Preprint Oct 2026

Continuous-Time Motion Planning and Steering with Global Convergence

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.

Mohsen Amiri, Sima Didari, D. A. Tarzanagh et al. · 0 citations
Preprint Nov 2026

Graph-Sparse Distributed Predictive Control for Multi-Robot Motion Planning vianEdge-Consensus ADMM

This paper presents a distributed model predictive control (MPC) architecture for collision-avoiding motion planning of planar robots with double-integrator dynamics. To reduce coordination demands, a time-varying predicted conflict graph selects relevant pairwise interactions. The associated collision-avoidance constr...

Josep Borras-Borras, P. Segovia, C. Ocampo-Martínez · 0 citations
Open access Sep 2026

Denoising Multirobot Trajectories

Multirobot trajectory planning is a fundamental problem in multirobot coordination but remains computationally challenging due to its nonconvex, multimodal, and high-dimensional nature. This work builds upon D4orm, a dynamics-aware diffusion-denoising framework, and develops a family of planning architectures for diver...

Yu-Hao Zhang, Keisuke Okumura, Ajay Shankar et al. · 0 citations
#machine learning Preprint Oct 2026

Training-Free Diffusion Planning with Analytical Local Scores

A training-free diffusion-based motion planner that replaces learned global trajectory scores with analytical local scores derived from obstacle, smoothness, velocity, and inter-agent feasibility terms, which yields a decomposed denoising procedure that retains the optimization structure of classical trajectory methods...

Michael Y. Fatemi, Jin-Hao Liang, Ferdinando Fioretto · 0 citations
Sep 2026

Robust Game-theoretic Motion Planning over Extended Time Horizons

This work presents a solution to nonconvex, game-theoretic motion planning problems subject to disturbances over long time horizons as a partially-decoupled generalized Nash equilibrium problem, admitting fast solution methods for competitive multi-agent motion planning.

B. Outland, Vishala Arya · 0 citations

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