Related Experiment Video
Updated: Jan 31, 2026

TMS: Using the Theta-Burst Protocol to Explore Mechanism of Plasticity in Individuals with Fragile X Syndrome and Autism
Published on: December 28, 2010
Efficient Lazy Theta* Path Planning over a Sparse Grid to Explore Large 3D Volumes with a Multirotor UAV
Margarida Faria1, Ricardo Marín2, Marija Popović3
1Center for Advanced Aerospace Technologies, Calle Wilbur y Orville Wright, 19, 41300 La Rinconada, Sevilla, Spain. mfaria@catec.aero.
This study enhances Unmanned Aerial Vehicle (UAV) path planning for large, unknown environments. The improved Lazy Theta* algorithm significantly reduces computation time for real-time outdoor navigation and inspection tasks.
Area of Science:
- Robotics
- Artificial Intelligence
- Autonomous Systems
Background:
- Unmanned Aerial Vehicles (UAVs) are crucial for inspecting large structures but face challenges in unknown, unstructured environments.
- Real-time path planning for UAVs in 3D scenarios is computationally intensive, especially with safety distance constraints.
- Existing algorithms struggle with the high number of obstacle detection queries in dynamic, unknown environments.
Purpose of the Study:
- To adapt the Lazy Theta* path-planning algorithm for efficient, real-time outdoor navigation of UAVs in large, unknown 3D environments.
- To address the computational bottleneck caused by safety distance requirements in obstacle detection.
- To improve the performance and scalability of UAV path planning.
Main Methods:
- Revisiting and adapting the Lazy Theta* path-planning algorithm for real-time outdoor applications.
- Reducing problem dimensionality by leveraging geometrical properties to accelerate computations.
- Implementing a non-regular grid representation (octree) for efficient spatial organization and merging of environmental data.
- Optimizing neighbor search within the sparse octree structure to minimize obstacle detection queries.
- Utilizing Test-Driven Development (TDD) methodology for algorithm development.
Main Results:
- Achieved over a 90% reduction in overall path generation computation time.
- Demonstrated effective real-time path planning capabilities in outdoor flights with a multirotor UAV.
- Validated that the approach scales well with increasing safety distance requirements.
- Confirmed the efficiency of the octree-based spatial representation and reduced neighbor queries.
Conclusions:
- The adapted Lazy Theta* algorithm offers a significant performance improvement for UAV path planning in large, unknown 3D environments.
- The use of geometrical properties and an octree-based grid representation effectively tackles computational bottlenecks.
- This enhanced path-planning approach enables safer, more efficient real-time navigation and inspection by UAVs, even with larger safety margins.
Related Concept Videos
Mean free path and Mean free time
Path Between Thermodynamics States
Interference: Path Lengths
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
Behavior of Gas Molecules: Molecular Diffusion, Mean Free Path, and Effusion
Sampling Plans
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
Planning Nursing Care I

