Search NASA⌕ Search

SEARCH · Search NASA

Results for “conflict resolution”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Conflict Detection and Resolution for Future Air Transportation Management

With a Free Flight policy, the emphasis for air traffic control is shifting from active control to passive air traffic management with a policy of intervention by exception. Aircraft will be allowed to fly user preferred routes, as long as safety Alert Zones are not violated. If there is a potential conflict, two (or more) aircraft must be able to arrive at a solution for conflict resolution without controller intervention. Thus, decision aid tools are needed in Free Flight to detect and resolve conflicts, and several problems must be solved to develop such tools. In this report, we analyze and solve problems of proximity management, conflict detection, and conflict resolution under a Free Flight policy. For proximity management, we establish a system based on Delaunay Triangulations of aircraft at constant flight levels. Such a system provides a means for analyzing the neighbor relationships between aircraft and the nearby free space around air traffic which can be utilized later in conflict resolution. For conflict detection, we perform both 2-dimensional and 3-dimensional analyses based on the penetration of the Protected Airspace Zone. Both deterministic and non-deterministic analyses are performed. We investigate several types of conflict warnings including tactical warnings prior to penetrating the Protected Airspace Zone, methods based on the reachability overlap of both aircraft, and conflict probability maps to establish strategic Alert Zones around aircraft.

Krozel, Jimmy↗

A Computer Simulation of the System-Wide Effects of Parallel-Offset Route Maneuvers

Most aircraft managed by air-traffic controllers in the National Airspace System are capable of flying parallel-offset routes. This paper presents the results of two related studies on the effects of increased use of offset routes as a conflict resolution maneuver. The first study analyzes offset routes in the context of all standard resolution types which air-traffic controllers currently use. This study shows that by utilizing parallel-offset route maneuvers, significant system-wide savings in delay due to conflict resolution of up to 30% are possible. It also shows that most offset resolutions replace horizontal-vectoring resolutions. The second study builds on the results of the first and directly compares offset resolutions and standard horizontal-vectoring maneuvers to determine that in-trail conflicts are often more efficiently resolved by offset maneuvers.

Lauderdale, Todd A.↗

Driving Parameters for Distributed and Centralized Air Transportation Architectures

This report considers the problem of intersecting aircraft flows under decentralized conflict avoidance rules. Using an Eulerian standpoint (aircraft flow through a fixed control volume), new air traffic control models and scenarios are defined that enable the study of long-term airspace stability problems. Considering a class of two intersecting aircraft flows, it is shown that airspace stability, defined both in terms of safety and performance, is preserved under decentralized conflict resolution algorithms. Performance bounds are derived for the aircraft flow problem under different maneuver models. Besides analytical approaches, numerical examples are presented to test the theoretical results, as well as to generate some insight about the structure of the traffic flow after resolution. Considering more than two intersecting aircraft flows, simulations indicate that flow stability may not be guaranteed under simple conflict avoidance rules. Finally, a comparison is made with centralized strategies to conflict resolution.

Feron, Eric↗

Separation at Crossing Waypoints Under Wind Uncertainty in Urban Air Mobility

To enable high-density operations in major metropolitan areas, urban air mobility networks are anticipated to have air traffic management with higher levels of autonomy. To ensure that this type of autonomy is feasible, one of the critical steps from a safety and efficiency perspective is understanding various factors that affect the spatial separation between airborne flights and ensure that these factors can be managed. In terms of separation assurance and scheduling, an important real-world concern is that future states of aircraft cannot be perfectly predicted. The focus of this research paper is to understand how these prediction errors affect separation and scheduling services and to explore mitigation strategies to handle these errors. In this research, we have simulated these types of uncertainty by adding wind-prediction errors to trajectory predictions for separation. With these wind-prediction errors, we decompose the problem into two separate questions. First, using both simulation and analytical methods, we look at conflict-detection-only scenarios to understand how the wind errors affect required minimum temporal separation between crossing flights to ensure a specific spatial separation. Next, we study how trajectory errors effect conflict resolution, and we explore different combinations of scheduling and separation assurance to mitigate the effects of uncertainty between crossing flights. The conflict resolution algorithm aims to minimize necessary temporal separation between crossing flights under uncertainty, still ensuring safety-critical spatial separation. In summary, this research suggests that the required minimum temporal separation at a crossing waypoint is dependent on factors such as inbound crossing angle, the relative angle between wind direction and bearing of each route, wind magnitude, wind magnitude uncertainty, nominal cruise airspeed of aircraft, and look-ahead time of the conflict detection algorithm. This research also suggests that different combinations of scheduling and separation have different qualitative results. Using a combination of strategic, flow-based scheduling, tactical scheduling at crossings, speed control near crossing points, and separation management leads to a system that is insensitive to trajectory prediction errors with high throughput and flexibility for aircraft away from shared resources.

