SEARCH · Search NASA

Results for “Routing algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Modeling and Evaluation of Miles-in-Trail Restrictions in the National Air Space

Miles-in-trail restrictions impact flights in the national air space on a daily basis and these restrictions routinely propagate between adjacent Air Route Traffic Control Centers. Since overly restrictive or ineffective miles-in-trail restrictions can reduce the overall efficiency of the national air space, decision support capabilities that model miles-in-trail restrictions should prove to be very beneficial. This paper presents both an analytical formulation and a linear programming approach for modeling the effects of miles-in-trail restrictions. A methodology for monitoring the conformance of an existing miles-in-trail restriction is also presented. These capabilities have been implemented in the Future ATM Concepts Evaluation Tool for testing purposes. To allow alternative restrictions to be evaluated in post-operations, a new mode of operation, which is referred to as the hybrid-playback mode, has been implemented in the simulation environment. To demonstrate the capabilities of these new algorithms, the miles-in-trail restrictions, which were in effect on June 27, 2002 in the New York Terminal Radar Approach Control, are examined. Results from the miles-in-trail conformance monitoring functionality are presented for the ELIOT, PARKE and WHITE departure fixes. In addition, the miles-in-trail algorithms are used to assess the impact of alternative restrictions at the PARKE departure fix.

Grabbe, Shon↗

DOE OSTI2019

Machine-Learning-Based Predictive Modeling of Glass Transition Temperatures: A Case of Polyhydroxyalkanoate Homopolymers and Copolymers

Polyhydroxyalkanoate-based polymers—being ecofriendly, biosynthesizable, and economically viable and possessing a broad range of tunable properties—are currently being actively pursued as promising alternatives for petroleum-based plastics. The vast chemical complexity accessible within this class of polymers gives rise to challenges in the rational discovery of novel polymer chemistries for specific applications. Here, the burgeoning field of polymer informatics addresses this challenge via providing tools and strategies for accelerated property prediction and materials design via surrogate machine-learning models built on reliable past data. In this contribution, we use glass transition temperature T g as an example target property to demonstrate promise of the data-enabled route to accelerated learning of accurate structure–property mappings in PHA-based polymers. Our analysis uses a data set of experimentally measured T g values, polymer molecular weights, and a polydispersity index for PHA-based homo- and copolymers that was carefully assembled from the literature. A fingerprinting scheme that captures key properties based on topology, shape, and charge/polarity of specific chemical units or motifs forming the polymer backbone was devised to numerically represent the polymers. A validated statistical learning model is then developed to allow for a mapping of the polymer fingerprints onto the property space in a physically meaningful and reliable manner. Once developed, the model can not only rapidly predict the property of new PHA polymers but also provide uncertainties underlying the predictions. The model is further combined with an evolutionary-algorithm-based search strategy to efficiently identify multicomponent polymer compositions with a prespecified T g . While the present contribution is focused specifically on T g , the surrogate model development approach put forward here is general and can, in principle, be extended to a range of other properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗

NASA NTRS2005

Pre-Launch GOES-R Risk Reduction Activities for the Geostationary Lightning Mapper

The GOES-R Geostationary Lightning Mapper (GLM) is a new instrument planned for GOES-R that will greatly improve storm hazard nowcasting and increase warning lead time day and night. Daytime detection of lightning is a particularly significant technological advance given the fact that the solar illuminated cloud-top signal can exceed the intensity of the lightning signal by a factor of one hundred. Our approach is detailed across three broad themes which include: Data Processing Algorithm Readiness, Forecast Applications, and Radiance Data Mining. These themes address how the data will be processed and distributed, and the algorithms and models for developing, producing, and using the data products. These pre-launch risk reduction activities will accelerate the operational and research use of the GLM data once GOES-R begins on-orbit operations. The GLM will provide unprecedented capabilities for tracking thunderstorms and earlier warning of impending severe and hazardous weather threats. By providing direct information on lightning initiation, propagation, extent, and rate, the GLM will also capture the updraft dynamics and life cycle of convective storms, as well as internal ice precipitation processes. The GLM provides information directly from the heart of the thunderstorm as opposed to cloud-top only. Nowcasting applications enabled by the GLM data will expedite the warning and response time of emergency management systems, improve the dispatch of electric power utility repair crews, and improve airline routing around thunderstorms thereby improving safety and efficiency, saving fuel and reducing delays. The use of GLM data will assist the Bureau of Land Management (BLM) and the Forest Service in quickly detecting lightning ground strikes that have a high probability of causing fires. Finally, GLM data will help assess the role of thunderstorms and deep convection in global climate, and will improve regional air quality and global chemistry/climate modeling. The GLM has a robust design that benefits and improves upon its strong heritage of NASA-developed LEO predecessors, the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS). GLM will have a substantially larger number of pixels within the focal plane, two lens systems, and multiple Real-Time Event Processors REPS for on-board event detection and data compression to provide continuous observations of the Americas and adjacent oceans.

