arXiv:2607. 00065v1 Announce Type: cross Abstract: Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges.
arXiv:2609.22974v1 Announce Type: cross Abstract: In this paper, we investigate the Minimum Obstacle Displacement Planning problem from a robot motion planning perspective. The problem involves deter...
arXiv:2608.21395v1 Announce Type: cross Abstract: NoMaD [31] is a learned vision-navigation policy that unifies goal-conditioned navigation and exploration in a single goal-masked diffusion policy. I...
The paper presents DORA, an online learning algorithm for robot navigation that uses Dijkstra’s algorithm as an exact planning engine under a weaker condition than usual causality—specifically, nonnegativity of a reduced cost on a determinized map. DORA calls a shortest‑path oracle a fixed number of times per episode, avoids estimating transition kernels, and incorporates a logarithmic survival weight to keep contact probabilities with dynamic obstacles within a budget. Experiments on grid‑world, directional drilling, and drone surveillance benchmarks show that DORA matches optimistic value iteration with the true transition kernel while performing 4.5 to 19.3 times less planner work, reduces contacts by a factor of seventeen compared to determinize‑and‑replan, and maintains contact rates within wide budget ranges.
Mobile robots that operate in side by side with humans and critical facilities must reach their goals at low cost, despite often unknown true traversal costs of the map apriori and imperfect actuation...
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.
arXiv:2607. 00064v1 Announce Type: new Abstract: As technology advances, many path-planning algorithms have been proposed for Air Traffic Management, yet their operational adoption in tactical control remains limited, revealing a misalignment between algorithmic design priorities and air traffic controllers' needs.
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 introduces the Unified Path Planner (UPP), a graph‑search algorithm that balances safety and optimality by adaptively weighting heuristics and using a local inverse‑distance safety field. UPP auto‑tunes its parameters during search, guaranteeing suboptimality bounds while improving obstacle clearance. Evaluation on ten simulated environments shows UPP achieving a 0.94 OptiSafe score—significantly higher than existing methods—while adding only 0.5–1% to path length and maintaining a 100% success rate, with hardware validation on a TurtleBot confirming practical benefits.
arXiv:2607. 04124v1 Announce Type: cross Abstract: Employing multiple manipulators can boost efficiency and accomplish tasks that a single manipulator cannot do.
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?
arXiv:2503. 01236v3 Announce Type: replace-cross Abstract: This paper addresses fixed-graph terrain-aware path refinement, in which a global planner is restricted to a predefined route space and may remain optimal within that space while missing lower-cost terrain corridors available in the native-resolution map.