On linearization of perturbed motion model in the problem of ballistic trajectories scattering probabilistic analysis

System analysis, control and data processing


Аuthors

Vasil’eva S. N.*, Kan Y. S.**

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

*e-mail: sofia_mai@mail.ru
**e-mail: yu_kan@mail.ru

Abstract

The article considers the probabilistic analysis problem of ballistic impacts scattering at spherical Earth surface. The starting point of the trajectory is also located on the earth’s surface. Trajectories scattering is caused by a random perturbation of the initial velocity vector. The circular probable deviation is employed as a scattering characteristic. It represents the circle radius length, the probability of hitting which equals to 1/2, i.e. it concurs with quantile of 1/2 level for the norm of a random vector, characterizing the trajectory impact deflection from the nominal one. These vector components are computed using the equations of Keplerian theory of elliptic motion in the central gravitational field. They depend nonlinearly on the velocity perturbation vector. In this respect, the analytical obtaining of the quantile from the norm of this vector is impossible.

The velocity perturbations are assumed to be small compared to its nominal absolute value. The vector of small random parameters of velocity perturbation is modeled as an componentwise product of a small deterministic parameter and a vector of random parameters. It is assumed that the random parameters vector has a standard normal distribution with independent components. The article suggests the linearization method consisting in approximation of the above said non-linear dependence by the linear model, which is obtained by deviation vector Tailor expansion along the velocity perturbation vector. It is being proved, that the error occurring while such substitution is of the order of a small deterministic parameter.

As a model example, The authors consider the flight of a material point to a specified distance at the known values of nominal initial velocity, departure angle and azimuth. The computation results of the circular probable error by the Monte Carlo and linearization methods for a wide range of initial values are presented. Calculations of linearization method relative error compared to Monte Carlo method are also given. This error does not exceed 1.5%, which was confirmed by theoretical accuracy estimates of the linearization method, proposed in the article.

Keywords:

linearization method, probabilistic analysis, circular probable deviation, ballistic trajectories scattering

References

  1. Sergeev I.D., Yakovlev V.N., Solovtsov N.E. et al. Voennyi entsiklopedicheskii slovar’ Raketnykh voisk strategicheskogo naznacheniya (Military encyclopedic dictionary of strategic rocket forces), Moscow, Bol’shaya Rossiiskaya entsiklopediya, 1998, 634 p.

  2. Vasil’eva S.N., Kan Yu.S. Avtomatika i telemekhanika, 2017, no. 7, pp. 95 – 109.

  3. Alfer’ev V.L. Dvoinye tekhnologii, 2011, no. 4(57), pp. 14 – 21.

  4. Kan Yu.S., Travin A.A. Avtomatika i telemekhanika, 2013, no. 6, pp. 57 – 65.

  5. Goncharenko V.I., Kan Yu.S., Travin A.A. Trudy MAI, 2012, no. 61, available at: http://trudymai.ru/eng/published.php?ID=35615

  6. Kibzun A.I., Kan Yu.S. Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami (Stochastic programming problems with probabilistic criteria), Moscow, Fizmatlit, 2009, 372 p.

  7. Kogan A., Lejeune M.A. Threshold boolean form for joint probabilistic constraints with random technology matrix, Mathematical Programming, 2014, no. 147, pp. 391 – 427.

  8. Kogan A., Lejeune M.A., Luedtke J. Erratum to: Threshold boolean form for joint probabilistic constraints with random technology matrix, Mathematical Programming, 2016, no. 155(1), pp. 617 – 620.

  9. Guigues V., Juditsky A. Nemirovski ,A. Non-asymptotic condence bounds for the optimal value of a stochastic program, Methods & Software, 2017, no. 32(5), pp. 1033 – 1058.

  10. Barrera J., Homem-de-Mello T., Moreno E., Pagnoncelli B.K. Canessa G. Chance-constrained problems and rare events: an importance sampling approach, Mathematical Programming. Ser. B, 2016, no. 157, pp. 153 – 189.

  11. Guigues V. Henrion R. Joint dynamic probabilistic constraints with projected linear decision rules, Optimization Methods & Software, 2017, no. 32(5), pp. 1006 – 1032.

  12. Bremer I., Henrion R., Möller A. Probabilistic constraints via SQP solver: Application to a renewable energy management problem, Computational Management Science, 2015, no. 12, pp. 435 – 459.

  13. Luedtke J. A branch-and-cut decomposition algorithm for solving chanceconstrained mathematical programs with finite support, Mathematical Programming, 2014, no. 146 (1-2), pp. 219 – 244.

  14. Minoux M., Zorgati R. Convexity of Gaussian chance constraints and of related probability maximization problems, Computational Statistics, 2016, no. 31(1), pp. 387 – 408.

  15. Wim van Ackooij. Eventual convexity of chance constrained feasible sets. Optimization. A Journal of Mathematical Programming and Operations Research, 2015, no. 64(5), pp. 1263 – 1284.

  16. Wim van Ackooij, R. Henrion. (Sub-) Gradient formulae for probability functions of random inequality systems under Gaussian distribution, SIAM Journal on Uncertainty Quantification, 2017, no. 5(1), pp. 63 – 87.

  17. Wim. van Ackooij, Sagastizábal C. Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems, SIAM Journal on Optimization, 2014, no. 24(2), pp. 733 – 765.

  18. Xie W., Ahmed S. On quantile cuts and their closure for chance constrained optimization problems, Mathematical Programming, 2017, ser. B, pp. 1 – 26.

  19. Goncharenko V.I., Kobzar’ A.A., Kucheryavenko D.S. Trudy MAI, 2011, no. 46, available at: http://trudymai.ru/eng/published.php?ID=25995

  20. Pogorelov D.A. Teoriya keplerovykh dvizhenii letatel’nykh apparatov (Theory of Kepler movements of aircraft), Moscow, Fizmatgiz, 1961, 106 p.


Download

mai.ru — informational site MAI

Copyright © 2000-2021 by MAI

Вход