Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Time-varying data”

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.

390 records · Page 22

Peak-Seeking Optimization of Trim for Reduced Fuel Consumption: Architecture and Performance Predictions

A peak-seeking control approach for real-time trim configuration optimization for reduced fuel consumption has been developed by researchers at the National Aeronautics and Space Administration (NASA) Dryden Flight Research Center to address the goals of the NASA Environmentally Responsible Aviation project to reduce fuel burn and emissions. The peak-seeking control approach is based on a steepest-descent algorithm using a time-varying Kalman filter to estimate the gradient of a performance function of fuel flow versus control surface positions. In real-time operation, deflections of symmetric ailerons, trailing-edge flaps, and leading-edge flaps of an F/A-18 airplane (McDonnell Douglas, now The Boeing Company, Chicago, Illinois) are controlled for optimization of fuel flow. This paper presents the design and integration of this peak-seeking controller on a modified NASA F/A-18 airplane with research flight control computers. A research flight was performed to collect data to build a realistic model of the performance function and characterize measurement noise. This model was then implemented into a nonlinear six-degree-of-freedom F/A-18 simulation along with the peak-seeking control algorithm. With the goal of eventual flight tests, the algorithm was first evaluated in the improved simulation environment. Results from the simulation predict good convergence on minimum fuel flow with a 2.5-percent reduction in fuel flow relative to the baseline trim of the aircraft.

performance optimization↗

Peak-Seeking Optimization of Trim for Reduced Fuel Consumption: Architecture and Performance Predictions

A peak-seeking control approach for real-time trim configuration optimization for reduced fuel consumption has been developed by researchers at the National Aeronautics and Space Administration (NASA) Dryden Flight Research Center to address the goals of the NASA Environmentally Responsible Aviation project to reduce fuel burn and emissions. The peak-seeking control approach is based on a steepest-descent algorithm using a time-varying Kalman filter to estimate the gradient of a performance function of fuel flow versus control surface positions. In real-time operation, deflections of symmetric ailerons, trailing-edge flaps, and leading-edge flaps of an FA-18 airplane (McDonnell Douglas, now The Boeing Company, Chicago, Illinois) are controlled for optimization of fuel flow. This presentation presents the design and integration of this peak-seeking controller on a modified NASA FA-18 airplane with research flight control computers. A research flight was performed to collect data to build a realistic model of the performance function and characterize measurement noise. This model was then implemented into a nonlinear six-degree-of-freedom FA-18 simulation along with the peak-seeking control algorithm. With the goal of eventual flight tests, the algorithm was first evaluated in the improved simulation environment. Results from the simulation predict good convergence on minimum fuel flow with a 2.5-percent reduction in fuel flow relative to the baseline trim of the aircraft.

peak-seeking↗

A Symmetric Time-Varying Cluster Rate of Descent Model

A model of the time-varying rate of descent of the Orion vehicle was developed based on the observed correlation between canopy projected area and drag coefficient. This initial version of the model assumes cluster symmetry and only varies the vertical component of velocity. The cluster fly-out angle is modeled as a series of sine waves based on flight test data. The projected area of each canopy is synchronized with the primary fly-out angle mode. The sudden loss of projected area during canopy collisions is modeled at minimum fly-out angles, leading to brief increases in rate of descent. The cluster geometry is converted to drag coefficient using empirically derived constants. A more complete model is under development, which computes the aerodynamic response of each canopy to its local incidence angle.

Ray, Eric S.↗

Recovery of Large Angular Scale CMB Polarization for Instruments Employing Variable-Delay Polarization Modulators