Goodman, S. J.↗

NASA NTRS2015

Air Traffic Management Technology Demonstration (ATD-1) - Concept to Operations

DEMO↗

DOE OSTI2021

Dynamical vertex approximation for many-electron systems with spontaneously broken SU(2) symmetry

We generalize the formalism of the dynamical vertex approximation (DΓA)—a diagrammatic extension of the dynamical mean-field theory (DMFT)—to treat magnetically ordered phases. To this aim, we start by concisely illustrating the many-electron formalism for performing ladder resummations of Feynman diagrams in systems with broken SU(2) symmetry associated to ferromagnetic (FM) or antiferromagnetic (AF) order. We then analyze the algorithmic simplifications introduced by taking the local approximation of the two-particle irreducible vertex functions in the Bethe-Salpeter equations, which defines the ladder implementation of DΓA for magnetic systems. The relation of this assumption with the DMFT limit of large coordination-number/high dimensions is explicitly discussed. As a last step, we derive the expression for the ladder DΓA self-energy in the FM- and AF-ordered phases of the Hubbard model. The physics emerging in the AF-ordered case is explicitly illustrated by means of approximated calculations based on a static mean-field input for DΓA equations. The results obtained capture fundamental aspects of both metallic and insulating ground states of two-dimensional antiferromagnets, providing a reliable compass for future, more extensive applications of our approach. Furthermore, possible routes to further develop diagrammatic-based treatments of magnetic phases in correlated electron systems are briefly outlined in the Conclusions.

2-dimensional systems↗

DOE OSTI2011

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associated with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N{sub 2} improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2021

A data-driven operational model for traffic at the Dallas Fort Worth International Airport

Airports are on the front line of significant innovations, allowing the movement of more people and goods faster, cheaper, and with greater convenience. As air travel continues to grow, airports will face challenges in responding to increasing passenger vehicle traffic, which leads to lower operational efficiency, poor air quality, and security concerns. This paper evaluates methods for traffic demand forecasting combined with traffic microsimulation, which will allow airport operations staff to accurately predict traffic and congestion. Using two years of detailed data describing individual vehicle arrivals and departures, aircraft movements, and weather at Dallas-Fort Worth (DFW) International Airport, we evaluate multiple prediction methods including the Auto Regressive Integrated Moving Average (ARIMA) family of models, traditional machine learning models, and DeepAR, a modern recurrent neural network (RNN). We find that these algorithms are able to capture the diurnal trends in the surface traffic, and all do very well when predicting the next 30 minutes of demand. Longer forecast horizons are moderately effective, demonstrating the challenge of this problem and highlighting promising techniques as well as potential areas for improvement. Traffic demand is not the only factor that contributes to terminal congestion, because temporary changes to the road network, such as a lane closure, can make benign traffic demand highly congested. Combining a demand forecast with a traffic microsimulation framework provides a complete picture of traffic and its consequences. The result is an operational intelligence platform for exploring policy changes, as well as infrastructure expansion and disruption scenarios. To demonstrate the value of this approach, we present results from a case study at DFW Airport assessing the impact of a policy change for vehicle routing in high demand scenarios. This framework can assist airports like DFW as they tackle daily operational challenges, as well as explore the integration of emerging technology and expansion of their services into long term plans.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

A first-principles theoretical approach to heterogeneous nanocatalysis

