Error Bounds for Discrete-Continuous Free Flight Trajectory Optimization
-
Published:2023-07-09
Issue:2
Volume:198
Page:830-856
-
ISSN:0022-3239
-
Container-title:Journal of Optimization Theory and Applications
-
language:en
-
Short-container-title:J Optim Theory Appl
Author:
Borndörfer RalfORCID, Danecker FabianORCID, Weiser MartinORCID
Abstract
AbstractTwo-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced by restricting the discrete global optimization to the graph, with corresponding implications on choosing an appropriate graph density. A prime example is flight planning, i.e., the computation of optimal routes in view of flight time and fuel consumption under given weather conditions. Highly efficient discrete shortest path algorithms exist and can be used directly for computing starting points for locally convergent optimal control methods. We derive a priori and localized error bounds for the flight time of discrete paths relative to the optimal continuous trajectory, in terms of the graph density and the given wind field. These bounds allow designing graphs with an optimal local connectivity structure. The properties of the bounds are illustrated on a set of benchmark problems. It turns out that localization improves the error bound by four orders of magnitude, but still leaves ample opportunities for tighter error bounds by a posteriori estimators.
Funder
Zuse-Institut Berlin
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference24 articles.
1. Atkinson, K.E., Han, W.: Theoretical Numerical Analysis: A Functional Analysis Framework, vol. 39, 3rd edn. Springer, New York (2009). https://doi.org/10.1007/978-1-4419-0458-4 2. Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1–131 (2013). https://doi.org/10.1017/S0962492913000032 3. Betts, J., Cramer, E.: Application of direct transcription to commercial aircraft trajectory optimization. J. Guid. Control Dyn. 18(1), 151–159 (1995). https://doi.org/10.2514/3.56670 4. Blanco, M., Borndörfer, R., Hoàng, N.D., Kaier, A., Casas, P.M., Schlechte, T., Schlobach, S.: Cost projection methods for the shortest path problem with crossing costs. In: D’Angelo, G., Dollevoet, T. (eds.) 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), OpenAccess Series in Informatics (OASIcs), vol. 59, pp. 15:1–15:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https://doi.org/10.4230/OASIcs.ATMOS.2017.15 5. Blanco, M., Borndörfer, R., Hoàng, N.D., Kaier, A., Schienle, A., Schlechte, T., Schlobach, S.: Solving time dependent shortest path problems on airway networks using super-optimal wind. In: Goerigk, M., Werneck, R. (eds.) 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), OpenAccess Series in Informatics (OASIcs), vol. 54, pp. 12:1–12:15. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). https://doi.org/10.4230/OASIcs.ATMOS.2016.12
|
|