Variable-delay Polarization Modulators (VPMs) are currently being implemented in experiments designed to measure the polarization of the cosmic microwave background on large angular scales because of their capability for providing rapid, front-end polarization modulation and control over systematic errors. Despite the advantages provided by the VPM, it is important to identify and mitigate any time-varying effects that leak into the synchronously modulated component of the signal. In this paper, the effect of emission from a 300 K VPM on the system performance is considered and addressed. Though instrument design can greatly reduce the influence of modulated VPM emission, some residual modulated signal is expected. VPM emission is treated in the presence of rotational misalignments and temperature variation. Simulations of time-ordered data are used to evaluate the effect of these residual errors on the power spectrum. The analysis and modeling in this paper guides experimentalists on the critical aspects of observations using VPMs as front-end modulators. By implementing the characterizations and controls as described, front-end VPM modulation can be very powerful for mitigating 1/ f noise in large angular scale polarimetric surveys. None of the systematic errors studied fundamentally limit the detection and characterization of B-modes on large scales for a tensor-to-scalar ratio of r= 0.01. Indeed, r less than 0.01 is achievable with commensurately improved characterizations and controls.

Miller, N. J.↗

Scheduling NASA's Deep Space Network: Priorities, Preferences, and Optimization

NASA's Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40\% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process --- oversubsubscription and how to "fairly'" reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗

User Preference Optimization for Oversubscribed Scheduling of NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗

Spacecraft-Initiated Scheduling of Commercial Communications Services

We propose a software framework enabling a spacecraft in Earth orbit to schedule its own access to space communications services via ground stations and relay satellites. All operations are automated, without a human in the loop, allowing for highly responsive service to meet time-varying needs. We describe a modular software architecture allowing the framework to interface with the scheduling systems of several providers - both government and commercial. Specifically, we present the results of an experiment with Amazon Web Services (AWS) Ground Station, an operational commercial service provider. Proposed software executed scheduling of a ground station antenna with minimal lead time (less than 20 minutes before the start of a pass). During the contact AWS cloud infrastructure was used to demodulate, process, and distribute data products from an orbiting satellite. We believe this work demonstrates the framework's ability to interface with additional providers and potential to integrate more complex decision-making in the future to schedule optimal contacts.

Scheduling↗

An Algorithm for Statistical Audibility Prediction (SAP) of an Arbitrary Signal in the Presence of Noise

A method for predicting the audibility of an arbitrary time-varying noise (signal) in the presence of masking noise has been developed. The statistical audibility prediction (SAP) method relies on the specific loudness, or loudness perceived through the individual auditory filters, for accurate statistical estimation of audibility vs. time. More recent development has focused on derivation and inclusion of frequency-dependent correction factors in SAP’s model to account for the ability to hear signals below the level of the masking noise. Audibility prediction vs. time is intuitive since it captures changes in audibility with time as it occurs, which is critical for the study of human response to noise. Concurrently time-frequency prediction of audibility may also provide valuable information about the root cause(s) for audibility useful for the design and operation of sources of noise. Empirical data, gathered under a three-alternative forced-choice (3AFC) test paradigm for low-frequency sound, has been used to examine the accuracy of SAP.

audibility↗

Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking

The expanding presence in space will place an increased dependency on networked communications– a scalable communications infrastructure; that is, the Solar System Internet (SSI). Upcoming developments towards a SSI include NASA’s upcoming LunaNet, or lunar Internet, which provides multi-hop multi-path communications using Delay Tolerant Networking (DTN). DTN has been an active area of research and development, particularly in routing, security, and optimization. DTNs are marked by mobility, disconnection, and a wide variance of latencies (propagation and processing delays). In this paper, we outline progress towards a theory of time synchronization across such a network. An underlying assumption of DTN is that the network is time synchronized already, rather than synchronization being provided as a service. While this is necessary for schedule-based routing, which is necessarily prevalent in DTNs, it is so deeply ingrained as to be built into the primary unit of data in DTNs– the bundle. Indeed, a bundle’s creation timestamp and its time to live (called the lifetime) are based on time, and there are special recommendations for systems that lack accurate clocks. The assumption of time synchronization makes sense when limiting considerations to smaller-scale and more traditional space communication. However, just as end-to-end connectivity cannot be guaranteed in DTNs, neither can access to a reference or authoritative clock. In this more general case, it might be necessary to synchronize over time-varying meshes, and perhaps even to consider relativistic effects. Moreover, by imposing synchronization restrictions in order to sustain a network, the effectiveness of the network to achieve scalability will be necessarily muted. To work towards a time synchronization theory for DTNs, we build upon past successes in modeling DTNs using time-varying graphs and sheaves. This includes error and limitation estimation, which allows one to define domains over which schedule-based routing is possible, up to some threshold sensitivity. Despite the theoretical nature of these results, the approaches taken are also algorithmic, and hence lend themselves to practical implementations. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay Tolerant Networking↗