urban air mobility↗

Separation at Crossing Waypoints Under Wind Uncertainty in Urban Air Mobility

To enable high-density operations in major metropolitan areas, urban air mobility networks are anticipated to have air traffic management with higher levels of autonomy. To ensure that this type of autonomy is feasible, one of the critical steps from a safety and efficiency perspective is understanding various factors that affect the spatial separation between airborne flights and ensure that these factors can be managed. In terms of separation assurance and scheduling, an important real-world concern is that future states of aircraft cannot be perfectly predicted. The focus of this research paper is to understand how these prediction errors affect separation and scheduling services and to explore mitigation strategies to handle these errors. In this research, we have simulated these types of uncertainty by adding wind-prediction errors to trajectory predictions for separation. With these wind-prediction errors, we decompose the problem into two separate questions. First, using both simulation and analytical methods, we look at conflict-detection-only scenarios to understand how the wind errors affect required minimum temporal separation between crossing flights to ensure a specific spatial separation. Next, we study how trajectory errors effect conflict resolution, and we explore different combinations of scheduling and separation assurance to mitigate the effects of uncertainty between crossing flights. The conflict resolution algorithm aims to minimize necessary temporal separation between crossing flights under uncertainty, still ensuring safety-critical spatial separation. In summary, this research suggests that the required minimum temporal separation at a crossing waypoint is dependent on factors such as inbound crossing angle, the relative angle between wind direction and bearing of each route, wind magnitude, wind magnitude uncertainty, nominal cruise airspeed of aircraft, and look-ahead time of the conflict detection algorithm. This research also suggests that different combinations of scheduling and separation have different qualitative results. Using a combination of strategic, flow-based scheduling, tactical scheduling at crossings, speed control near crossing points, and separation management leads to a system that is insensitive to trajectory prediction errors with high throughput and flexibility for aircraft away from shared resources.

urban air mobility↗

EOS distributed planning and scheduling prototype

Some of the more significant lessons learned during the development of the Earth Observing System (EOS) Distributed Planning and Scheduling Prototype are presented. The need for a central scheduler is not demonstrated. A mapping of scheduling and conflict-resolution responsibility across the nodes of the EOS distributed scheduling system is developed and shown to be both feasible and appropriate. Complex instrument scheduling is mostly accomplished at the ICC/IST (instrument control center/instrumental support terminal) with 'slidable' flexibility for slews and some kinds of calibrations resolved at the EOS Operations Center (EOC). All nodes have full visibility interinstrument contention for resource and environmental rights, e.g., vibration, thermal, and electromagnetic. The EOC assigns, by activity, initial action responsibility for conflict resolution to a node which is party to the conflict. Most interinstrument conflicts are resolved by the ICCs and ISTs during an intermediate scheduling phase while the EOC is negotiating a TDRS schedule with the NCC.

Hull, Larry G.↗

An Impedance-Based Complexity Metric for Unmanned Aircraft System Traffic Scenario Classification

This paper introduces an impedance-based metric to capture the complexity of a given unmanned aircraft system traffic scenario. The metric accounts for both the number of aircraft and the traffic flow pattern. The work presented here extends an earlier approach that introduced another scenario complexity metric based on the number of potential conflicts weighted by the conflict resolution cost associated. Complexity measurements for randomly-generated scenarios were produced through high-fidelity fast-time simulations and treated as baseline. Then the impedance based metric was evaluated, for the same scenarios, without the need for an actual flight simulation and a conflict resolution method. The results show that the impedance-based metric has a strong correlation to the baseline data and performs marginally better than the weighted conflict-based complexity metric introduced in the earlier work. The metric computation generates impedance maps which are useful for identifying high complexity regions in a scenario, where flight plan changes might be necessitated. This metric can therefore be used, in conjunction with other complexity metrics, to inform adequate traffic management strategies and classify a traffic scenario as acceptable, unacceptable or acceptable with changes made to flight plans that pass through the high complexity regions. The metric can also be used as a guidance metric for strategic conflict management methods.

