arXiv:2607. 13054v1 Announce Type: cross Abstract: Environmental monitoring with unmanned aerial vehicles (UAVs) requires route planning methods that maximize covered area while handling energy limits, operational constraints, and geometric complexity.
By Sebastian Jouannet-Contreras, Carola Figueroa-Flores
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.
By Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma
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.
By He Jiang, Jingtian Yan, Yulun Zhang, Yimin Tang, Tanishq Duhan, Rishi Veerapaneni, Guillaume Sartoretti, Jiaoyang Li
The paper investigates how inaccuracies in pretrained occupancy networks affect active mapping robots that select camera viewpoints to reconstruct unknown 3D scenes. By fixing the planner and varying the occupancy representation—ranging from no completion to ground‑truth occupancy—the authors find that correcting false positives or false negatives alone does not reliably improve coverage, highlighting a disconnect between occupancy accuracy and planning performance. They propose a dynamic filtering strategy that retains predictions in unexplored space while suppressing unsupported occupancy based on online observations, which preliminarily shows it can steer viewpoint selection toward reachable surfaces that would otherwise remain unseen.
By Jiahui Zhang, Gongbo Liang, Yu Zhang
arXiv:2609.16075v1 Announce Type: cross
Abstract: Flexible robotic production requires joint decisions on process progression, material routing, resource assignment, temporary cooperation, and simult...
By Fouad Bahrpeyma, David Heik, Dirk Reichelt
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.
By Michael Y. Fatemi, Jinhao Liang, Ferdinando Fioretto