arXiv:2607. 00444v1 Announce Type: cross 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.
arXiv:2607. 28679v1 Announce Type: new Abstract: Multi-agent planning problems arise in a variety of engineering applications, such as multi-robot wildfire fighting and unmanned aerial inspection in factories.
arXiv:2512.00939v3 Announce Type: replace-cross Abstract: Recent progress in contact-rich robotic manipulation has been striking, yet most deployed systems remain confined to simple, scripted routine...
arXiv:2607. 04124v1 Announce Type: cross Abstract: Employing multiple manipulators can boost efficiency and accomplish tasks that a single manipulator cannot do.
arXiv:2603.08814v2 Announce Type: replace-cross Abstract: Long-horizon task planning for heterogeneous multi-robot systems is essential for deploying collaborative teams in real-world environments; y...
arXiv:2608. 06702v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires generating collision-free paths for large agent fleets under strict real-time constraints.
arXiv:2607. 19306v1 Announce Type: cross Abstract: Autonomous flight in cluttered environments requires a robot to build a geometric map of its surroundings and plan safe, dynamically feasible trajectories, all onboard and in real time.
The paper presents 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. By reconstructing trajectory scores through local interactions between neighboring waypoints and nearby constraints, the method decomposes the denoising process while preserving the optimization structure of classical trajectory methods. Experiments demonstrate that this approach generates smooth, feasible trajectories for large multi-agent tasks in complex environments quickly, outperforming learning-based and optimization baselines without requiring training data.
arXiv:2604. 12474v3 Announce Type: replace-cross Abstract: In many robotic tasks, agents must traverse a sequence of spatial regions to complete a mission.
arXiv:2608. 05588v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires repeatedly planning collision-free paths for agents that continuously receive new goals upon reaching their current ones.
arXiv:2608. 07734v1 Announce Type: cross Abstract: Automated warehouses face a fundamental trade-off between maximizing storage density and achieving high retrieval throughput.
arXiv:2604. 07084v2 Announce Type: replace-cross Abstract: Open-loop end-to-end neural motion planners have recently been proposed to improve motion planning for robotic manipulators.
arXiv:2504. 17901v3 Announce Type: replace-cross Abstract: Task and motion planning (TAMP) is a well-established approach for solving long-horizon robot planning problems.