A theoretical approach to heterogeneous catalysis by sub-nanometre supported metal clusters and alloys is presented and discussed. Its goal is to perform a computational sampling of the reaction paths in nanocatalysis via a global search in the phase space of structures and stoichiometry combined with filtering which takes into account the given experimental conditions (catalytically relevant temperature and reactant pressure), and corresponds to an incremental exploration of the disconnectivity diagram of the system. The approach is implemented and applied to the study of propylene partial oxidation by Ag3 supported on MgO(100). First-principles density-functional theory calculations coupled with a Reactive Global Optimization algorithm are performed, finding that: (1) the presence of an oxide support drastically changes the potential energy landscape of the system with respect to the gas phase, favoring configurations which interact positively with the electrostatic field generated by the surface; (2) the reaction energy barriers for the various mechanisms are crucial in the competition between thermodynamically and kinetically favored reaction products; (3) a topological database of structures and saddle points is produced which has general validity and can serve for future studies or for deriving general trends; (4) the MgO(100) surface captures some major features of the effect of an oxide support and appears to be a good model of a simple oxide substrate; (5) strong cooperative effects are found in the co-adsorption of O2 and other ligands on small metal clusters. The proposed approach appears as a viable route to advance the role of predictive computational science in the field of heterogeneous nanocatalysis.

Chemistry↗

DOE OSTI2023

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗

DOE OSTI2025

Mixed quantum-classical methods for polaron spectral functions

In this work, using two distinct semiclassical approaches—namely, the mean-field Ehrenfest method and the mapping approach to surface hopping—we investigate the spectral function of a single charge interacting with phonons on a lattice. This quantity is relevant for the description of angle-resolved photoemission experiments. Focusing on the one-dimensional Holstein model, we compare the performance of these approaches across a range of coupling strengths and lattice sizes, exposing the relative strengths and weaknesses of each. We demonstrate that these approaches can be efficiently applied with reasonable accuracy to ab initio polaron models. Furthermore, our work provides a route to the calculation of spectral properties in realistic electron–phonon-coupled systems in a computationally inexpensive manner with encouraging accuracy.

Atomic and molecular spectra↗

DOE OSTI2019

Characterization of local morphology and availability of triple-phase boundaries in solid oxide cell electrodes

The performance of solid oxide cells is known to be dependent upon the density of three phase boundaries (TPB), but the potential for improving their effective electrocatalytic activity by morphological adjustments is imprecisely known. A spilling algorithm was developed to characterize the surfaces available for diffusion at TPBs. It scans each slice in a 3-D imaging dataset to measure the interfaces between the solid and the pore phases at each TPB. Because of the stereological approach, these surfaces are defined as “available lengths” (L A ). The measurement was tested on artificial packed spheres structures with controlled properties and a percolation theory-based model before application to a real Ni-YSZ. The L A distributions cover 2 orders of magnitude. The subset shorter than the extent of diffusion profiles reported in the literature is in the range of 3% and 20% for Ni and YSZ, respectively, suggesting possible limitations of their effective electrocatalytic properties. The average L A is larger on YSZ than on Ni, which is a trend opposite to the phase diameter. The available length analysis revealed microstructural characteristics that stem from the manufacturing route and cannot be identified by the inspection of standard metric and topological properties. A strong correlation between the available length and the extension of TPB lines is observed for Ni but not for YSZ, despite the predominance of convex shapes, which likely originates from the Ni reduction. This suggests possibilities for controlling the available length by the manufacturing route, depending specifically on the electrocatalytic properties of the phases in composite materials.

3-D electron microscopy↗

DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1995

B-ISBN Onboard Processing Fast Packet Switch Developed

Future satellite communications applications will require a packet-switched onboard satellite processing system to route packets at very high speeds from uplink beams to different downlink beams. The rapid emergence of point-to-multipoint services, and the important role of satellites in a national and global information infrastructure, makes the multicast function essential to a fast packet switch (FPS). NASA Lewis Research Center's Digital System Technology Branch has been studying possible architectures for high-speed onboard-processing satellite systems. As part of this research, COMSAT Laboratories developed a broadband integrated services digital network (B-ISDN) fast packet switch for Lewis that was delivered on December 1994. The fast packet switch consists of eight inputs and eight outputs that can receive and transmit data, respectively, at a rate of 155 Mbps. The switch features multiple priorities (three) and multiple-size (three) satellite virtual cells that are similar to ATM cells in length (52 bytes). In addition, the fast packet switch features a congestion-control algorithm that allows users to set different thresholds for individual destination ports, thus throttling back the traffic from the transmitting port.

Source record↗

NASA NTRS1991

Multiphase complete exchange on a circuit switched hypercube

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy.

Bokhari, Shahid H.↗

DOE OSTI2021

Investigating the Chinese postman problem on a quantum annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution

36 MATERIALS SCIENCE↗

NASA NTRS2015

Methodology to Define Delivery Accuracy Under Current Day ATC Operations

