Gnomonic Projection Application in Solving the Problems of Flight Route Optimization and Processing the Terrain Elevation Matrix in the Flying Vehicle On-Board Computers
Authors: Puchkov L.D., Zerkalenkov D.A. | Published: 01.07.2025 |
Published in issue: #2(151)/2025 | |
DOI: | |
Category: Informatics, Computer Engineering and Control | Chapter: System Analysis, Control, and Information Processing | |
Keywords: route optimization, bypassing forbidden zones, terrain elevation matrix processing, gnomonic projection, orthodromy |
Abstract
The paper proposes an approach that allows accounting for the Earth sphericity in solving the problems of optimizing the flight route of an aerial vehicle and processing the terrain elevation matrix using the initial information presentation in the gnomonic projection. The use of the gnomonic projection main property, i.e., representation of the orthodromies in the form of straight lines, makes it possible to apply the generally accepted algorithms and approaches in route optimization and solve these problems with limited computation capabilities of the aerial vehicle onboard computers. For example, the graph theory methods widely used in solving the similar problems on a plane could be applied. The need to take into account the Earth sphericity in the route optimization algorithms is caused primarily by features of the aerial vehicle trajectory control (namely, flight along the orthodromy) between the route turning points. The paper presents algorithms and dependencies that allow processing the initial information (including the terrain elevation matrix) on the gnomonic projection. They include formulas to solving the direct and inverse geodetic problem, simplified (from the point of view of computation resources) dependency to determine the distance between two points in the projection, and solutions to select cells belonging to the given polygon or circle. To demonstrate the use of the obtained dependencies in solving a practical problem of determining the shortest path between two points on the Earth’s surface with bypassing the forbidden zones (formed by analyzing the terrain elevation matrix in the area under consideration), an example of its solution using the graph theory methods (Dijkstra’s algorithm) is considered
Please cite this article in English as:
Puchkov L.D., Zerkalenkov D.A. Gnomonic projection application in solving the problems of flight route optimization and processing the terrain elevation matrix in the flying vehicle on-board computers. Herald of the Bauman Moscow State Technical University, Series Instrument Engineering, 2025, no. 2 (151), pp. 102--121 (in Russ.). EDN: TPXVEA
References
[1] Zhang R., Ji T., Zheng H. Application of improved Dijkstra algorithm in two-dimensional path planning problem. ICIIP’19, 2019, pp. 211--215. DOI: https://doi.org/10.1145/3378065.3378106
[2] Yibin P., Green P.N. 3D digital grid map initialization and path planning for auto-nomous robot navigation. ICSRT 2019, 2019, pp. 68--74. DOI: https://doi.org/10.1145/3325693.3325706
[3] LaValle S.M. Planning algorithms. Cambridge, Cambridge University Press, 2006.
[4] Rospotniuk V.R. Optimal any-angle pathfinding on a sphere. J. Artif. Intell. Research, 2021, vol. 72, pp. 475--505. DOI: https://doi.org/10.1613/jair.1.12483
[5] Cao X., Xiao Z., Yang P., et al. Joint search method for UAV multiobjective path planning in urban low altitude environment. Патент US 10706729. Заявл. 18.04.2018, опубл. 07.07.2020.
[6] Ravenscroft D.L. Computing flight plans for UAVs while routing around obstacles having spatial and temporal dimensions. Патент US 20090210109. Заявл. 14.01.2008, опубл. 20.08.2009.
[7] Leonard J.V., Menzel R.K., Meyer R.E., et al. A method for in-flight/real-time planning of a mission for a precision-guided missile. Патент GB 2382865. Заявл. 02.01.2001, опубл. 11.06.2003.
[8] Skullestad A.J., Straume T., Lowe K., et al. Method and system for planning and launching a plurality of missiles to be included in the same mission. Патент EP 3130877. Заявл. 18.07.2016, опубл. 15.02.2017.
[9] Ivenin B.I., Testova T.M. [Construction of operational algorithms for optimizing the spatial and temporal schedule of flight of strike aircraft systems in the field of potential threats]. Navigatsiya, navedenie i upravlenie letatelnymi apparatami. Tez. dokl. Chetvertoy Vserossiyskoy nauch.-tekh. konf. T. 1 [Navigation, Guidance and Control of Aircraft. Abs. 4th Russ. Sc.-Tech. Conf. Vol. 1]. Moscow, GosNIIAS Publ., 2019, pp. 311--312 (in Russ.). EDN: TJFPJR
[10] Xiang A., Wang L. Research on path planning of UAV forest fire fighting based on improved ant colony algorithm. ICCAI’21, 2021, pp. 289--295. DOI: https://doi.org/10.1145/3467707.3467751
[11] Hirt J., Gauggel D., Hensler J., et al. Using quadtrees for realtime pathfinding in indoor environments. In: Communications in Computer and Information Science. Berlin, Heidelberg, Springer, 2010, vol. 156, pp. 72--78. DOI: https://doi.org/10.1007/978-3-642-27272-1_6
[12] Xin Z., Rongwu X., Guo C. AUV path planning in dynamic environment based on improved artificial potential field method based on visibility graph. J. Phys.: Conf. Ser., 2022, vol. 2383, art. 012090. DOI: https://doi.org/10.1088/1742-6596/2383/1/012090
[13] Gindy H., Avis D. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 1981, vol. 2, no. 2, pp. 186--197. DOI: https://doi.org/10.1016/0196-6774(81)90019-5
[14] Lee D.T. Visibility of a simple polygon. Comput. Vis., Graph. Im. Proc., 1983, vol. 22, no. 2, pp. 207--221. DOI: https://doi.org/10.1016/0734-189X(83)90065-8
[15] Barry J., Simpson R.B. Corrections to Lee’s visibility polygon algorithm. BIT, 1987, vol. 27, no. 4, pp. 458--473. DOI: https://doi.org/10.1007/BF01937271
[16] Dzhandzhgava G.I., ed. Navigatsiya letatelnykh apparatov v okolozemnom prostranstve [Navigation of aircraft in near-Earth space]. Moscow, NAUCHTEKHLITIZDAT Publ., 2015.
[17] Snyder J.P. Map projections --- a working manual. Washington, U.S. Geological Survey, 1987, pp. 38--75. DOI: https://doi.org/10.3133/pp1395
[18] Walczyk C.J., Moroz L.V., Cieslinski J.L. Improving the accuracy of the fast inverse square root by modifying Newton --- Raphson Corrections. Entropy, 2021, vol. 23, no. 1, art. 86. DOI: https://doi.org/10.3390/e23010086
[19] Rogers D.F. Procedural elements for computer graphics. New York, McGraw-Hill, 1984.
[20] Gupta S., Kar S. Algorithms to speed up contour tracing in real time image processing systems. IEEE Access, 2022, vol. 10, pp. 127365--127376. DOI: https://doi.org/10.1109/ACCESS.2022.3226943