Advertisement

Optimal Risk Path Algorithms

  • Michael Zabarankin
  • Stanislav Uryasev
  • Panos Pardalos
Chapter
Part of the Applied Optimization book series (APOP, volume 66)

Abstract

Analytical and discrete optimization approaches for routing an aircraft in a threat environment have been developed. Using these approaches, an aircraft’s optimal risk trajectory with a constraint on the path length can be efficiently calculated. The analytical approach based on calculus of variations reduces the original risk optimization problem to the system of nonlinear differential equations. In the case of a single radarinstallation, the solution of such a system is expressed by the elliptic sine. The discrete optimization approach reformulates the problem as the Weight Constrained Shortest Path Problem (WCSPP) for a grid undirected graph. The WCSPP is efficiently solved by the Modified Label Setting Algorithm (MLSA). Both approaches have been tested with several numerical examples. Discrete nonsmooth solutions with high precision coincide with exact continuous solutions. For the same graph, time in which the discrete optimization algorithm computes the optimal trajectory is independent of the number of radars. The discrete approach is also efficient for solving the problem using different risk functions.

Keywords

optimal risk path length constraint system of nonlinear differential equations analytical solution discrete optimization approach network flow algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Assaf, D. and Sharlin-Bilitzky, A. (1994). Dynamic Search for a Moving Target. Journal for Applied Probability, Vol. 31, No. 2, pp.438–457.MathSciNetzbMATHGoogle Scholar
  2. [2]
    Aziz, A. K. (1975). Numerical Solution of Boundary Value Problems for Ordinary Differential Equations. New York: Academic Press.Google Scholar
  3. [3]
    Bateman, H. and Erdelyi, A. (1955). Higher Transcendental functions. Vol. 3, Mc Graw-Hill Book Company, Inc.Google Scholar
  4. [4]
    Beasley, J.E. and Christofides, N. (1989). An Algorithm for the Resource Constrained Shortest Path Problem. Networks 19, pp. 379–394.MathSciNetzbMATHGoogle Scholar
  5. [5]
    Benkoski, S.J., Monticino, M.G. and Weisinger J.R. (1991). A Survey of the Search Theory Literature. Naval Research Logistics, Vol.38, No. 4, pp. 468–494.Google Scholar
  6. [6]
    Chan, Y.K. and Foddy, M. (1985). Real Time Optimal Flight Path Generation by Storage of Massive Data Bases. Proceedings of the IEEE NEACON 1985, Institute of Electrical and Electronics Engineers, New York, pp. 516–521.Google Scholar
  7. [7]
    Dumitrescu, I. and Boland, N. (2001). Algorithms for the Weight Constrained Shortest Path Problem. ITOR, Vol. 8, pp. 15–29.MathSciNetzbMATHGoogle Scholar
  8. [8]
    Dumitrescu, I. and Boland, N. (2001). Improving Preprocessing, Labelling and Scaling Algorithms for the Weight Constrained Shortest Path Problem. Submitted for publication to Networks.Google Scholar
  9. [9]
    Desrochers, M. and Soumis, F. (1988). A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with Time Windows. INFOR 26, pp. 191–212.zbMATHGoogle Scholar
  10. [10]
    Eagle, J.N. and Yee, J.R. (1990). An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem. Operations research, Vol. 38, No. 1, pp. 110–114.MathSciNetzbMATHGoogle Scholar
  11. [11]
    Elsgohs, L.E. (1961). Calculus of Variations. Franklin Book Company, Inc.Google Scholar
  12. [12]
    Gelfand, I.M., Richard A. Silverman, Fomin, S.V. (2000). Calculus of Variations. Dover Publications, Inc.Google Scholar
  13. [13]
    Handler, G.Y. and Zang, I. (1980). A Dual Algorithm for the Constrained Shortest Path Problem. Networks 10, pp. 293–309.MathSciNetGoogle Scholar
  14. [14]
    Hassin, R. (1992). Approximated Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research 17, pp. 36–42.MathSciNetzbMATHCrossRefGoogle Scholar
  15. [15]
    Ince, E.L. and Sneddon, I.N. (1987). The Solution of Ordinary Differential Equations. Halsted Press.Google Scholar
  16. [16]
    Koopman, B.O. (1980). Search and Screening: general principles with historical applications. NY: Elmsford, Pergamon Press.zbMATHGoogle Scholar
  17. [17]
    Mangel, M. (1984). Search Theory. Lecture Notes. Berlin: Springer-Verlag.Google Scholar
  18. [18]
    Skolnik, M.I. (1990). Radar Handbook, 2nd ed. New York: McGraw-Hill Book Company, Inc.Google Scholar
  19. [19]
    Stone, L.D. (1975). Theory of Optimal Search. New York, San Francisco, London: Academic Press.zbMATHGoogle Scholar
  20. [20]
    Thomas, L.C. and Eagle, J.N. (1995). Criteria and Approximate Methods for Path-Constrained Moving-Target Search Problems. Naval Research Logistics, Vol. 42, pp. 27–38.MathSciNetzbMATHGoogle Scholar
  21. [21]
    Vian, J.L. and More, J.R. (1989). Trajectory Optimization with Risk Minimization for Military Aircraft. AIAA, J. of Guidance, Control and Dynamics, Vol. 12, No. 3, pp. 311–317.Google Scholar
  22. [22]
    Washburn, A.R. (1983). Search for a Moving Target: The FAB Algorithm. Operations Research, Vol. 31, pp. 739–751.zbMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Michael Zabarankin
    • 1
  • Stanislav Uryasev
    • 1
  • Panos Pardalos
    • 1
  1. 1.Center for Applied Optimization, Dept. of Industrial and Systems EngineeringUniversity of FloridaUSA

Personalised recommendations