# Exploiting Euclidean Distance Field Properties for Fast and Safe 3D planning with a modified Lazy Theta\*

Source: [Exploiting Euclidean Distance Field Properties for Fast and Safe 3D planning with a modified Lazy Theta\*](<https://www.sota2.com/research/paper/68fa78e61e209131cea7b162>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-01-17T05:00:11.890Z

Authors: Jose A. Cobano, L. Merino, F. Caballero

Published: 2025-05-29T21:51:02.000Z

## Abstract

This paper presents the FS-Planner, a fast graph-search planner based on a modified Lazy Theta\* algorithm that exploits the analytical properties of Euclidean Distance Fields (EDFs). We introduce a new cost function that integrates an EDF-based term proven to satisfy the triangle inequality, enabling efficient parent selection and reducing computation time while generating safe paths with smaller heading variations. We also derive an analytic approximation of the EDF integral along a segment and analyze the influence of the line-of-sight limit on the approximation error, motivating the use of a bounded visibility range. Furthermore, we propose a gradient-based neighbour-selection mechanism that decreases the number of explored nodes and improves computational performance without degrading safety or path quality. The FS-Planner produces safe paths with small heading changes without requiring the use of post-processing methods. Extensive experiments and comparisons in challenging 3D indoor simulation environments, complemented by tests in real-world outdoor environments, are used to evaluate and validate the FS-Planner. The results show consistent improvements in computation time, exploration efficiency, safety, and smoothness in a geometric sense compared with baseline heuristic planners, while maintaining sub-optimality within acceptable bounds. Finally, the proposed EDF-based cost formulation is orthogonal to the underlying search method and can be incorporated into other planning paradigms.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Path Planning on Hardware Lab Environment Turtlebot ROS2-humble](<https://www.sota2.com/research/sota/path-planning-on-hardware-lab-environment-turtlebot-ros2-humble.md>): Path planning; Hardware Lab Environment Turtlebot ROS2-humble; Path Length (m): 3.63.

- [Path Planning on Cluttered Env (Map 2)](<https://www.sota2.com/research/sota/path-planning-on-cluttered-env-map-2.md>): Path planning; Cluttered Env (Map 2); Clearance (cm): 18.53.

- [Path Planning on Sparse Env Map 1](<https://www.sota2.com/research/sota/path-planning-on-sparse-env-map-1.md>): Path planning; Sparse Env Map 1; Time (ms): 2878.66.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2505.24024>)

[PDF](<https://arxiv.org/pdf/2505.24024.pdf>)
