Search NASA⌕ Search

SEARCH · Search NASA

Results for “avoiding communication”

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 91 records · Page 5

Drone Video Platform—Collision Avoidance, Situational Awareness, and Communications

Small unmanned aerial systems are ideal for delivering sensors into areas that are inaccessible or too dangerous for human entry or manned aircraft over-flights. The systems can fly low and slow for enhanced sensitivity and in tight spaces where ordinary aircraft could never fit. We have configured and flown sensor payloads for radiation, chemical, and optical detection on small fixed-wing and rotary-wing aircraft. All the sensor packages provide telemetry, GPS coordinates, LIDAR distance ranging, and absolute time of day to microsecond accuracy. Payload weights range from less than 1 kg up to 5.5 kg. Currently, communications are over 2.4 GHz and 915 MHz radios, as well as over 4G LTE cellular data links. Real-time data feeds from the sensor payloads to web browser clients anywhere in the world are possible via a virtual EC2 server on the Amazon AWS cloud. In FY 2019, the Nevada National Security Site teamed with Virginia Tech, H3D Corp., and Unmanned Systems, Inc. to accomplish the four flight missions described in this report. A large part of this year’s mission goals were to demonstrate the ability to fly beyond visual line of sight (BVLOS).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Channel hopping method of interference avoidance for a wireless communication network and wireless communication system employing the same

A wireless communication system includes a wireless master node having a plurality of channels, and a number of wireless slave nodes having a plurality of the channels. The master node and the slave nodes are structured to wirelessly communicate over a particular channel. The master node and the slave nodes are structured to decide to hop to a different channel. The master node and the slave nodes are structured to select: (a) the different channel, in order to be as far away as possible from a number of the channels, which are known to cause interference to wireless communications between the master node and the slave nodes, or (b) the different channel, in order to be as close as possible to one of the channels of a different master node, which is compatible with the former master node, but without the different channel being employed by the different master node.

42 ENGINEERING↗

Scalable Nonlinear Compact Schemes

In this work, we focus on compact schemes resulting in tridiagonal systems of equations, specifically the fifth-order CRWENO scheme. We propose a scalable implementation of the nonlinear compact schemes by implementing a parallel tridiagonal solver based on the partitioning/substructuring approach. We use an iterative solver for the reduced system of equations; however, we solve this system to machine zero accuracy to ensure that no parallelization errors are introduced. It is possible to achieve machine-zero convergence with few iterations because of the diagonal dominance of the system. The number of iterations is specified a priori instead of a norm-based exit criterion, and collective communications are avoided. The overall algorithm thus involves only point-to-point communication between neighboring processors. Our implementation of the tridiagonal solver differs from and avoids the drawbacks of past efforts in the following ways: it introduces no parallelization-related approximations (multiprocessor solutions are exactly identical to uniprocessor ones), it involves minimal communication, the mathematical complexity is similar to that of the Thomas algorithm on a single processor, and it does not require any communication and computation scheduling.

97 MATHEMATICS AND COMPUTING↗

The Metropolis Monte Carlo method with CUDA enabled Graphic Processing Units

We present a CPU–GPU system for runtime acceleration of large molecular simulations using GPU computation and memory swaps. The memory architecture of the GPU can be used both as container for simulation data stored on the graphics card and as floating-point code target, providing an effective means for the manipulation of atomistic or molecular data on the GPU. To fully take advantage of this mechanism, efficient GPU realizations of algorithms used to perform atomistic and molecular simulations are essential. Our system implements a versatile molecular engine, including inter-molecule interactions and orientational variables for performing the Metropolis Monte Carlo (MMC) algorithm, which is one type of Markov chain Monte Carlo. By combining memory objects with floating-point code fragments we have implemented an MMC parallel engine that entirely avoids the communication time of molecular data at runtime. Our runtime acceleration system is a forerunner of a new class of CPU–GPU algorithms exploiting memory concepts combined with threading for avoiding bus bandwidth and communication. The testbed molecular system used here is a condensed phase system of oligopyrrole chains. A benchmark shows a size scaling speedup of 60 for systems with 210,000 pyrrole monomers. Our implementation can easily be combined with MPI to connect in parallel several CPU–GPU duets. -- Highlights: •We parallelize the Metropolis Monte Carlo (MMC) algorithm on one CPU—GPU duet. •The Adaptive Tempering Monte Carlo employs MMC and profits from this CPU—GPU implementation. •Our benchmark shows a size scaling-up speedup of 62 for systems with 225,000 particles. •The testbed involves a polymeric system of oligopyrroles in the condensed phase. •The CPU—GPU parallelization includes dipole—dipole and Mie—Jones classic potentials.

