arXiv:2608. 07734v1 Announce Type: cross Abstract: Automated warehouses face a fundamental trade-off between maximizing storage density and achieving high retrieval throughput.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
The paper introduces Pivot-and-Station Multi-Agent Path Finding (PS‑MAPF), a variant of MAPF where a subset of agents must visit interchangeable pivots before all agents occupy anonymous stations. It provides a full solvability characterization: every instance on a 2‑edge‑connected graph is solvable, and for arbitrary connected graphs a structural effective‑distance measure relative to unoccupied vertices gives a necessary and sufficient condition. The authors prove that minimizing station‑makespan or station‑flowtime is NP‑hard even with a single pivot, and present three algorithms—a complete baseline, a SAT‑based optimal solver, and Pivot‑Prioritized Planning (PPP), which solves 74‑89% of benchmark instances with significantly lower makespan and flowtime than the baseline.
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. 04124v1 Announce Type: cross Abstract: Employing multiple manipulators can boost efficiency and accomplish tasks that a single manipulator cannot do.
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:2609.16075v1 Announce Type: cross Abstract: Flexible robotic production requires joint decisions on process progression, material routing, resource assignment, temporary cooperation, and simult...
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.