Coordination of En Route Air Traffic Conflicts Resolution Modelling Methods
**** Hidden Message ***** <P>Survey of Coordination of En Route Air Traffic <BR>Conflicts Resolution Modelling Methods </P><P>Huy-Ho<BR>Abstract— The en-route conflict resolution remains a major concern for Air Traffic Management (ATM), especially in core European airspace where the current Air Traffic Control (ATC) system is approaching its capacity limits. In this paper we discuss the emphasis of the coordination of conflict resolution actions. Indeed, coordination of conflict resolution is required to reach a global solution for clusters involving many aircraft. A number of such models have already been proposed and some of them applied in practice, but there has been no cohesive discussion or comparative evaluation of these approaches. This paper presents a summary of coordination of conflict resolution approaches. <BR>Index Terms— conflict detection and resolution, coordination of conflict resolution. <BR>I. INTRODUCTION <BR>he purpose of Air Traffic Management (ATM) is to enable Tairspace users to meet their schedules according to their <BR>preferred flight profiles without compromising safety levels. <BR>To provide safe and efficient aircraft movements, the current <BR>approach comprises two main activities: Air Traffic Control <BR>(ATC) and Air Traffic Flow Management (ATFM). Both ATC <BR>and ATFM are ground based services. The ATC provides <BR>tactical, safe separation between aircraft and between aircraft <BR>and obstacles. The main goal of ATC is to guarantee security <BR>and to give aircraft optimal trajectories to fly from one airport <BR>to an other. The Air Traffic Flow Management deals with the <BR>allocation of scarce capacity resources such as routes and <BR>terminal operations time slots. In the USA, airport capacity is the main problem. This <BR>problem exists also in Europe on the biggest airport. But in <BR>Europe, and mainly in France, En Route capacity is the critical <BR>point. There is also a problem linked with controller workload <BR>such as monitoring workload (the monitoring of the aircraft in <BR>the controller’s sector), resolution workload (the resolution of <BR>conflict) and coordination workload (a task that each <BR>controller must perform when a aircraft enters or leaves its <BR>sector). Thereby, the tools for air traffic control system, in <BR>particular, for conflict management as well as for ground-<BR>based Collaborative Decision Making (CDM) are necessary to <BR>optimize conflict resolution solutions. In other words, it aims <BR>at increasing capacity of controller. <BR>Huy-Hoang Nguyen is with the Heudiasyc Laboratory, UMR CNRS 6599, <BR>University of Technology of Compiègne, Centre de Recherches de Royallieu, <BR>BP 20 529, F-60205 Compiègne cedex, France and EUROCONTROL <BR>Experimental Centre, Centre de Bois des Bordes, BP15, F-91222 Brétigny sur <BR>Orge cedex, France. (e-mail: huy-hoang.nguyen@eurocontrol.int). <BR>ang Nguy en <BR>Additionally, the steady growth of traffic in core European <BR>airspace could lead to complex situations where separation <BR>standards may be infringed by several aircraft in a transitive <BR>configuration, called clusters of potential conflicts. It is <BR>necessary to treat large cluster of conflicts without inducing <BR>too much the costs of maneuvering to aircraft. Costs typically <BR>include fuel and time. Consequently, solutions to large cluster <BR>of potential conflicts are needed. Accordingly, coordination of <BR>conflict resolution is required to reach a global solution for <BR>clusters involving many aircraft. <BR>This paper provides a summary and evaluation of the <BR>approaches that have been used to perform coordination of <BR>conflict resolution. The objective of the paper is to point out <BR>the advantages and disadvantages of each method. <BR>The paper is organized as follows: Section 2 recalls quickly conflict detection and resolution. In Section 3, we review the approaches that have been proposed for the coordination problem and we discuss some of the most relevant methods. <BR>II. CONFLICT DETECTION &RESOLUTION (CD&R) <BR>The conflict detection and resolution has been a major topic <BR>in ATM research. The air traffic conflict detection and <BR>resolution process consists of several tasks to ensure <BR>separation or avoid collisions depending on the scope of the <BR>system. Firstly, based on the information available, future <BR>position can then be estimated and potential conflicts can be <BR>predicted. <BR>Conflict detection is based on the estimation of future <BR>vehicle position and through the application of predefined <BR>metrics on the situation in order to decide whether or not a <BR>conflict is present. This metric may include a sole parameter <BR>(e.g., distance) or may be a combination of several parameters <BR>(e.g., distance, time and maneuvering cost). After the detection <BR>of a conflict, a conflict resolution phase requires appropriate <BR>maneuver action and information distribution to all aircraft <BR>involved in the conflict. <BR>Following the literature research, an important number of <BR>different modeling approaches (more than 60 methods ) <BR>have been applied in the past for conflict detection and <BR>resolution in aerospace. These models include a wide variety <BR>of techniques from varying viewpoints, but are all intended to <BR>provide an analytical basis for designing and evaluating <BR>conflict detection and resolution systems. <BR>A. Conflict Detection <BR>In order to ensure safety of aircraft traffic operations, <BR>adequate separation must be maintained. A conflict occurs <BR>1<BR>when an aircraft’s protected zone is violated. The protected <BR>zone is currently defined by en route ATC standards as a <BR>circular zone of 5 nautical mile radius and a height of 2000 ft <BR>altitude (-1000 ft to +1000ft). In other words, a conflict <BR>between two aircraft is called effective if at some instant of <BR>time, the minimal distance between these two aircraft called <BR>Closest Point of Approach (CPA) is inferior to the minimal <BR>separation standard (see Figure 1). The conflict detection phase, permits to detect conflicts only <BR>with aircraft for which an intrusion of the protected zone takes <BR>place in the near future, which is defined by using a fixed <BR>look-ahead time for T minutes . A new conflict is detected <BR>when an intrusion of the protected zone is predicted, and the <BR>time of this intrusion is within the look-ahead time. The <BR>conflict detection uses the current state (position and altitude) <BR>and trend vector (ground speed, track and vertical speed) to <BR>Aircraft 1 Aircraft 2 </P>
<P>Figure 1. A Conflict <BR>detect conflicts. For a global resolution of case of more than two aircraft <BR>simultaneously in conflicts, clusters of aircraft involved in <BR>these conflicts will be determined and identified during the <BR>look-ahead time. Recall that a cluster is the transitive <BR>closure on all aircraft pairs involved in a conflict during the <BR>look-ahead time; that mean if A conflicts with B, and B <BR>conflicts with both A and C, then the cluster consists of A, B <BR>and C (see Figure 2). <BR>B. Conflict Resolution <BR>Once a conflict is detected it must also be resolved. <BR>Generally, a conflict situation will be resolved by maneuvering <BR>horizontally (heading change) or maneuvering vertically <BR>(altitude change) or speed change of aircraft. Over the years, <BR>various methods for resolving conflict situations have been <BR>proposed. Some methods use force field techniques, others use <BR>genetic algorithms, rule-based methods, or optimization <BR>techniques. Kuchar and Yang have also given an overview <BR>of various approaches to conflict detection and resolution <BR>problem. Force field approaches model each aircraft as a changed <BR>The protected zone is also often referred to as Protected Airspace Zone, <BR>which is a definition that originates from Radio Technical Commission for <BR>Aeronautics (RTCA) <BR>A C </P>
<P><BR>B <BR>Figure 2. Cluster of three aircraft involving in conflicts {A, B, C} <BR>particle and use modified electrostatic equations to determine <BR>resolution maneuvers. The repulsive forces between aircraft <BR>are used to define the maneuver each performs to avoid a <BR>collision , . Optimized conflict resolution can involve a rule-based <BR>decision , or determining which of several avoidance <BR>options minimizes a given cost function. The Traffic Alert and <BR>Collision Avoidance System (TCAS), for example, searches <BR>through a set of potential climb or descend maneuvers and <BR>chooses the least-aggressive maneuver that still provides <BR>adequate protection. Algorithms for resolving three-<BR>dimensional conflicts involving multiple aircraft are presented <BR>in . These algorithms are based on trajectory optimization <BR>methods and provide resolution actions that minimize a certain <BR>cost function. Krozel et al. have used an approach based <BR>on optimal control theory (OCT). They have developed an <BR>algorithm for the resolution of conflicts involving two aircraft. <BR>This algorithm is based on the maximization of the inter-<BR>aircraft distance at the Point of Closest Approach. Game <BR>theory (Game) is used for conflict resolution by Tomlin et al. <BR>. Recently, Nicolas Durand describes a mathematical <BR>programming model using a heuristic method based on genetic <BR>algorithms (GA) to optimally resolve conflict whereby the <BR>global optimization function aims at minimizing the overall <BR>cost incurred. <BR>III. THE COORDINATION PROBLEM <BR>En Route capacity is a problem mainly in Europe. Airspace <BR>is divided in control sectors, each sector being managed by <BR>two air traffic controllers. However, the capacity of a sector is <BR>limited. A controller can not handle more than a certain <BR>number of aircraft in its sector. Additionally, as air traffic <BR>keeps increasing, a controller must be able to manage clusters <BR>of conflicts. And then, a global solution to clusters involving <BR>many aircraft in conflicts, more than two aircraft, is needed. <BR>Consequently, the coordination problem of conflict resolution <BR>appears and must be solved. </P>
<P> </P>
<P>REFERENCES <BR> J. Kuchar and L. Yang, “A Review of Conflict Detection and Resolution Modeling Methods”, IEEE Transactions on Intelligent Transportation Systems, Vol. 1, No. 4, December 2000, pp. 179-189. <BR> M.S.V. V. Clari, R.C.J. Ruigrok, J.M. Hoekstra and H.G. Visser, “Cost-Benefit Study of Free Flight With Airborne Separation Assurance”, Air Traffic Control Quarterly, Vol. 9 (4) pp. 287-309, 2001. <BR> N. Durand, . Optimisation des Trajectoires pour la Résolution de Conflits En-Route ., Ph.D Thesis, INPT, Toulouse, France 1996. <BR> K. Zeghal, “A Review of Different Approaches Based on Force Fields for Airborne Conflict Resolution”, AIAA-98-4240, in Proc. AIAA Guidance, Navigation, and Control Conference, Boston, MA, August 10-12, 1998, pp. 818-827. <BR> V. Duong, “FREER-1 Research memo Dynamic Models for Airbone ATM Capability”, Eurocontrol, June 1996. <BR> V. Duong, E. Hoffman, F. Floc’hic, J.P. Nicolaon, A. Bossu, “Extended Flight Rules (EFR) to apply to the resolution of encounters in autonomous airborne separation”, Technical Report, Eurocontrol, <BR>September 1996. <BR> J. Kosecka, C.Tomlin, G. Pappas and S. Sastry, “Generation of Conflict Resolution Maneuvers for Air Traffic Management”, International Conference on Robotics and Intelligent Systems, September 1997. <BR> G. Granger, N. Durand, J.M. Alliot, “Token allocation strategy for free-flight conflict solving”, IJCAI'01. <BR> J. Carlier, V. Duong, D. Nace, H.H. Nguyen, “Using Disjunctive Scheduling for Optimally Solving En-Route Conflicts”, AIAA/IEEE 21st <BR>Digital Avionics Systems Conference, Irvine, California, USA, October <BR>27-31, 2002 <BR> F. Medioni, . Méthodes d'Optimisation pour l'Evitement Aérien: <BR>Systèmes Centralisés, Systèmes Embarqués ., Ph.D Thesis, ENAC, <BR>France, December 1998. <BR> G. Granger, N. Durand, J.M. Alliot,“Optimal Resolution of En Route <BR>th <BR>Conflicts”, 4 ATM R&D Seminar, SantaFe, USA, December 2001. <BR> K. Zeghal, “Towards the Logic of an Airborne Collision Avoidance <BR>System which Ensures Coordination with Multiple Cooperative <BR>Intruders”, ICAS-94-8.6.4, ICAS Proceedings, Vol. 3, pp. 2208-2218, <BR>1994. <BR> Y. Iijima, H. Hagiwara and H. Kasai, “Results of Collision Avoidance <BR>Maneuver”, Experiments Using a Knowledge-Based Autonomous <BR>Piloting System, Journal of Navigation, Vol. 44 no. 2, 1991. <BR> J. Krozel, T. Mueller and G. Hunter, “Free Flight Conflict Detection and <BR>Resolution Analysis”, Paper AIAA-96-3763, AIAA Guidance, <BR>Navigation and Control Conference, California, 1996. <BR> J. P. Wangermann and R. F. Stengel, “Optimization and Coordination of <BR>Multi-Agent Systems Using Principled Negotiation”, AIAA-96-3853, in <BR>Proc. 1996 AIAA Guidance, Navigation, and Control Conference, San <BR>Diego, CA, July 29-31, 1996. <BR> M.S. Eby, “A Seft-Organizational Approach for Resolving Air Traffic <BR>Conflicts”, Lincoln Laboratory Journal, Vol. 7, No. 2, 1994. <BR> J.W. Andrews, “A Relative Motion Analysis of Horizontal Collision <BR>Avoidance”, SAFE Journal, Vol. 8, No. 2, 1978. <BR> C. Tomlin, G.J. Pappas and S. Sastry, “Conflict Resolution for Air <BR>Traffic Management: a Case Study in Multi-Agent Hybrid Systems”, <BR>University of California at Berkeley, 1996. <BR> D. Love, “TCAS III: Bringing Operational Compatibility to Airborne <BR>st <BR>Collision Avoidance”, AIAA/IEEE 8 Digital Avionics Systems <BR>Conference, 1988. <BR> Radio Technical Committee on Aeronautics (RTCA), “Minimum <BR>Performance Specifications for TCAS Airborne Equipment”, Docum ent <BR>No. RTCA/DO185, Washington, D.C. September 1983. <BR> P.K. Menon and G. D. Sweriduk , ”Optimal Strategies for Free-Flight <BR>Air Traffic Conflict Resolution”, Journal of Guidance, Control, and <BR>Dynamics, Vol 22, No 2, March-April 1999. <BR> R. Schild and J.K. Kuchar, “Operational efficiency of maneuver <BR>coordination rules for an airborne separation assurance system”, 3rd <BR>USA/Europe Air Traffic Management R&D Seminar Napoli, 13-16 June <BR>2000. <BR> R. Mandiau, S. Piechowiak, ”Conflict Solving Into the Multi-Agent <BR>Distributed Planning”, Universite de Valenciennes, 1998. <BR> N. Jennings, “Cooperation in Industrial Multi-Agent Systems”, World <BR>Scientific Publishing Co. Pte. Ltd., Singapore, 1994. <BR> J. P. Wangermann, R. F. Stengel, ”Optimization and Coordination of <BR>Multiagent Systems Using Principled Negotiation”, Journal of <BR>Guidance, Control and Dynamics, Vol. 22, No. 1, January -February <BR>1999. <BR> C. Goodchild, M.A. Vilaplana and S. Elefante, “Co-operative Optimal <BR>rd <BR>Airborne Separation Assurance in Free Flight Airspace”, 3 <BR>Usa/Europe Air Traffic Management R&D Seminar, Napoli, 13th-16th <BR>June 2000. <BR>TERMINOLOGY AND ABBREVIATIONS <BR>ADS-B Automatic Dependent Surveillance - Broadcast ATC Air Traffic Control ATM Air Traffic Management ATFM Air Traffic Flow Management CDM Collaborative Decision Making CD&R Conflict Detection and Resolution CPA Closest Point of Approach DAI Distributed Artificial Intelligence EFR Extended Flight Rules FREER Free-Route Experimental Encounter Resolution GA Genetic Algorithms OCT Optimal Control Theory RTCA Radio Technical Commission for Aeronautics TCAS Traffic Alert and Collision Avoidance System VFR Visual Flight Rules <BR>BIOGRAPHY <BR>Huy-Hoang Nguyen obtained an Engineering degree in Computer Science <BR>from the Polytechnic University of Ho Chi Minh City, a Master degree in <BR>Computer Science from the Institut de la Francophonie pour l’Informatique, <BR>and is currently a Ph.D. candidate at the University of Technology of <BR>Compiègne, France. His interests include operations research, and in <BR>particular, scheduling and optimization problems. </P>
<P> </P> thaks thanks 好的 谢谢啊
页:
[1]