Backward time-reversed conflict-based search finds initial collision-free simultaneous-arrival trajectories for agents at rest, which are then refined via distributed nonlinear ADMM optimal control.
An optimization-based receding horizon trajectory planning algorithm,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A hybrid search-plus-optimal-control framework that produces optimized, kinematically feasible trajectories for multiple agents by warm-starting an OCP from an initial feasible solution.
citing papers explorer
-
Multi-Agent Motion Planning for Simultaneous Arrival using Time-Reversed Search and Distributed Optimal Control
Backward time-reversed conflict-based search finds initial collision-free simultaneous-arrival trajectories for agents at rest, which are then refined via distributed nonlinear ADMM optimal control.
-
Optimized and kinematically feasible multi-agent motion planning
A hybrid search-plus-optimal-control framework that produces optimized, kinematically feasible trajectories for multiple agents by warm-starting an OCP from an initial feasible solution.