Abstract
Analytical and discrete optimization approaches for routing an aircraft in a threat environment have been developed. The model considers an aircraft’s trajectory in three dimensional (3D) space and presents the aircraft by a symmetrical ellipsoid with the axis of symmetry orienting the trajectory direction. The threat is associated with the risk of aircraft detection by radars, sensors or surface air missiles. Using the analytical and discrete optimization approaches, the deterministic problem of finding an aircraft’s optimal risk trajectory subject to a constraint on the trajectory length has efficiently been solved. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, the solution to this equation is expressed by a quadrature. The discrete optimization approach approximates the original problem by the Constrained Shortest Path Problem (CSPP) for a 3D network with a flexible structure. The CSPP has been solved for various ellipsoid shapes and different length constraints in the cases of several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as impact of variable RCS on performance of the discrete optimization approach have been analyzed and illustrated with several numerical examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Assaf and A. Sharlin-Bilitzky. Dynamic search for a moving target. Journal for Applied Probability, 31 (2): 438–457, 1994.
J. E. Beasley and N. Christofides. An algorithm for the resource constrained shortest path problem. Networks, 19: 379–394, 1989.
S. J. Benkoski, M. G. Monticino, and J. R. Weisinger. A survey of the search theory literature. Naval Research Logistics, 38 (4): 468–494, 1991.
R. H. Bishop, D. L. Mackison, R. D. Culp, and M. J. Evans. Spaceflight Mechanics 1999, volume 102 of Advances in the Astronautical Sciences. NUnivelt, Inc., 1999.
Y. K. Chan and M. Foddy. Real time optimal flight path generation by storage of massive data bases. In Proceedings of the IEEE NEACON 1985, pages 516–521, New York, 1985. Institute of Electrical and Electronics Engineers.
M. Desrochers and F. Soumis. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR, 26: 191–212, 1988.
I. Dumitrescu and N. Boland. Algorithms for the weight constrained shortest path problem. ITOR, 8: 15–29, 2001.
I. Dumitrescu and N. Boland. Improving preprocessing, labelling and scaling algorithms for the weight constrained shortest path problem. preprint, 2001.
J. N. Eagle and J. R. Yee. An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations research, 38 (1): 110–114, 1990.
G. Y. Handler and I. Zang. A dual algorithm for the constrained shortest path problem. Networks, 10: 293–309, 1980.
R. Hassin. Approximated schemes for the restricted shortest path problem. Mathematics of Operations Research, 17: 36–42, 1992.
B. O. Koopman. Search and Screening: general principles with historical applications. Pergamon Press, Elmsford, New York, 1980.
M. Mangel. Search Theory. Springer-Verlag, Berlin, 1984.
L. C. Polymenakos, D. P. Bertsekas, and J. N. Tsitsiklis. Implementation of effcient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control, 43 (2): 278–283, 1998.
A. Richards and J. P. How. Aircraft trajectory planning with collision avoidance using mixed integer linear programming. In IEEE 2002 ACC, pages 1936–1941, May 2002.
L. D. Stone. Theory of Optimal Search. Academic Press, New York, San Francisco, London, 1975.
L. C. Thomas and J. N. Eagle. Criteria and approximate methods for path-constrained moving-target search problems. Naval Research Logistics, 42: 27–38, 1995.
J. N. Tsitsiklis. Efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control, 40 (9): 1528–1538, 1995.
J. L. Vian and J. R. More. Trajectory optimization with risk minimization for military aircraft. AIAA, Journal of Guidance, Control and Dynamics, 12 (3): 311–317, 1989.
A. R. Washburn. Search for a moving target: The FAB algorithm. Operations Research, 31 (3): 739–751, 1983.
A. R. Washburn. Continuous autorouters, with an application to submarines. Research Report NPSOR-91–05, Naval Postgraduate School, Monterey, CA, 1990.
M. Zabarankin, S. Uryasev, and P. Pardalos. Optimal risk path algorithms. In R. Murphey and P. Pardalos, editors, Cooperative Control and Optimization, volume 66 of Applied Optimization, pages 271–303. Kluwer Academic Publishers, Dordrecht, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Murphey, R., Uryasev, S., Zabarankin, M. (2004). Optimal Path Planning in a Threat Environment. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds) Recent Developments in Cooperative Control and Optimization. Cooperative Systems, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0219-3_19
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0219-3_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7947-8
Online ISBN: 978-1-4613-0219-3
eBook Packages: Springer Book Archive