Complexity↗

Airport Traffic Conflict Detection and Resolution Algorithm Evaluation

A conflict detection and resolution (CD&R) concept for the terminal maneuvering area (TMA) was evaluated in a fast-time batch simulation study at the National Aeronautics and Space Administration (NASA) Langley Research Center. The CD&R concept is being designed to enhance surface situation awareness and provide cockpit alerts of potential conflicts during runway, taxi, and low altitude air-to-air operations. The purpose of the study was to evaluate the performance of aircraft-based CD&R algorithms in the TMA, as a function of surveillance accuracy. This paper gives an overview of the CD&R concept, simulation study, and results. The Next Generation Air Transportation System (NextGen) concept for the year 2025 and beyond envisions the movement of large numbers of people and goods in a safe, efficient, and reliable manner [1]. NextGen will remove many of the constraints in the current air transportation system, support a wider range of operations, and provide an overall system capacity up to three times that of current operating levels. Emerging NextGen operational concepts [2], such as four-dimensional trajectory based airborne and surface operations, equivalent visual operations, and super density arrival and departure operations, require a different approach to air traffic management and as a result, a dramatic shift in the tasks, roles, and responsibilities for the flight deck and air traffic control (ATC) to ensure a safe, sustainable air transportation system.

Jones, Denise R.↗

Airport Traffic Conflict Detection and Resolution Algorithm Evaluation

Two conflict detection and resolution (CD&R) algorithms for the terminal maneuvering area (TMA) were evaluated in a fast-time batch simulation study at the National Aeronautics and Space Administration (NASA) Langley Research Center. One CD&R algorithm, developed at NASA, was designed to enhance surface situation awareness and provide cockpit alerts of potential conflicts during runway, taxi, and low altitude air-to-air operations. The second algorithm, Enhanced Traffic Situation Awareness on the Airport Surface with Indications and Alerts (SURF IA), was designed to increase flight crew awareness of the runway environment and facilitate an appropriate and timely response to potential conflict situations. The purpose of the study was to evaluate the performance of the aircraft-based CD&R algorithms during various runway, taxiway, and low altitude scenarios, multiple levels of CD&R system equipage, and various levels of horizontal position accuracy. Algorithm performance was assessed through various metrics including the collision rate, nuisance and missed alert rate, and alert toggling rate. The data suggests that, in general, alert toggling, nuisance and missed alerts, and unnecessary maneuvering occurred more frequently as the position accuracy was reduced. Collision avoidance was more effective when all of the aircraft were equipped with CD&R and maneuvered to avoid a collision after an alert was issued. In order to reduce the number of unwanted (nuisance) alerts when taxiing across a runway, a buffer is needed between the hold line and the alerting zone so alerts are not generated when an aircraft is behind the hold line. All of the results support RTCA horizontal position accuracy requirements for performing a CD&R function to reduce the likelihood and severity of runway incursions and collisions.

Jones, Denise R.↗

Collaborative Resource Allocation

Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

Wang, Yeou-Fang↗

Initial Study of Tailored Trajectory Management for Multi-Vehicle Uncrewed Regional Air Cargo Operations

The primary contribution of this paper is an evaluation of the potential value of a tailored trajectory management (TTM) capability for uncrewed aircraft (UA) operators that is proactive in detecting conflicts and developing trajectory-based solutions for UA prior to air traffic control (ATC) performing conflict resolution. The experiment matrix is composed of one baseline simulation that models current air traffic operations without such a capability and four test simulations with different configurations of such a capability. In each simulation, five UA operations into Fort Worth Alliance airport were modeled in the presence of recorded tracks for about 4700 flights on January 18, 2022. The analysis focused on the extent to which such a capability was able to preclude an event that could spike UA operator workload. More specifically, in this study, the emulated UA operator TTM capability for multi-vehicle regional air cargo operations was able to reduce the number of instances of concurrent UA conflicts in the modeled ATC conflict resolution timeframe of 8 minutes or less from three to as low as one.