In order to enable arrival management concepts and solutions in a NextGen environment, ground- based sequencing and scheduling functions have been developed to support metering operations in the National Airspace System. These sequencing and scheduling algorithms as well as tools are designed to aid air traffic controllers in developing an overall arrival strategy. The ground systems being developed will support the management of aircraft to their Scheduled Times of Arrival (STAs) at flow-constrained meter points. This paper presents a methodology for determining the undelayed delivery accuracy for current day air traffic control operations. This new method analyzes the undelayed delivery accuracy at meter points in order to understand changes of desired flow rates as well as enabling definition of metrics that will allow near-future ground automation tools to successfully achieve desired separation at the meter points. This enables aircraft to meet their STAs while performing high precision arrivals. The research presents a possible implementation that would allow delivery performance of current tools to be estimated and delivery accuracy requirements for future tools to be defined, which allows analysis of Estimated Time of Arrival (ETA) accuracy for Time-Based Flow Management (TBFM) and the FAA's Traffic Management Advisor (TMA). TMA is a deployed system that generates scheduled time-of-arrival constraints for en- route air traffic controllers in the US. This new method of automated analysis provides a repeatable evaluation of the delay metrics for current day traffic, new releases of TMA, implementation of different tools, and across different airspace environments. This method utilizes a wide set of data from the Operational TMA-TBFM Repository (OTTR) system, which processes raw data collected by the FAA from operational TMA systems at all ARTCCs in the nation. The OTTR system generates daily reports concerning ATC status, intent and actions. Due to its availability, ease of use, and vast collection of data across several airspaces it was determined that the OTTR data set would be the best method to utilize moving forward with this analysis. The particular variables needed for further analysis were determined along with the necessary OTTR reports, by working closely with the repository team additional analysis reports were developed that provided key ETA and STA information at the freeze horizon. One major benefit of the OTTR data is that using the correct reports the data across several airports could be analyzed over large periods of time. The OTTR data processes the TBFM data daily and is stored in various formats across several airspaces. This allowed us to develop our own parsing methods and raw data processing that would not rely on other computationally expensive tools that perform more in depth analysis of similar sets of data. The majority of this work consisted of the development of the ability to filter flights to create a subset of flights that could be considered undelayed, which is defined as a flight at the freeze horizon with an ETA and STA difference that was minimal or close to zero. This was a broad method that allowed the consideration of a large data set which consisted of all the traffic across a two month period in 2013, the hottest and coldest months, arriving into four airports: George Bush Intercontinental, Denver International, Los Angeles International, and Phoenix Sky Harbor.

delivery accuracy↗

NASA NTRS2018

ADS-B Mixed sUAS and NAS System Capacity Analysis and DAA Performance

Automatic Dependent Surveillance-Broadcast (ADS-B) technology was introduced more than twenty years ago to improve surveillance within the US National Airspace Space (NAS) as well as in many other countries. Via the NextGen initiative, implementation of ADS-B technology across the US is planned in stages between 2012 and 2025. ADS-B's automatic one second epoch packet transmission exploits on-board GPS-derived navigational information to provide position information, as well as other information including vehicle identification, ground speed, vertical rate and track angle. The purpose of this technology is to improve surveillance data accuracy and provide access to better situational awareness to enable operational benefits such as shorter routes, reduced flight time and fuel burn, and reduced traffic delays, and to allow air traffic controllers to manage aircraft with greater safety margins. Other than the limited amount of information bits per packet that can be sent, ADS-B's other hard-limit limitation is capacity. Small unmanned aircraft systems (sUAS) can utilize limited ADS-B transmission power, in general, thus allowing this technology to be considered for use within a combined NAS and sUAS environment, but the potential number and density of sUAS predicted for future deployment calls into question the ability of ADS-B systems to meet the resulting capacity requirement. Hence, studies to understand potential limitations of ADS-B to fulfill capacity requirements in various sUAS scenarios are of great interest. In this paper we, validate/improve on, previous work performed by the MITRE Corporation concerning sUAS power and capacity in a sUAS and General Aviation (GA) mixed environment. In addition, we implement its inherent media access control layer capacity limitations which was not shown in the MITRE paper. Finally, a simple detect and avoid (DAA) algorithm is implemented to display that ADS-B technology is a viable technology for a mixed NAS/sUAS environment even in proposed larger mixed density environments.

Matheou, Konstantin J.↗