Skip to content

From Distances to Trajectories: Real-Time Signed Distance Function Mapping and Distance-Accelerated Motion Planning for UAVs

Jul 2026 · arXiv.org · Vol abs/2607.19306 · 0 citations · 66 references
Computer Science Engineering

TL;DR

An Octree REsidual Network (OREN) is developed that pairs an explicit octree prior with an implicit neural residual to reconstruct SDFs online from point cloud observations with the efficiency of volumetric methods and the accuracy and differentiability of neural methods.

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. Conventional approaches treat mapping and planning as separate stages and often rely on binary occupancy for collision checking. We argue that these two stages should be co-designed around a single representation: a signed distance function (SDF). By encoding distance to the nearest obstacle, an SDF provides richer information for planning and trajectory optimization than occupancy alone. We develop an Octree REsidual Network (OREN) that pairs an explicit octree prior with an implicit neural residual to reconstruct SDFs online from point cloud observations with the efficiency of volumetric methods and the accuracy and differentiability of neural methods. In tandem, we develop Bubble$^\star$, a search-based planner that exploits the distance information to grow maximal collision-free balls, which we call bubbles, with formal guarantees of termination, completeness, and failure detection. Planning over a graph of bubbles significantly reduces collision checks compared to a grid-based A$^\star$ search and returns a bubble sequence that forms a safe corridor for trajectory optimization. We demonstrate the integrated OREN-Bubble$^\star$ approach onboard a quadrotor, navigating unseen indoor environments in real time under tight compute constraints. OREN improves SDF estimation by $22$% compared to baselines, while Bubble$^\star$ finds trajectories spanning $\approx 90$ m through a cluttered environment in $1$-$3$ sec., whereas baselines take up to $10$ sec. in the same environment.

View source

Similar papers

Nov 2026

VGTO: Visibility-Guided Topological Trajectory Optimization in Polyhedral Environments

Planning safe and efficient flight trajectories for autonomous aerial robots in complex and unknown environments remains a challenging problem. Achieving high-quality local replanning is particularly difficult due to the inherent trade-off between computational efficiency and trajectory optimality, as well as the susce...

Pei-Yu Cui, Hao Zhang, Jian Sun · 0 citations
Preprint Open access Sep 2026

Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices

Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...

Marat Agranovskiy · 0 citations
Oct 2026

Differentiable End-to-End UAV Navigation Using Time-of-Arrival Fields and Control Barrier Functions

Quadrotor UAVs are increasingly deployed in complex missions that demand reliable autonomous navigation and robust obstacle avoidance. Traditional modular pipelines suffer from cumulative latency, motivating a shift toward end-to-end learning-based methods. However, this paradigm still faces two fundamental challenges....

Yan-Jie Liu, Teng-Da Yang, Zi-Han Li et al. · 1 citation
Preprint Sep 2026

Probability-Based Collision Risk Evaluation of Trajectories for Optimal Control Problems with Moving Obstacles

This paper presents a method for approximating occupancy distributions, a common probabilistic representation used in trajectory planning for autonomous vehicles operating in uncertain environments. The proposed method employs B-spline surfaces in conjunction with regularization techniques to ensure smoothness and diff...

Florian Steppich, Matthias Gerdts · 0 citations
Conference Aug 2026

Comparative Analysis of A* and RRT Variants for Mobile Robot Path Planning in Multi-Scale Grid Environments

To address the trade-off between planning efficiency, path optimality, and trajectory tracking accuracy of mobile robot path planners under different spatial environments, this paper constructs square $(\mathbf{5 0 0} \times \mathbf{5 0 0})$ and elongated $(\mathbf{1 0 2 4} \times \mathbf{3 5 0})$ grid simulation maps...

Tian-Quan Feng · 0 citations
Open access Sep 2026

SACE-Bi-RRT*: Sobol-Adaptive Connection-Gated Expansion with Tangent-Plane Deflection for Three-Dimensional UAV Path Planning

Planning collision-free paths for unmanned aerial vehicles in cluttered three-dimensional environments requires balancing path length, smoothness, and consistency across repeated queries. However, existing bidirectional RRT* planners generally do not exploit two sources of information generated during the search: the l...

Zi-Yu Qin, Wen-Cong Huang, Yao Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.