Abstract A glider flight strategy design problem can be effectively solved within the framework of optimal control. Optimality relates to glider characteristics and environmental conditions. One is often interested in determining an initial glider altitude position guaranteeing that a required destination point is achievable. Another way of posing such a control problem is linked with a maximal glider range resulting from given initial and environmental conditions. In fact, in practical applications, trying to determine a best flying strategy with the use of optimal approaches, we are usually faced with the problem of a large degree of freedom, which makes the classical analytical and numerical optimization methods ineffective. In this paper we introduce a simple method utilizing a search graph algorithm for the purpose of finding an optimal flight trajectory. We discuss the characteristics of this approach and present results of optimization performed for a glider manufactured by the PZL Swidnik.
[1]
Robert E. Tarjan,et al.
Fibonacci heaps and their uses in improved network optimization algorithms
,
1984,
JACM.
[2]
Steven Skiena,et al.
The Algorithm Design Manual
,
2020,
Texts in Computer Science.
[3]
Robert E. Tarjan,et al.
Fibonacci heaps and their uses in improved network optimization algorithms
,
1987,
JACM.
[4]
Dimitri P. Bertsekas,et al.
Nonlinear Programming
,
1997
.
[5]
Uri M. Ascher,et al.
Computer methods for ordinary differential equations and differential-algebraic equations
,
1998
.
[6]
Zdzislaw Kowalczuk,et al.
Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
,
2008,
Int. J. Appl. Math. Comput. Sci..
[7]
Dimitri P. Bertsekas,et al.
Dynamic Programming and Optimal Control, Two Volume Set
,
1995
.