Search NASA⌕ Search

SEARCH · Search NASA

Results for “deconfliction”

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 19 records

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Distributed Rules-Based Deconfliction of ADMS Applications: Part 1: Requirements & Decomposition

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. This first document introduces the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem is decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. Selection of the optimal number of decompositions of the deconfliction problem should be made based on a tradeoff analysis between computational speed and global optimality. This second document will define an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Strategic Deconfliction Performance: Results and Analysis from the NASA UTM Technical Capability Level 4 Demonstration

Unmanned Aircraft System (UAS) Traffic Management (UTM) refers to the service-based, cooperative approach to the management of small UAS in the National Airspace System that is safe, scalable, and fair. UTM provides the means to manage the airspace in a complementary manner that does not burden the current air traffic control workforce or infrastructure but allows the Air Navigation Service Provider to maintain its regulatory and operational authority of the airspace. A key feature of UTM is the ability to provide operators the means to strategically deconflict operations from others in the airspace through the digital exchange of information via supporting services. Through this approach, the four-dimensional operation volumes that encompass the intent of operators in a given area are discoverable and can be used for airspace awareness as well as planning conflict free operations that account for and avoid other operations. In certain cases, it is also possible to negotiate volume intersections for shared airspace use without the need to re-plan. In the NASA UTM concept, strategic deconfliction is the first layer of three in the overall conflict management model. The three layers of the conflict management model, which follow the International Civil Aviation Organization’s scheme [ICAO 2005] are: strategic conflict management, separate provision, and collision avoidance. In UTM, the strategic layer mostly occurs prior to departure, but is applicable to en route operations with sufficient planning horizon. The initial requirements for a strategic deconfliction capability within UTM are defined in a NASA publication [Rios 2018]. Within the concept and implementation of service-provided strategic deconfliction is the notion of priority. It is understood that there are instances in which an operation requires a priority designation within the UTM system and special handling accordingly to provide situation awareness and facilitate appropriate responses from other airspace users. Examples of situations requiring priority designation include: when an operator declares an emergency due to problems with the vehicle or its immediate surroundings; operations that are in support of certain organizations (e.g., public safety and first responders); or special missions that also require priority use of airspace (e.g., emergency medical deliveries). UAS Volume Reservations (UVRs) also relate to the topic of priority in the sense that the airspace that the volume encompasses has a different status or classification in which unassociated operations must vacate if inside, or avoid if outside, through strategic deconfliction with the volume. Operations that are specially permitted to access the UVR area are typically assigned priority status given the nature of their mission and their associated credentials. The ability to perform strategic deconfliction, handle certain operations with a priority distinction, and establish UVRs that are communicated throughout the UTM system, is predicated on an architecture that has been established through an evolutionary process in response to close collaboration with stakeholders from government and industry. Another important and influential aspect of these capabilities and architecture is the live, distributed flight tests that have been conducted across the Technical Capability Levels (TCLs) that culminated with a set of complex tests performed as part of TCL4 [Rios 2020]. The TCL4 flight test involved two FAA-designated UAS test sites building teams to collaborate with NASA’s UTM Project on the execution of several detailed, small UAS scenarios in urban environments.

conflict management↗

Study of Pairwise Deconfliction Metrics to Analyze Air Traffic Complexity in Upper Class E Airspace

Upper Class E Traffic Management (ETM) is envisioned to cooperatively facilitate operations of a diverse set of aerial vehicles, such as high-altitude long-endurance fixed-wing unmanned aircraft (low-speed and high-speed), high-altitude platforms, airships, stratospheric balloons, supersonic unmanned and commercial aircraft, etc., with a wide variety of mission types, performance characteristics, communication, navigation and surveillance capabilities, maneuverability, and on-board avionics in the National Airspace System (NAS) ’above’ 60,000 feet above mean sea level, without an active and direct control from human air traffic controllers. A diverse mixture of aerial vehicle types creates significant challenges in understanding air traffic complexity, which may not correlate strongly with air traffic density. One key step for determining air traffic complexity in upper class E airspace is to first understand pairwise deconfliction metrics such as reachability, reserve area, and reserve flight time for each pair of unique aerial vehicle types under potential conflict. Therefore, pairwise deconfliction metrics are first defined, and analytical equations are derived for conflict resolution using the heading change maneuver. Next, case studies are performed to analyze deconfliction metrics to avoid secondary conflicts in upper class E airspace. The study shows that pairwise deconfliction metrics are functions of maneuverability, performance characteristics, uncertainty in position and velocity, heading angle change, and conflict angle of aerial vehicles. The next step for this research is to build a mathematical model for air traffic complexity using pairwise deconfliction metrics and validate it in an upper Class E simulation environment.

Airspace Complexity↗