97 MATHEMATICS AND COMPUTING↗

A Large-Scale Analysis to Optimize the Control and V2V Communication Protocols for CDA Agreement-Seeking Cooperation

Cooperative driving automation (CDA) Class C, agreement-seeking cooperation, is an innovative and practical solution that can promote cooperation among general passenger vehicles on the road. However, more comprehensive studies are needed before establishing the standard protocols of agreement-seeking cooperation, such as communication frequency and the duration of cooperation. Here, this article presents an initiative study on the impacts of communication capabilities on agreement-seeking cooperation. Through a large-scale analysis by regulating vehicle-to-vehicle (V2V) communication metrics, this work suggests desirable system parameters that can maximize the benefits of cooperation and ensure reliable operability while avoiding exhaustive communication loads. As the first step, an example agreement-seeking cooperation system is created for a car-following scenario, including decision-making and control algorithms for autonomous vehicles. Then, software-in-the-loop tests explore the performance of the developed system as it encounters various communication risks, such as latency and message packet drops. The system performance metrics are evaluated from various angles, including the time consumed for the agreement-seeking process, cooperation ratio, and the ratio of faulty cooperation. Energy saving from the cooperation is assessed by using simulation software that can run multiple high-fidelity vehicle models simultaneously. Based on the analyses, this article suggests the V2V communication requirements for the reliable operation of CDA agreement-seeking, which can be referred to when developing the standard protocols of agreement-seeking cooperation.

42 ENGINEERING↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Leveraging Intelligent Vehicle Technologies to Maximize Fuel Economy (Presentation)

Advancements in vehicle electronics, along with communication and sensing technologies, have led to a growing number of intelligent vehicle applications. Example systems include those for advanced driver information, route planning and prediction, driver assistance, and crash avoidance. The National Renewable Energy Laboratory is exploring ways to leverage intelligent vehicle systems to achievefuel savings. This presentation discusses several potential applications, such as providing intelligent feedback to drivers on specific ways to improve their driving efficiency, and using information about upcoming driving to optimize electrified vehicle control strategies for maximum energy efficiency and battery life. The talk also covers the potential of Advanced Driver Assistance Systems(ADAS) and related technologies to deliver significant fuel savings in addition to providing safety and convenience benefits.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Fault Resilient Domain Decomposition Preconditioner for PDEs

The move towards extreme-scale computing platforms challenges scientific simulations in many ways. Given the recent tendencies in computer architecture development, one needs to reformulate legacy codes in order to cope with large amounts of communication, system faults and requirements of low-memory usage per core. In this work, we develop a novel framework for solving partial differential equations (PDEs) via domain decomposition that reformulates the solution as a state-of-knowledge with a probabilistic interpretation. Such reformulation allows resiliency with respect to potential faults without having to apply fault detection, avoids unnecessary communication and is generally well-positioned for rigorous uncertainty quantification studies that target improvements of predictive fidelity of scientific models. We demonstrate our algorithm for one-dimensional PDE examples where artificial faults have been implemented as bit-flips in the binary representation of subdomain solutions.

97 MATHEMATICS AND COMPUTING↗

Exploration Systems Development (ESD) Approach to Enterprise Risk Management

The National Aeronautics and Space Administration (NASA) Exploration Systems Development (ESD) Division has implemented an innovative approach to Enterprise Risk Management under a unique governance structure and streamlined integration model. ESD's mission is to design and build the capability to extend human existence to deep space. The Enterprise consists of three Programs: Space Launch System (SLS), Orion, and Ground Systems Development and Operations (GSDO). The SLS is a rocket and launch system that will be capable of powering humans, habitats, and support systems to deep space. Orion will be the first spacecraft in history capable of taking humans to multiple destinations within deep space. GSDO is modernizing Kennedy's spaceport to launch spacecraft built and designed by both NASA and private industry. ESD's approach to Enterprise Risk Management is commensurate with affordability and a streamlined management philosophy. ESD Enterprise Risk Management leverages off of the primary mechanisms for integration within the Enterprise. The Enterprise integration approach emphasizes delegation of authority to manage and execute the majority of cross-program activities and products to the individual Programs, while maintaining the overall responsibility for all cross-program activities at the Division. The intent of the ESD Enterprise Risk Management approach is to improve risk communication, to avoid replication and/or contradictory strategies, and to minimize overhead process burden. This is accomplished by the facilitation and integration of risk information within ESD. The ESD Division risks, Orion risks, SLS risks, and GSDO risks are owned and managed by the applicable Program. When the Programs have shared risks with multiple consequences, they are jointly owned and managed. When a risk is associated with the integrated system that involves more than one Program in condition, consequence, or mitigation plan, it is considered an Exploration Systems Integration (ESI) Risk. An ESI risk may require visibility and risk handling by multiple organizations. The Integrated Risk Working Group (IRWG) is a small team of Risk experts that are responsible for collaborating and communicating best practices. In addition, the forum facilitates proper integration of risks across the Enterprise. The IRWG uses a Continuous Risk Management approach for facilitating the identification, analysis, planning, tracking, and controlling of ESI Risks. The ESD Division, Programs, and Integrated Task Teams identify ESI Risks. The IRWG maintains a set of metrics for understanding Enterprise Risk process and the overall Risk Posture. The team is also actively involved in the modeling of risk for Enterprise Performance Management. With the Enterprise being constrained in Schedule and Budget, and with significant technical complexity, the appropriate use of Risk Management techniques is crucial to the success of the Enterprise. The IRWG achieves this through the modified approach, providing a forum for collaboration on risks that cross boundaries between the separate entities.