uncrewed aircraft, regional air cargo, tailored tr↗

Scheduling with Automatic Resolution of Conflicts

DSN Requirement Scheduler is a computer program that automatically schedules, reschedules, and resolves conflicts for allocations of resources of NASA s Deep Space Network (DSN) on the basis of ever-changing project requirements for DSN services. As used here, resources signifies, primarily, DSN antennas, ancillary equipment, and times during which they are available. Examples of project-required DSN services include arraying, segmentation, very-long-baseline interferometry, and multiple spacecraft per aperture. Requirements can include periodic reservations of specific or optional resources during specific time intervals or within ranges specified in terms of starting times and durations. This program is built on the Automated Scheduling and Planning Environment (ASPEN) software system (aspects of which have been described in previous NASA Tech Briefs articles), with customization to reflect requirements and constraints involved in allocation of DSN resources. Unlike prior DSN-resource- scheduling programs that make single passes through the requirements and require human intervention to resolve conflicts, this program makes repeated passes in a continuing search for all possible allocations, provides a best-effort solution at any time, and presents alternative solutions among which users can choose.

Clement, Bradley↗

Initial Analysis of Digitally Enabled Cooperative Operations in Class D Terminal Airspace

The primary contribution of this paper is an initial analysis of integrating digitally enabled cooperative operations (or digital operations for short) with Visual Flight Rules (VFR) and Instrument Flight Rules (IFR) operations in the terminal airspace around a Class D airport, specifically around Fort Worth Alliance airport (KAFW). Enabled by connected digital technologies and automated information exchange, digital operations as envisioned would utilize cooperative practices and operator-responsible separation to ensure safety. In the present study, three conflict management configurations for digital operations were analyzed: 1) centralized with a single instance of a conflict management service to model a scenario with only one fleet operator conducting digital operations or all fleet operators utilizing the same service, 2) federated with two different instances to model a scenario with two different fleet operators conducting digital operations, and 3) fully distributed with a different instance for each digital operation. In simulations in which recorded tracks for VFR and IFR operations were played back and digital operations were modeled that would nominally arrive at KAFW once every 20 minutes (given no conflict resolution maneuvers), there were one or fewer losses of separation (LOS) across the three conflict management configurations. The same result was seen in simulations in which digital operations would nominally arrive at KAFW once every 10 minutes. However, in simulations in which digital operations would nominally arrive at KAFW once every 5 minutes, the number of LOS ranged between six and ten. This highlights the need for follow-on research to investigate the extent to which additional capabilities for digital operations, such as complexity management and/or flow organization, may be needed.

digitally enabled cooperative operations, digital ↗

Initial Analysis of Digitally Enabled Cooperative Operations in Class D Terminal Airspace

The primary contribution of this paper is an initial analysis of integrating digitally enabled cooperative operations (or digital operations for short) with Visual Flight Rules (VFR) and Instrument Flight Rules (IFR) operations in the terminal airspace around a Class D airport, specifically around Fort Worth Alliance airport (KAFW). Enabled by connected digital technologies and automated information exchange, digital operations as envisioned would utilize cooperative practices and operator-responsible separation to ensure safety. In the present study, three conflict management configurations for digital operations were analyzed: 1) centralized with a single instance of a conflict management service to model a scenario with only one fleet operator conducting digital operations or all fleet operators utilizing the same service, 2) federated with two different instances to model a scenario with two different fleet operators conducting digital operations, and 3) fully distributed with a different instance for each digital operation. In simulations in which recorded tracks for VFR and IFR operations were played back and digital operations were modeled that would nominally arrive at KAFW once every 20 minutes (given no conflict resolution maneuvers), there were one or fewer losses of separation (LOS) across the three conflict management configurations. The same result was seen in simulations in which digital operations would nominally arrive at KAFW once every 10 minutes. However, in simulations in which digital operations would nominally arrive at KAFW once every 5 minutes, the number of LOS ranged between six and ten. This highlights the need for follow-on research to investigate the extent to which additional capabilities for digital operations, such as complexity management and/or flow organization, may be needed.

digitally enabled cooperative operations↗