Study of Pairwise Deconfliction Metrics to Analyze Air Traffic Complexity in Upper Class E Airspace

Upper Class E Traffic Management (ETM) is envisioned to cooperatively facilitate operations of a diverse set of aerial vehicles, such as high-altitude long-endurance fixed-wing unmanned aircraft (low-speed and high-speed), high-altitude platforms, airships, stratospheric balloons, supersonic unmanned and commercial aircraft, etc., with a wide variety of mission types, performance characteristics, communication, navigation and surveillance capabilities, maneuverability, and on-board avionics in the National Airspace System (NAS) ’above’ 60,000 feet above mean sea level, without an active and direct control from human air traffic controllers. A diverse mixture of aerial vehicle types creates significant challenges in understanding air traffic complexity, which may not correlate strongly with air traffic density. One key step for determining air traffic complexity in upper class E airspace is to first understand pairwise deconfliction metrics such as reachability, reserve area, and reserve flight time for each pair of unique aerial vehicle types under potential conflict. Therefore, pairwise deconfliction metrics are first defined, and analytical equations are derived for conflict resolution using the heading change maneuver. Next, case studies are performed to analyze deconfliction metrics to avoid secondary conflicts in upper class E airspace. The study shows that pairwise deconfliction metrics are functions of maneuverability, performance characteristics, uncertainty in position and velocity, heading angle change, and conflict angle of aerial vehicles. The next step for this research is to build a mathematical model for air traffic complexity using pairwise deconfliction metrics and validate it in an upper Class E simulation environment.

Airspace Complexity↗

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

strategic deconfliction↗

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

safety↗

Design of Safe Separation Bounds for Temporally Deconflicted Trajectories Under Bounded Uncertainties

This paper explores the derivation of safe separation bounds for a heterogeneous group of~$n$ Uncrewed Aerial Systems (UAS) that are assigned temporally deconflicted trajectories. Compared to spatially deconflicted trajectories, temporal deconfliction can lead to higher traffic capacities and a more efficient use of the available airspace. One challenge with this type of deconfliction is that collisions can occur if some cooperating UAS are behind or ahead of schedule. To overcome this risk, this paper derives a lower bound on the safety distance between two heterogeneous UAS in the presence of bounded uncertainties. This safety distance can be leveraged to inform trajectory generation algorithms. The proposed bound establishes a rigorous safety margin when the fleet deviates from the planned trajectories, both temporally and spatially. For its derivation the paper assumes the UAS implement a distributed coordination algorithm that allows the fleet to maintain their schedules synchronized within a bounded temporal error, and a path-following algorithm that lets the vehicles track a target that moves along the planned trajectory with a bounded spatial error.

autonomy↗

SMARTER Rules-Based Distributed Deconfliction of ADMS Applications

A conceptual numerical methodology derived from Grid Architecture principles is introduced for deconflicting setpoints issued by multiple advanced distribution management system applications. The methodology applies technical, economic, environmental, and social rules to eliminate non-viable combinations. The concept of temporal equipment controls budgets is introduced to preserve the health of physical assets and avoid equipment damage through repeated controls cycling. The rules are combined with a multi-criteria decision-making framework to select a near-optimal set of deconflicted setpoints using a set of qualitative and quantitative decision criteria selected by the distribution system operator. Numerical results are demonstrated on the IEEE 123-bus test feeder for three competing applications. Three alternative distributed schemes are used to decompose the problem: by topological area, by phase, and fully decentralized. The fully decentralized implementation is shown to yield near-optimal deconfliction results with significantly reduced computational time.

Anderson, Alexander A.↗

Application Deconfliction Characterization and Alternatives Analysis

This report provides an overview of the domain space and solution techniques that could be used to create a robust, flexible app deconfliction service. Three approaches are reviewed with summaries of the characteristics, elements, and results from preliminary demonstrations of solution techniques based on each approach: 1) rules and heuristics, 2) cooperation, and 3) optimization. The strengths and weaknesses of each solution technique were explored through a set of numerical demonstrations on modified IEEE 123 node and 9500 node test feeders. An alternatives analysis of individual deconfliction elements was performed with each solution technique element evaluated against criteria reflecting the dynamic app environment, need to balance app objectives, and scalability issues versus the number of applications, setpoints, and distributed control areas. It is anticipated that a combined solution for a GridAPPS-D Deconfliction Service can be formulated using a combination of elements from each solution technique. The combined solution would combine 1) device control budgets to reduce the size of the solution space by constraining system setpoints to those will not result in accelerated degradation of physical assets, 2) system operations rules to constrain the solution space by eliminating setpoints that result in violations of system limits or operational best practices, 3) contextual status signals shared with or among apps such that they could update their desired setpoints based on the evolving context, 4) a mediator that incentivizes apps to come to a cooperative solution, and 5) Setpoint-informed optimization as a fallback mechanism if a cooperative solution cannot be agreed upon by applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Strategic Deconfliction of Small Unmanned Aircraft Using Operational Volume Blocks at Crossing Waypoints