A SmallSat Concept to Resolve Diurnal and Vertical Variations of Aerosols, Clouds, and Boundary Layer Height

A SmallSat mission concept is formulated here to carry out Time-varying Optical Measurements of Clouds and Aerosol Transport (TOMCAT) from space while embracing low-cost opportunities enabled by the revolution in Earth science observation technologies. TOMCAT’s “around-the-clock” measurements will provide needed insights and strong synergy with existing Earth observation satellites to 1) statistically resolve diurnal and vertical variation of cirrus cloud properties (key to Earth’s radiation budget), 2) determine the impacts of regional and seasonal planetary boundary layer (PBL) diurnal variation on surface air quality and low-level cloud distributions, and 3) characterize smoke and dust emission processes impacting their long-range transport on the subseasonal to seasonal time scales. Clouds, aerosol particles, and the PBL play critical roles in Earth’s climate system at multiple spatiotemporal scales. Yet their vertical variations as a function of local time are poorly measured from space. Active sensors for profiling the atmosphere typically utilize sun-synchronous low-Earth orbits (LEO) with rather limited temporal and spatial coverage, inhibiting the characterization of spatiotemporal variability. Pairing compact active lidar and passive multiangle remote sensing technologies from an inclined LEO platform enables measurements of the diurnal and vertical variability of aerosols, clouds, and aerosol-mixing-layer (or PBL) height in tropical-to-midlatitude regions where most of the world’s population resides. TOMCAT is conceived to bring potential societal benefits by delivering its data products in near–real time and offering on-demand hazard-monitoring capabilities to profile fire injection of smoke particles, the frontal lofting of dust particles, and the eruptive rise of volcanic plumes.

John E. Yorks↗

Multi-Agent Search and Rescue Applied to a Swarm of Ground Vehicles

This paper presents an algorithm for efficient search and rescue using a multi-agent system of vehicles. The algorithm uses an artificial potential field combined with a time-varying reward function for visiting various points within the search area. The reward function is used as a weight for the attractiveness of these points in the potential field. The reward value increases while the point is not being observed, and decreases while the point is observed. Collision avoidance terms are used to repel vehicles from each other, which has the additional effect of reducing duplication of searching efforts. Gradient descent of the potential field results in persistent surveillance of the search area. The algorithm generates position commands in real-time based on communication with the other vehicles. This framework allows vehicles to react in a dynamic environment, which is a significant advantage to simply following a-priori defined trajectories. The algorithm is applied to a swarm of ground robots, and experimental data is presented showing that the swarm effectively searches the entire area and self-allocates search regions to individual vehicles.

multi-agent↗

Uncertainty Error Modeling for Non-Linear State Estimation With Unsynchronized SCADA and µPMU Measurements

Distribution systems of the future smart grid require enhancements to the reliability of distribution system state estimation (DSSE) in the face of low measurement redundancy, unsynchronized measurements, and dynamic load profiles. Micro phasor measurement units (µPMUs) facilitate co-synchronized measurements with high granularity, albeit at an often prohibitively expensive installation cost. Supervisory control and data acquisition (SCADA) measurements can supplement µPMU data, although they are received at a slower sampling rate. Further complicating matters is the uncertainty associated with load dynamics and unsynchronized measurements–not only are the SCADA and µPMU measurements not synchronized with each other, but the SCADA measurements themselves are received at different time intervals with respect to one another. This paper proposes a non-linear state estimation framework which models dynamic load uncertainty error by updating the variances of the unsynchronized measurements, leading to a time-varying system of weights in the weighted least squares state estimator. Case studies are performed on the 33-Bus Distribution System in MATPOWER, using Ornstein–Uhlenbeck stochastic processes to simulate dynamic load conditions.

Cooper, Austin↗