Abstract
The sharp increase in air traffic flow causes traffic congestion in airspaces near airports, called Terminal Maneuvering Areas (TMA). The departure and arrival traffic of airports follow predesigned routes named standard instrument departure (SID) routes and standard terminal arrival routes (STAR). Optimizing these routes is crucial to regulate air traffic. Currently, SIDs and STARs are designed manually, based on the airport layout and nearby constraints. The objective of this research is to propose a methodology for designing an arrival/departure route in TMA, taking into account some constraints including obstacle avoidance. The shape of a route in horizontal plan is a succession of arcs of circles and segments. The originality of our study is, on the one hand, that the horizontal route is associated with a cone in vertical plan enveloping all ascent (or descent) aircraft profiles, and on the other hand, a branching strategy in a branch and bound (B&B) framework tailored on the problem is proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Delahaye, D., Puechmorel, S., Tsiotras, P., Feron, E.: Mathematical models for aircraft trajectory design: A survey. Air Traffic Management and Systems Lectures Notes in Electrical Engineering. 290, 205–247 (2014)
Eele, A., Richards, A.: Path planning with avoidance using nonlinear branch and bound optimization. J. Guid. Control. Dynam. 32, 384–394 (2009)
Gallina, P., Gasparetto, A.: A technique to analytically formulate and to solve the 2-dimensional constrained trajectory planning problem for a mobile robot. J. Intell. Robotics Syst. 27, 237–262 (2000)
Kim, D.S., Yu, K., Cho, Y., Kim, D., Yap, C.: Shortest paths for disc obstacles. Lect. Notes Comput. Sci. 3045, 62–70 (2004)
Lozano-Pérez, T., Wesley, M.A.: An algorithm for planning collison-free paths among polyhedral obstacles. Commun. ACM. 22, 560–570 (1979)
Pfeil, D.M.: Optimization of airport terminal-area air traffic operations under uncertain weather conditions. PhD thesis, Massachusetts Institute of Technology, 2011
Pocchiola, M., Vegter, G.: Minimal tangent visibility graphs. Comput. Geom. Theory Appl. 6, 303–314 (1996)
Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles. Inf. Process. Lett. 23, 71–76 (1986)
Souissi, O. et al.: Path planning: A 2013 survey. In: Proceedings of the 2013 International Conference on Industrial Engineering and Systems Management, pp. 1–8. Rabat (2013)
Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. J. ACM. 41, 982–1012 (1994)
Acknowledgements
This work has been partially supported by Civil Aviation University of China, by National Natural Science Foundation of China (NNSFC) through grant NNSFC 61201085, and by French National Research Agency (ANR) through grant ANR 12-JS02-009-01 ATOMIC. The authors would like to thank Serge Roux from the French Civil Aviation University (ENAC), for the interesting discussions and useful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Japan KK
About this chapter
Cite this chapter
Zhou, J., Cafieri, S., Delahaye, D., Sbihi, M. (2017). Optimizing the Design of a Route in Terminal Maneuvering Area Using Branch and Bound. In: Electronic Navigation Research Institute (eds) Air Traffic Management and Systems II. Lecture Notes in Electrical Engineering, vol 420. Springer, Tokyo. https://doi.org/10.1007/978-4-431-56423-2_9
Download citation
DOI: https://doi.org/10.1007/978-4-431-56423-2_9
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-56421-8
Online ISBN: 978-4-431-56423-2
eBook Packages: EngineeringEngineering (R0)