In this research, first, analytical case studies are performed to understand the parameters on which the minimum temporal separation between unmanned aircraft at crossing waypoints is dependent for enabling strategic deconfliction. The analytical expressions show that the minimum temporal separation is a function of the length and width of operational volume blocks, the relative positions of the active operational volume blocks, groundspeed of unmanned aircraft, and the incoming crossing angle. Next, the parametric study shows that the impact of the incoming crossing angle on the minimum temporal separation at a crossing waypoint increases with an increase in the width of the operational volume blocks. Finally, simulation studies are performed to understand the impact of operational volume block sizing, on-demand departure rate, minimum departure time separation, and the incoming crossing angle on the average ground delay of unmanned aircraft traveling on two routes with a single crossing waypoint and identical on-demand departure rate. Each unmanned aircraft’s estimated time of arrival at a crossing waypoint is adjusted by introducing a ground delay in departure time; no other controls (e.g., speed adjustments) are applied for strategic deconfliction. Simulation studies show that the impact of the minimum temporal separation at a crossing waypoint on the average ground delay of flights is negligible if the minimum departure time separation is at least two times the minimum temporal separation. Therefore, with an increase in minimum departure time separation at a depot, the impact of increased length of operational volume blocks enclosing the crossing waypoint on the ground delay is offset to an extent.

Operational intent↗

Strategic Deconfliction of Small Unmanned Aircraft Using Operational Volume Blocks at Crossing Waypoints

In this research, first, analytical case studies are performed to understand the parameters on which the minimum temporal separation between unmanned aircraft at crossing waypoints is dependent for enabling strategic deconfliction. The analytical expressions show that the minimum temporal separation is a function of the length and width of operational volume blocks, the relative positions of the active operational volume blocks, groundspeed of unmanned aircraft, and the incoming crossing angle. Next, the parametric study shows that the impact of the incoming crossing angle on the minimum temporal separation at a crossing waypoint increases with an increase in the width of the operational volume blocks. Finally, simulation studies are performed to understand the impact of operational volume block sizing, on-demand departure rate, minimum departure time separation, and the incoming crossing angle on the average ground delay of unmanned aircraft traveling on two routes with a single crossing waypoint and identical on-demand departure rate. Each unmanned aircraft’s estimated time of arrival at a crossing waypoint is adjusted by introducing a ground delay in departure time; no other controls (e.g., speed adjustments) are applied for strategic deconfliction. Simulation studies show that the impact of the minimum temporal separation at a crossing waypoint on the average ground delay of flights is negligible if the minimum departure time separation is at least two times the minimum temporal separation. Therefore, with an increase in minimum departure time separation at a depot, the impact of increased length of operational volume blocks enclosing the crossing waypoint on the ground delay is offset to an extent.

Operational Intent↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗

Spatial and Temporal Deconfliction of Trajectories in the Presence of Uncertainties

Demonstration of conflict-free movement for multi-agent teams in challenging scenarios is crucial in developing trust and trustworthiness in an autonomous transport system. Tolerance verification queries are explored as a mechanism to enforce spatial and temporal deconfliction for a cooperating team of Unmanned Aerial Systems (UAS) with prescribed heterogeneous path-following performance. Obstacles in the environment are modelled as set of polyhedra, whereas each vehicle’s trajectory is represented as a sequence of polynomial curves with C2 continuity, expressed in a Bernstein basis. Each vehicle is modelled as a point mass and a safety distance, informed by the geometry of the UAS and the worst-case path-following error. This defines a tube around the trajectories where each UAS is most likely to fly through. In addition, obstacles in the environment have an associated safety buffer around them to account for the uncertainty in their location and geometric description. The tolerance verification queries explored in this paper combine the safety distance information from each UAS and environmental hazard to compute trajectories that are contained within the safe configuration space. Tolerance verification is also compared with other proximity queries to determine the suitability of each method along the different steps of the trajectory generation algorithm. This paper analyzes the fitness and performance of three proximity queries – collision, tolerance verification, and distance computations – between polyhedral and polynomial curves to ensure deconfliction between obstacles and vehicles, but also between polynomial curves to guarantee safe separation among cooperating UAS.

trajectory generation↗

Sharing Operational Intent with Containment Confidence Level for Negotiating Deconfliction in Upper Class E Airspace

