The Application of Oct-Tree Terrain Models to Real-Time Aircraft Flight Path Planning

2000 ◽  
Vol 53 (3) ◽  
pp. 483-498 ◽  
Author(s):  
D. J. Allerton ◽  
M. C. Gia
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Flight Path ◽  
Database Access ◽  
Tree Structures ◽  
Trade Off ◽  
Aircraft Flight ◽  
Terrain Models ◽  
Mission Management ◽  
Path Extraction

This paper outlines a technique to represent terrain using tree structures, based on Morton ordering to avoid the use of pointers. This approach enables terrain data to be organised in a hierarchical form affording a trade-off between the speed of access to the terrain database and resolution of the terrain data extracted from the tree. A set of database access algorithms is developed that form the basis of path extraction needed for real-time mission management. Several examples are presented to illustrate the performance of the routeing algorithms developed in the paper.

A Data-Driven Approach using Machine Learning to Enable Real-Time Flight Path Planning

2020 ◽  
Author(s):  
Jung-Hyun Kim ◽  
Simon I. Briceno ◽  
Cedric Y. Justin ◽  
Dimitri Mavris
Keyword(s):  
Machine Learning ◽  
Path Planning ◽  
Real Time ◽  
Flight Path ◽  
Data Driven ◽  
Data Driven Approach

Designated Points-based Free-Flight Approach to Enable Real-Time Flight Path Planning

2021 ◽  
Author(s):  
Jung-Hyun Kim ◽  
Simon I. Briceno ◽  
Cedric Y. Justin ◽  
Dimitri Mavris
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Flight Path ◽  
Free Flight

Optimal Flight Path Planning of Cruising Phase with No-Fly Zone Constraints Based on Dynamic Programming Algorithm

2012 ◽  
Vol 433-440 ◽  
pp. 5911-5917
Author(s):  
Su Xiao Wang ◽  
Yong Sheng Yang ◽  
Zhong Liang Jing
Keyword(s):  
Dynamic Programming ◽  
Path Planning ◽  
Real Time ◽  
Optimal Path ◽  
Dynamic Programming Algorithm ◽  
Optimization Method ◽  
Flight Path ◽  
Programming Algorithm ◽  
Effective Implementation ◽  
Arbitrary Selection

The purpose of flight path planning is to find the optimal path from the real-time and conflict-free airspace to meet the targets, according to one or several performance index. Effective avoiding the no-fly zones, such as the areas of martial movement and the areas of rain and thunderstorm, has great significance to the current flight management system (FMS) that is real-time and effective implementation of the flight plan. The dynamic optimization method of level route based on DP (Dynamic Programming) algorithm without no-fly zone constraints is discussed. Quick and effective to find out an optimal path from the waypoints of arbitrary selection and input can be realized. On this basis, the situation of adding no-fly zone constraints is focused on. In order to ensure that the aircraft is able to effectively avoid no-fly zone constraints in actual flight, Gauss Kruger projection method to convert geographic coordinates to plane coordinates is adopted. Simulation results show that the method used can not only effectively avoid no-fly zone constraints, and the path passed is still optimal.

scholarly journals An adaptive dual-optimal path-planning technique for unmanned air vehicles

2016 ◽  
Vol 7 ◽  
pp. A2 ◽  
Author(s):  
Clifford A. Whitfield
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Optimal Path ◽  
Flight Path ◽  
Flight Duration ◽  
Multi Objective ◽  
Optimal Path Planning ◽  
Area Of Interest ◽  
Conflicting Objectives ◽  
Planning Technique

A multi-objective technique for unmanned air vehicle path-planning generation through task allocation has been developed. The dual-optimal path-planning technique generates real-time adaptive flight paths based on available flight windows and environmental influenced objectives. The environmentally-influenced flight condition determines the aircraft optimal orientation within a downstream virtual window of possible vehicle destinations that is based on the vehicle’s kinematics. The intermittent results are then pursued by a dynamic optimization technique to determine the flight path. This path-planning technique is a multi-objective optimization procedure consisting of two goals that do not require additional information to combine the conflicting objectives into a single-objective. The technique was applied to solar-regenerative high altitude long endurance flight which can benefit significantly from an adaptive real-time path-planning technique. The objectives were to determine the minimum power required flight paths while maintaining maximum solar power for continual surveillance over an area of interest (AOI). The simulated path generation technique prolonged the flight duration over a sustained turn loiter flight path by approximately 2 months for a year of flight. The potential for prolonged solar powered flight was consistent for all latitude locations, including 2 months of available flight at 60° latitude, where sustained turn flight was no longer capable.

Sky Segmentation for Enhanced Depth Reconstruction and Bokeh Rendering with Efficient Architectures

2020 ◽  
Vol 2020 (14) ◽  
pp. 378-1-378-7
Author(s):  
Tyler Nuanes ◽  
Matt Elsey ◽  
Radek Grzeszczuk ◽  
John Paul Shen
Keyword(s):  
Real Time ◽  
Mobile Device ◽  
Computational Cost ◽  
False Positives ◽  
Compact Model ◽  
High Quality ◽  
False Negatives ◽  
Trade Off ◽  
Depth Reconstruction ◽  
Binary Classifiers

We present a high-quality sky segmentation model for depth refinement and investigate residual architecture performance to inform optimally shrinking the network. We describe a model that runs in near real-time on mobile device, present a new, highquality dataset, and detail a unique weighing to trade off false positives and false negatives in binary classifiers. We show how the optimizations improve bokeh rendering by correcting stereo depth misprediction in sky regions. We detail techniques used to preserve edges, reject false positives, and ensure generalization to the diversity of sky scenes. Finally, we present a compact model and compare performance of four popular residual architectures (ShuffleNet, MobileNetV2, Resnet-101, and Resnet-34-like) at constant computational cost.

scholarly journals Indoor Path-Planning Algorithm for UAV-Based Contact Inspection

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 642
Author(s):  
Luis Miguel González de Santos ◽  
Ernesto Frías Nores ◽  
Joaquín Martínez Sánchez ◽  
Higinio González Jorge
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Execution Time ◽  
Point Cloud ◽  
Indoor Environments ◽  
Calculation Algorithm ◽  
Time Restrictions ◽  
Planning Algorithm ◽  
Inspection Tasks ◽  
Path Planning Algorithm

Nowadays, unmanned aerial vehicles (UAVs) are extensively used for multiple purposes, such as infrastructure inspections or surveillance. This paper presents a real-time path planning algorithm in indoor environments designed to perform contact inspection tasks using UAVs. The only input used by this algorithm is the point cloud of the building where the UAV is going to navigate. The algorithm is divided into two main parts. The first one is the pre-processing algorithm that processes the point cloud, segmenting it into rooms and discretizing each room. The second part is the path planning algorithm that has to be executed in real time. In this way, all the computational load is in the first step, which is pre-processed, making the path calculation algorithm faster. The method has been tested in different buildings, measuring the execution time for different paths calculations. As can be seen in the results section, the developed algorithm is able to calculate a new path in 8–9 milliseconds. The developed algorithm fulfils the execution time restrictions, and it has proven to be reliable for route calculation.

Sign in / Sign up

Export Citation Format

Share Document