Functional Allocation Approach for Separation Assurance for Remotely Piloted Aircraft

A functional analysis framework is employed with the objective of exploring the separation assurance function for the remotely piloted aircraft system. The architecture of the remotely piloted aircraft system—highlighting several of the component systems and the functions resident onboard the remotely piloted aircraft and in the ground control station—is described to provide the context for understanding the complexity of the said system for a detailed functional analysis. The interactions between the agents of the separation assurance function belonging to the air traffic service provider, remotely piloted aircraft system operator and remotely piloted aircraft are described. Separation assurance by air traffic control, remain well clear by the remotely piloted aircraft system and collision avoidance onboard the remotely piloted aircraft are briefly discussed. The functional analysis framework is illustrated by relating the agents to the actions of (a) acquiring the surveillance information, (b) checking for conflicts, (c) creating the solutions for resolving conflicts and (d) implementing the conflict resolution solutions. This example is offered as a template by which a more detailed functional analysis of this and other functions could be developed. The architecture of the remotely piloted aircraft system is described to aid this process.

Functional analysis↗

Functional Allocation Approach for Separation Assurance for Remotely Piloted Aircraft

A functional analysis framework is employed with the objective of exploring the separation assurance function for the remotely piloted aircraft system. The architecture of the remotely piloted aircraft system—highlighting several of the component systems and the functions resident onboard the remotely piloted aircraft and in the ground control station—is described to provide the context for understanding the complexity of the said system for a detailed functional analysis. The interactions between the agents of the separation assurance function belonging to the air traffic service provider, remotely piloted aircraft system operator and remotely piloted aircraft are described. Separation assurance by air traffic control, remain well clear by the remotely piloted aircraft system and collision avoidance onboard the remotely piloted aircraft are briefly discussed. The functional analysis framework is illustrated by relating the agents to the actions of (a) acquiring the surveillance information, (b) checking for conflicts, (c) creating the solutions for resolving conflicts and (d) implementing the conflict resolution solutions. This example is offered as a template by which a more detailed functional analysis of this and other functions could be developed. The architecture of the remotely piloted aircraft system is described to aid this process.

functional analysis↗

A Mathematical Basis for the Safety Analysis of Conflict Prevention Algorithms

In air traffic management systems, a conflict prevention system examines the traffic and provides ranges of guidance maneuvers that avoid conflicts. This guidance takes the form of ranges of track angles, vertical speeds, or ground speeds. These ranges may be assembled into prevention bands: maneuvers that should not be taken. Unlike conflict resolution systems, which presume that the aircraft already has a conflict, conflict prevention systems show conflicts for all maneuvers. Without conflict prevention information, a pilot might perform a maneuver that causes a near-term conflict. Because near-term conflicts can lead to safety concerns, strong verification of correct operation is required. This paper presents a mathematical framework to analyze the correctness of algorithms that produce conflict prevention information. This paper examines multiple mathematical approaches: iterative, vector algebraic, and trigonometric. The correctness theories are structured first to analyze conflict prevention information for all aircraft. Next, these theories are augmented to consider aircraft which will create a conflict within a given lookahead time. Certain key functions for a candidate algorithm, which satisfy this mathematical basis are presented; however, the proof that a full algorithm using these functions completely satisfies the definition of safety is not provided.

Maddalon, Jeffrey M.↗

A Mathematical Analysis of Conflict Prevention Information

In air traffic management, conflict prevention information refers to the guidance maneuvers, which if taken, ensure that an aircraft's path is conflict-free. These guidance maneuvers take the form of changes to track angle or ground speed. Conflict prevention information may be assembled into prevention bands that advise the crew on maneuvers that should not be taken. Unlike conflict resolution systems, which presume that the aircraft already has a conflict, conflict prevention systems show conflicts for any maneuver, giving the pilot confidence that if a maneuver is made, then no near-term conflicts will result. Because near-term conflicts can lead to safety concerns, strong verification of information correctness is required. This paper presents a mathematical framework to analyze the correctness of algorithms that produce conflict prevention information incorporating an arbitrary number of traffic aircraft and with both a near-term and intermediate-term lookahead times. The framework is illustrated with a formally verified algorithm for 2-dimensional track angle prevention bands.

Maddalon, Jeffrey M.↗