Community-based Cooperative Separation Management (CSM) is expected to provide separation services in Upper Class E airspace (near and above FL600). Under CSM, operators are responsible for maintaining separation. The CSM concept is enabled by sharing Operational Intent (OI) among the operators to ensure common situation awareness. The OI is represented as four-dimensional (time and space) information that indicates where an aircraft would be contained within the space and time, with a known level of confidence. However, each vehicle’s ability to stay within its region of OI may differ based on each vehicle’s performance characteristics, resulting in varying OI sizes among the vehicles. Such varying OI size could adversely affect efficient and fair access to the airspace. In this paper, an OI-generation algorithm under varying OI size restriction with Containment Confidence Level (CCL) is presented. High-Altitude Long Endurance (HALE) balloon operations are used as an example application. A framework is presented by which CCL information is used in the deconfliction process. A fast-time simulation experiment is conducted to evaluate the feasibility of the proposed framework. The simulation results show a reduced number of unnecessary deconfliction actions.

Upper Class E Traffic Management↗

Sharing Operational Intent with Containment Confidence Level for Negotiating Deconfliction in Upper Class E Airspace

Community-based Cooperative Separation Management (CSM) is expected to provide separation services in Upper Class E airspace (near and above FL600). Under CSM, operators are responsible for maintaining separation. The CSM concept is enabled by sharing Operational Intent (OI) among the operators to ensure common situation awareness. The OI is represented as four-dimensional (time and space) information that indicates where an aircraft would be contained within the space and time, with a known level of confidence. However, each vehicle’s ability to stay within its region of OI may differ based on each vehicle’s performance characteristics, resulting in varying OI sizes among the vehicles. Such varying OI size could adversely affect efficient and fair access to the airspace. In this paper, an OI-generation algorithm under varying OI size restriction with Containment Confidence Level (CCL) is presented. High-Altitude Long Endurance (HALE) balloon operations are used as an example application. A framework is presented by which CCL information is used in the deconfliction process. A fast-time simulation experiment is conducted to evaluate the feasibility of the proposed framework. The simulation results show a reduced number of unnecessary deconfliction actions.

Upper Class E Traffic Management, ETM, Cooperative↗

Conjunction Assessment and Deconfliction Paradigm for Co-Located Satellite Constellations With on-Spacecraft “Autonomous” Flight Dynamics Control

Satellite constellations that employ on-spacecraft flight dynamics and conjunction assessment (CA) approaches face particular challenges. First, they must arrange to obtain and upload to the constellation satellite close approach information, such as Conjunction Data Messages, so that their on-board systems will have the data they need to make informed CA decisions. Second, given current latencies in obtaining CA screening information, such systems often cannot obtain dedicated screenings of their proposed maneuvers before they are executed. Third, they usually cannot engage in real time with owner/operators (O/Os) with whom they may come into conjunction, relying instead on pre-arranged courses of action that may or may not fit a given situation well. Despite these difficulties, it is nonetheless possible, as operators such as SpaceX have demonstrated, to operate safely using on-board CA calculations, in the presence of a largely collaborative operating environment. The situation breaks down, however, when two constellations that operate with such a paradigm are placed in the same orbital region and will experience conjunctions with each other. Each may have a vague idea of where the other’s satellites are, or perhaps even a somewhat precise idea if they exchange O/O ephemerides, but neither will know the other’s more immediate maneuver intentions, especially for situations in which they are in a high-risk conjunction with each other and a mitigation maneuver is required. As there is no formalized way for these automated systems to ascertain each other’s intentions for this type of conjunction, it is quite possible that each spacecraft may choose a maneuver that results in the two objects’ colliding. An opportunity to develop a solution to this problem was presented by the NASA “Starling” project, a small experimental constellation developed to demonstrate autonomous satellite control and constellation reconfiguration and for which a launch was obtained that, serendipitously, will place this constellation close to the SpaceX Starlink constellation. Because the NASA constellation is experimental, an extended mission part of the mission has been negotiated to implement and test mechanisms for resolving the problem of co-located constellations with on-board flight dynamics control. For the last eighteen months, a consortium among NASA Ames (the Starling satellite providers), NASA CARA (the Agency organization responsible for conjunction assessment), Space X, and the Department of Commerce (in observer status) has met regularly to assemble a concept of operations for a robust solution to this problem and has developed a prototype ground node that will serve as a needed CA screening and information dispensary. The approach and methods, as well as the active employment of the developed ground node, will be tested both in simulation before actual use and then in actual spacecraft operations, which are anticipated to begin in January 2024. This paper will describe the co-located autonomously-controlled constellation problem and the developed solution in detail, outlining what ground node (i.e., government) infrastructure and features are required, what particular capabilities are needed by the constellations themselves in order to make use of this deconfliction paradigm, and the migration path forward to allow such a capability set to be incorporated by the Department of Commerce’s space traffic coordination system.

Conjunction Assessment↗