Two-step procedure of optimisation for flight planning problem for airborne LiDAR data acquisition (Q462653)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6359397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-step procedure of optimisation for flight planning problem for airborne LiDAR data acquisition |
scientific article; zbMATH DE number 6359397 |
Statements
Two-step procedure of optimisation for flight planning problem for airborne LiDAR data acquisition (English)
0 references
21 October 2014
0 references
Summary: Flight planning for airborne LiDAR data collection determines flight parameters, which in turn control the flight duration. While the former ensures desired quality of captured data the cost of the project is directly affected by the latter. This paper attempts to optimize flight planning problem. The flight duration is expressed as an objective function and the associated data requirements, preferences and limitations of flight planning problem are considered as constraints. Due to the typical characteristics of flight duration and flight parameters, a two-step procedure of optimization that consists of Genetic Algorithms (GA) and Hooke and Jeeve's (HJ) method of optimization are adopted. The two-step procedure alleviates the pitfalls of both GA and HJ method and successfully determines the optimal flight planning parameters for a fairly complicated problem. Results obtained in this paper demonstrate that the proposed two-step procedure can be used for solving complex engineering problems like flight planning.
0 references
two-step procedure
0 references
optimization
0 references
flight planning
0 references
airborne LiDAR
0 references
aerial data acquisition
0 references
genetic algorithms
0 references
simulation
0 references
0.6769402623176575
0 references
0.6656594276428223
0 references
0.6587983965873718
0 references
0.657479465007782
0 references
0.6517533659934998
0 references