arXiv AI
A Horizon-slicing Approach to Minimum Obstacle Displacement Planning for Robot Navigation
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 2
Optimal any-angle path planning in static and dynamic environments
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 AI
Jul 2
Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets
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 AI
Aug 25
Balancing Safety and Optimality in Robot Path Planning: Algorithm and Metric
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 AI
Jun 18
Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles
arXiv:2606. 18730v1 Announce Type: cross Abstract: The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one of their assigned time windows, and returns to the depot.
arXiv AI
Jun 6
From Kinematics to Dynamics: Learning to Refine Hybrid Plans for Physically Feasible Execution
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 AI
Aug 19
Dijkstra as an Oracle for Online Stochastic Shortest Path Navigation with Provable Guarantees
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.