Hang Glider: Range Maximization the Problem Is to Compute the flight Inputs to a Hang Glider So As to Provide a Maximum Range flight

Hang Glider: Range Maximization the Problem Is to Compute the flight Inputs to a Hang Glider So As to Provide a Maximum Range flight

Hang Glider: Range Maximization The problem is to compute the flight inputs to a hang glider so as to provide a maximum range flight. This problem first appears in [1]. The hang glider has weight W (glider plus pilot), a lift force L acting perpendicular to its velocity vr relative to the air, and a drag force D acting in a direction opposite to vr. Denote by x the horizontal position of the glider, by vx the horizontal component of the absolute velocity, by y the vertical position, and by vy the vertical component of absolute velocity. The airmass is not static: there is a thermal just 250 meters ahead. The profile of the thermal is given by the following upward wind velocity: 2 2 − x −2.5 x u (x) = u e ( R ) 1 − − 2.5 . a m R We take R = 100 m and um = 2.5 m/s. Note, MKS units are used through- out. The upwind profile is shown in Figure 1. Letting η denote the angle between vr and the horizontal plane, we have the following equations of motion: 1 x˙ = vx, v˙x = m (−L sin η − D cos η), 1 y˙ = vy, v˙y = m (L cos η − D sin η − W ) with q vy − ua(x) 2 2 η = arctan , vr = vx + (vy − ua(x)) , vx 1 1 L = c ρSv2,D = c (c )ρSv2,W = mg. 2 L r 2 D L r The glider is controlled by the lift coefficient cL. The drag coefficient is assumed to depend on the lift coefficient as 2 cD(cL) = c0 + kcL where c0 = 0.034 and k = 0.069662. In addition, there is an upper limit on the lift coefficient: cL ≤ cL max := 1.4. Other constants are: m = 100 mass of glider and pilot S = 14 wing area ρ = 1.13 air density g = 9.81 acc due to gravity. 1 2 2.5 2.5*exp(-(x/100-2.5)**2)*(1-(x/100-2.5)**2) 2 1.5 1 0.5 0 -0.5 0 100 200 300 400 500 600 FIGURE 1. Updraft profile The boundary conditions are: x(0) = 0, y(0) = 1000, y(T ) = 900, vx(0) = 13.23, vx(T ) = 13.23, vy(0) = −1.288, vy(T ) = −1.288. The total time T for the flight is, of course, a variable. The objective is to maximize x(T ). The optimal solution depicted in Figures 2–7 was obtained using a uni- form discretization of the time domain into 150 discrete points. Derivatives were approximated by differences at the midpoints of each discrete time interval. The optimal range is 1248.26 m and takes 98.4665 s to fly. REFERENCES [1] Bulirsch, R., Nerz, E., Pesch, H. & von Stryk, O. (1993), Combining direct and indirect methods in optimal control: Range maximization of a hang glider, in R. Bulirsch, A. Miele, J. Stoer & K. Well, eds, ‘”Optimal Control: Calculus of Variations, Optimal Control Theory and Numerical Methods’, Birkhauser Verlag, Basel, Boston, Berlin, pp. 273–288. 1 3 1000 1.4 "y_vs_x" "cL_vs_t" 1.3 980 1.2 1.1 960 1 940 0.9 0.8 920 0.7 900 0.6 0 200 400 600 800 1000 1200 1400 0 10 20 30 40 50 60 70 80 90 100 FIGURE 2. y vs x FIGURE 5. cL vs t 1400 1000 "x_vs_t" "y_vs_t" 1200 980 1000 960 800 600 940 400 920 200 0 900 0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 80 90 100 FIGURE 3. x vs t FIGURE 6. y vs t 14 2 "vx_vs_t" "vy_vs_t" 13.5 1.5 13 1 12.5 0.5 12 0 11.5 -0.5 11 10.5 -1 10 -1.5 9.5 -2 9 -2.5 0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 80 90 100 FIGURE 4. vx vs t FIGURE 7. vy vs t.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    3 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us