arXiv:2607. 23393v1 Announce Type: new Abstract: Existing exact methods for 4-connected grid pathfinding reduce online search, but often either retain fine-grained search states or require substantial preprocessing.
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.
arXiv:2606. 06618v1 Announce Type: cross Abstract: How can we plan long-horizon routes that reach designated goals, visit required waypoints, and remain short when only short-horizon offline trajectories are available?
The paper introduces a unified branch‑and‑bound framework for the Steiner Traveling Salesman Problem on Graphs of Convex Sets (GCS), where the goal is to find a minimum‑cost closed walk through required convex sets while allowing optional vertices and revisits. The method uses additive lower‑bound graph costs for committed prefixes and a cut‑separated connected‑flow relaxation for the remaining cost, guaranteeing finite termination under a uniform positive‑cost assumption. Experiments on benchmark instances show that both best‑first and depth‑first traversal strategies find feasible solutions within 30 seconds, achieving mean certified optimality gaps of 28.1% and 29.7% respectively, outperforming two recent baselines.
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. 12811v1 Announce Type: cross Abstract: Although topological mapping and navigation have been studied extensively, the specific role and downstream effect of loop closures in purely topological representations has received relatively little attention.
arXiv:2606. 05956v1 Announce Type: new Abstract: Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search.
arXiv:2608. 07734v1 Announce Type: cross Abstract: Automated warehouses face a fundamental trade-off between maximizing storage density and achieving high retrieval throughput.