Bauder, Stephen P.↗

NASA’s Moon Trek Portal: New Capabilities Supporting Mission Planning and Engagement

Introduction: NASA’s Moon Trek (https://trek.nasa.gov/moon/) is one of a growing number of interactive, browser-based, online portals for planetary data visualization and analysis produced by NASA’s Solar System Treks Project (SSTP). Moon Trek continues to be enhanced with new data and new capabilities enabling it to facilitate the planning and conducting of upcoming lunar missions by NASA, its commercial partners, and its international partners, as well as advancing its role as a valuable outreach tool. A Comprehensive Online Web Portal: Developed at NASA’s Jet Propulsion Laboratory (JPL) and managed as a project of NASA’s Solar System Exploration Research Virtual Institute (SSERVI) at NASA Ames Research Center, Moon Trek is a browser-based web portal. The portal provides easy-to-use tools for browsing, data layering, data product blending, and feature search among thousands of data products covering topography, mineralogy, elemental abundance, geology, and much more. Visualizations are provided in var-ious map projections, interactive 3D viewing, and in virtual reality. Using an in-house stereo workflow, SSTP is able to produce new NAC-based high-resolution mosaics and DEMs. Diverse Applications for Lunar Exploration: Baseline analytic tools available to all users include dis-tance measurement, elevation profiling, sun angle calculation, and 3D print file generation. More advanced account-level tools allow users to perform more computationally intensive analyses. These include ray-traced lighting analysis for user-specified areas over user-specified time/date ranges and time intervals, electro-static surface potential analysis, subsetting of large data products, slope analysis, and Lunar Laser Ranging geometry calculation. Artificial intelligence (AI) and ma-chine learning (ML) based tools have been implemented for crater detection and hazard analysis, boulder detection and hazard analysis, and rockfall detection. New Tools Facilitating Exploration: Additional, new tools have recently been added and others are in development, offering even greater functionality in con-ducting analyses of potential landing sites and areas of surface operations. The new Line-of-Sight tool facilitates communications planning between locations on the lunar surface, between any given site on the lunar surface and a specified ground station on the Earth, and between a site on the lunar surface and a relay asset in lunar orbit, all taking into account local lunar topography. The new Data Plotter tool provides both tabular and graphical representations of pixel values along a user specified path for a growing number of data products. The new NAC Finder tool will identify and pro-vide access to NAC images that intersect a user-defined path or bounded area. The SSTP development team is looking to leverage the capabilities of its existing AI and ML crater, boulder, and rockfall detection and analysis tools, and extend that technology to a generalized feature detector that can be trained on instances of specific types of landforms and then search the lunar surface for more examples of such features. New traverse planning tools are being developed with use cases in generalized concept studies and specific mission planning in mind. These will facilitate finding optimal traverse paths based on constraints such as slope, lighting, hazard avoidance, and communications. These will be complemented by new traverse visualization capabilities. Users will be able to interactively ride along with a rover, examining 3D views of the terrain while adjusting camera height and viewing angle along with selecting different data layer overlays to drape across the terrain. Engaging the Public: The capabilities being developed for mission planning are being leveraged to further enhance Moon Trek’s proven utility as a valuable public outreach resource. This includes providing multiple lev-els of engagement with different points of entry. At its simplest level, promoting understanding through visualization, media and the public will be able to easily visualize and conduct their own exploration of lunar sites targeted by NASA and its partners. For a more in-depth experience, we are working with our stakeholders to promote understanding through interaction by extend-ing our current landing site and traverse analysis capabilities, making simplified access to these tools available to those who want to explore more deeply key factors in planning a mission through interactive and possibly even gamified experiences. The highest degree of public outreach, focusing on engagement through scientific participation, could be achieved through our work with missions and the NASA Office of the Chief Scientist on Moon Trek’s extension as a tool with specialized capabilities for facilitating citizen science. In such scenarios, participants become members of extended mis-sion science teams, using dedicated and integrated interfaces to analyze mission data to help answer questions key to lunar science and exploration. We are work-ing with NASA’s Office of Communications, museums, planetariums, and the media to help them easily integrate accurate, detailed visualizations of NASA’s lunar destinations and exploration into their content/productions and to engage diverse audiences in diverse venues.

Moon Trek↗

Automated Management of Small Unmanned Aircraft System Communications and Navigation Contingency

The number of small Unmanned Aircraft System (sUAS) operating in the low-altitude of the National Airspace System (NAS) has been rapidly increasing in the past few years and this number is expected to grow in the future. However, aside from a few special cases, all sUAS must fly within visual line-of-sight (VLOS) of their operators and this limitation is blocking highly anticipated beyond visual line-of-sight (BVLOS) sUAS applications such as package delivery from practice. To enable routine low-altitude BVLOS operations, there needs to be a traffic management ecosystem that complements the FAA’s Air Traffic Management (ATM) system, which does not provide air traffic services under 400 feet above ground level (AGL). NASA has been pioneering research and development of this ecosystem under UAS Traffic Management (UTM) project since 2015 in a series of Technical Capability Levels (TCL) activities that are increasingly complex. In TCL1, completed in 2015, visual line-of-sight operations such as agriculture, firefighting, and infrastructure monitoring were addressed with a focus on geofencing and operations scheduling. Technologies and requirements needed for BVLOS operations in sparsely populated areas were examined in TCL2 in 2016, and those for operations over moderately populated areas in TCL3 in 2017 and 2018. TCL4 is building on the earlier TCLs and focuses on technologies and requirements for operations in higher-density urban areas for tasks such as newsgathering and package delivery and for managing large-scale contingencies. To coordinate and facilitate the incremental implementation of the UTM ecosystem in the NAS, a Research Transition Team (RTT) has been formed between the FAA, NASA, and industry. The RTT is divided into four subgroups, concept and use case development, data exchange and information architecture, sense and avoid, and communications and navigation (C&N). This paper focuses on C&N subgroup activities, in particular about the development of automated sUAS communications and navigation contingency management. The goal of this development is to prepare sUAS to display predictable behavior while handling C&N off-nominal events. It is expected that the adoption of the presented automated contingency management by the sUAS community will accommodate and inform rulemaking towards governing low-altitude BVLOS operations.

Unmanned Aviation System (UAS) Traffic Management↗

Automated Management of Small Unmanned Aircraft System (UAS) Communications and Navigation Contingency

The number of small Unmanned Aircraft System (sUAS) operating in the low-altitude of the National Airspace System (NAS) has been rapidly increasing in the past few years and this number is expected to grow in the future. However, aside from a few special cases, all sUAS must fly within visual line-of-sight (VLOS) of their operators and this limitation is blocking highly anticipated beyond visual line-of-sight (BVLOS) sUAS applications such as package delivery from practice. To enable routine low-altitude BVLOS operations, there needs to be a traffic management ecosystem that complements the FAA’s Air Traffic Management (ATM) system, which does not provide air traffic services under 400 feet above ground level (AGL). NASA has been pioneering research and development of this ecosystem under UAS Traffic Management (UTM) project since 2015 in a series of Technical Capability Levels (TCL) activities that are increasingly complex. In TCL1, completed in 2015, visual line-of-sight operations such as agriculture, firefighting, and infrastructure monitoring were addressed with a focus on geofencing and operations scheduling. Technologies and requirements needed for BVLOS operations in sparsely populated areas were examined in TCL2 in 2016, and those for operations over moderately populated areas in TCL3 in 2017 and 2018. TCL4 is building on the earlier TCLs and focuses on technologies and requirements for operations in higher-density urban areas for tasks such as newsgathering and package delivery and for managing large-scale contingencies. To coordinate and facilitate the incremental implementation of the UTM ecosystem in the NAS, a Research Transition Team (RTT) has been formed between the FAA, NASA, and industry. The RTT is divided into four subgroups, concept and use case development, data exchange and information architecture, sense and avoid, and communications and navigation (C&N). This paper focuses on C&N subgroup activities, in particular about the development of automated sUAS communications and navigation contingency management. The goal of this development is to prepare sUAS to display predictable behavior while handling C&N off-nominal events. It is expected that the adoption of the presented automated contingency management by the sUAS community will accommodate and inform rulemaking towards governing low-altitude BVLOS operations.

Unmanned Aviation Systems (UAS) Traffic Management↗

Mixed precision s –step Lanczos and conjugate gradient algorithms

Compared to the classical Lanczos algorithm, the s-step Lanczos variant has the potential to improve performance by asymptotically decreasing the synchronization cost per iteration. However, this comes at a price; despite being mathematically equivalent, the s-step variant may behave quite differently in finite precision, potentially exhibiting greater loss of accuracy and slower convergence relative to the classical algorithm. It has previously been shown that the errors in the s-step version follow the same structure as the errors in the classical algorithm, but are amplified by a factor depending on the square of the condition number of the O(s)-dimensional Krylov bases computed in each outer loop. As the condition number of these s-step bases grows (in some cases very quickly) with s, this limits the s values that can be chosen and thus can limit the attainable performance. In this work, we show that if a select few computations in s-step Lanczos are performed in double the working precision, the error terms then depend only linearly on the conditioning of the s-step bases. This has the potential for drastically improving the numerical behavior of the algorithm with little impact on per-iteration performance. Our numerical experiments demonstrate the improved numerical behavior possible with the mixed precision approach, and also show that this improved behavior extends to mixed precision s-step CG. Here, we present preliminary performance results on NVIDIA V100 GPUs that show that the overhead of extra precision is minimal if one uses precisions implemented in hardware.

97 MATHEMATICS AND COMPUTING↗

Multiscale high-order/low-order (HOLO) algorithms and applications

We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models (the high-order model, HO) with low-complexity ones (the low-order model, LO). The primary goal of HOLO algorithms is to achieve nonlinear convergence between HO and LO components while minimizing memory footprint and managing the computational complexity in a practical manner. Key to the HOLO approach is the use of the LO representations to address temporal stiffness, effectively accelerating the convergence of the HO/LO coupled system. The HOLO approach is broadly underpinned by the concept of nonlinear elimination, which enables segregation of the HO and LO components in ways that can effectively use heterogeneous architectures. The accuracy and efficiency benefits of HOLO algorithms are demonstrated with specific applications to radiation transport, gas dynamics, plasmas (both Eulerian and Lagrangian formulations), and ocean modeling. Across this broad application spectrum, HOLO algorithms achieve significant accuracy improvements at a fraction of the cost compared to conventional approaches. It follows that HOLO algorithms hold significant potential for high-fidelity system scale multiscale simulations leveraging exascale computing.

97 MATHEMATICS AND COMPUTING↗

Accurate and Scalable O(N) Algorithm for First-Principles Molecular-Dynamics Computations on Large Parallel Computers

We present the first truly scalable first-principles molecular dynamics algorithm with O(N) complexity and controllable accuracy, capable of simulating systems with finite band gaps of sizes that were previously impossible with this degree of accuracy. By avoiding global communications, we provide a practical computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic wave functions are confined, and a cutoff beyond which the components of the overlap matrix can be omitted when computing selected elements of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to 101 952 atoms on 23 328 processors, with a wall-clock time of the order of 1 min per molecular dynamics time step and numerical error on the forces of less than 7x10 -4 Ha/Bohr.

36 MATERIALS SCIENCE↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

Extreme-scale Algorithms and Solver Resilience

A widening gap exists between the peak performance of high-performance computers and the performance achieved by complex applications running on these platforms. Over the next decade, extreme-scale systems will present major new challenges to algorithm development that could amplify this mismatch in such a way that it prevents the productive use of future DOE Leadership computers due to the following; Extreme levels of parallelism due to multicore processors; An increase in system fault rates requiring algorithms to be resilient beyond just checkpoint/restart; Complex memory hierarchies and costly data movement in both energy and performance; Heterogeneous system architectures (mixing CPUs, GPUs, etc.); and Conflicting goals of performance, resilience, and power requirements.

97 MATHEMATICS AND COMPUTING↗

Step 1: Human System Interface (HSI) Functional Requirements Document (FRD). Version 2

This Functional Requirements Document (FRD) establishes a minimum set of Human System Interface (HSI) functional requirements to achieve the Access 5 Vision of "operating High Altitude, Long Endurance (HALE) Unmanned Aircraft Systems (UAS) routinely, safely, and reliably in the National Airspace System (NAS)". Basically, it provides what functions are necessary to fly UAS in the NAS. The framework used to identify the appropriate functions was the "Aviate, Navigate, Communicate, and Avoid Hazards" structure identified in the Access 5 FRD. As a result, fifteen high-level functional requirements were developed. In addition, several of them have been decomposed into low-level functional requirements to provide more detail.

Source record↗