Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “arrival time”

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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Determining Direction of Arrival at a Y-Shaped Antenna Array

An algorithm computes the direction of arrival (both azimuth and elevation angles) of a lightning-induced electromagnetic signal from differences among the times of arrival of the signal at four antennas in a Y-shaped array on the ground. In the original intended application of the algorithm, the baselines of the array are about 90 m long and the array is part of a lightning-detection-and-ranging (LDAR) system. The algorithm and its underlying equations can also be used to compute directions of arrival of impulsive phenomena other than lightning on arrays of sensors other than radio antennas: for example, of an acoustic pulse arriving at an array of microphones.

Starr, Stan↗
DOE OSTI2020

CACTUS: A depleted monolithic active timing sensor using a CMOS radiation hard technology

The planned luminosity increase at the Large Hadron Collider in the coming years has triggered interest in the use of the particles' time of arrival as additional information in specialized detectors to mitigate the impact of pile-up. The required time resolution is of the order of tens of picoseconds, with a spatial granularity of the order of 1 mm. A time measurement at this precision level will also be of interest beyond the LHC and beyond high energy particle physics. We present in this paper the first developments towards a radiation hard Depleted Monolithic Active Pixel Sensor (DMAPS), with high-resolution time measurement capability. The technology chosen is a standard high voltage CMOS process, in conjunction with a high resistivity detector material, which has already proven to efficiently detect particles in tracking applications after several hundred of Mrad of irradiation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

A first look at AS-ROC: a Si-Ge integrated chip readout for fast timing

Abstract Advances in timing detector technology require new specialized readout electronics. Applications demand below 10 ps time of arrival resolution and low power for a low repetition rate. A possible path to achieve O(10 ps) time resolution is an integrated chip using Silicon Germanium (SiGe) technology. Using DoE SBIR funding, Anadyne, Inc., in collaboration with UC Santa Cruz, has developed a prototype SiGe front-end readout chip optimized for low power and timing resolution. Two versions of the chip were produced with performance in simulation: a more power version with 10 ps resolution at 5 fC with 1.1 mW/channel, and a less power version with 10 ps resolution at 8 fC with 0.6 mW/channel.The chip was produced at Tower Semiconductor with 350 nm technology. The ASIC from the prototype run shows good performance: a rise time of 0.7–1 ns and 25 mV per fC response with RMS noise <1 mV. Simulation and results from the prototype will be reported in this paper.

Instruments & Instrumentation↗
NASA NTRS2018

The NANOGrav 11-year Data Set: High-Precision Timing of 45 Millisecond Pulsars

We present high-precision timing data over time spans of up to 11 years for 45 millisecond pulsars observed as part of the North American Nanohertz Observatory for Gravitational Waves (NANOGrav) project, aimed at detecting and characterizing low-frequency gravitational waves. The pulsars were observed with the Arecibo Observatory and/or the Green Bank Telescope at frequencies ranging from 327 MHz to 2.3 GHz. Most pulsars were observed with approximately monthly cadence, and six high-timing-precision pulsars were observed weekly. All were observed at widely separated frequencies at each observing epoch in order to fit for time-variable dispersion delays. We describe our methods for data processing, time-of-arrival (TOA) calculation, and the implementation of a new, automated method for removing outlier TOAs. We fit a timing model for each pulsar that includes spin, astrometric, and (for binary pulsars) orbital parameters; time-variable dispersion delays; and parameters that quantify pulse-profile evolution with frequency. The timing solutions provide three new parallax measurements, two new Shapiro delay measurements, and two new measurements of significant orbital-period variations. We fit models that characterize sources of noise for each pulsar. We find that 11 pulsars show significant red noise, with generally smaller spectral indices than typically measured for non-recycled pulsars, possibly suggesting a different origin. A companion paper uses these data to constrain the strength of the gravitational-wave background

Arzoumanian, Zaven↗
NASA NTRS1991

High-precision timing of millisecond pulsars. II - Astrometry, orbital evolution, and eclipses of PSR 1957 + 20

Pulse time-of-arrival measurements have been acquired for PSR 1957 + 20 on 61 days over a 2.7 yr interval, including the times of 44 eclipse disappearance or reappearance events. The timing data provide a reliable measurement of the pulsar's proper motion, 29 +/- 3 mas/yr, at position angle 216 +/- 6 deg; this direction is in excellent agreement with that suggested by the cometlike shape of a surrounding optical emission nebula. The rate of change of the orbital period has been measured: a surprisingly large (-3.9 +/- 0.9) x 10 exp -11, implying that significant orbital evolution must take place on a time scale of 30 Myr. Finally, the present observations extend the eclipse measurements to higher frequencies and provide better statistics for these highly variable phenomena. The eclipse data are used to compute a column-density profile of free electrons in the outer parts of the eclipsing region, and thereby provide an important glimpse into the material being ablated from the companion star.

Ryba, M. F.↗
DOE OSTI2023

Insensitivity to propagation timing in a preview-enabled wind turbine control experiment

Lidar scanners are capable of taking measurements of a wind field upstream of a wind turbine. The wind turbine controller can use these measurements as a “preview” of future disturbances impacting the turbine. Such preview-enabled (or feedforward) controllers show superior performance to standard wind turbine control configurations based purely on a feedback architecture. To capitalize on the performance improvements that preview wind measurements can provide, feedforward control actions should be timed to coincide with the arrival of the wind field at the wind turbine location. However, the time of propagation of the wind field between the lidar measurement location and the wind turbine is not perfectly known. Moreover, the best time to take feedforward control action may not perfectly coincide with the true arrival time of the wind disturbance. This contribution presents results from an experiment where preview-enabled model predictive control was deployed on a fully-actuated, scaled model wind turbine operating in a wind tunnel testbed. In the study, we investigate the sensitivity of the controller performance to the assumed propagation delay using a range of wind input sequences. We find that the preview-enabled controller outperforms the feedback only case across a wide range of assumed propagation delays, demonstrating a level of robustness to the time alignment of the incoming disturbances.

17 WIND ENERGY↗
NASA NTRS2006

Automated Announcements of Approaching Emergency Vehicles

Street intersections that are equipped with traffic lights would also be equipped with means for generating audible announcements of approaching emergency vehicles, according to a proposal. The means to generate the announcements would be implemented in the intersection- based subsystems of emergency traffic-light-preemption systems like those described in the two immediately preceding articles and in "Systems Would Preempt Traffic Lights for Emergency Vehicles" (NPO-30573), NASA Tech Briefs, Vol. 28, No. 10 (October 2004), page 36. Preempting traffic lights is not, by itself, sufficient to warn pedestrians at affected intersections that emergency vehicles are approaching. Automated visual displays that warn of approaching emergency vehicles can be helpful as a supplement to preemption of traffic lights, but experience teaches that for a variety of reasons, pedestrians often do not see such displays. Moreover, in noisy and crowded urban settings, the lights and sirens on emergency vehicles are often not noticed until a few seconds before the vehicles arrive. According to the proposal, the traffic-light preemption subsystem at each intersection would generate an audible announcement for example, emergency vehicle approaching, please clear intersection whenever a preemption was triggered. The subsystem would estimate the time of arrival of an approaching emergency vehicle by use of vehicle identity, position, and time data from one or more sources that could include units connected to traffic loops and/or transponders connected to diagnostic and navigation systems in participating emergency vehicles. The intersection-based subsystem would then start the announcement far enough in advance to enable pedestrians to leave the roadway before any emergency vehicles arrive.

Bachelder, Aaron↗
NASA NTRS1998

A Fast-Time Study of Aircraft Reordering in Arrival Sequencing and Scheduling

In order to ensure that the safe capacity of the terminal area is not exceeded, Air Traffic Management ATM often places restrictions on arriving flights transitioning from en route airspace to terminal airspace. This restriction of arrival traffic is commonly referred to as arrival flow management, and includes techniques such as metering, vectoring, fix-load balancing, and the imposition of miles-in-trail separations. These restrictions are enacted without regard for the relative priority which airlines may be placing on individual flights based on factors such as crew criticality, passenger connectivity, critical turn times, gate availability, on-time performance, fuel status, or runway preference. The development of new arrival flow management techniques which take into consideration priorities expressed by air carriers will likely reduce the economic impact of ATM restrictions on the airlines and lead to increased airline economic efficiency by allowing airlines to have greater control over their individual arrival banks of aircraft. NASA and the Federal Aviation Administration (FAA) have designed and developed a suite of software decision support tools (DSTs) collectively known as the Center TRACON Automation System (CTAS). One of these tools, the Traffic Management Advisor (TMA) is currently being used at the Fort Worth Air Route Traffic Control Center to perform arrival flow management of traffic into the Dallas/Fort Worth airport (DFW). The TMA is a time-based strategic planning tool that assists Traffic Management Coordinators (TMCs) and En Route Air Traffic Controllers in efficiently balancing arrival demand with airport capacity. The primary algorithm in the TMA is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 no a. from touchdown. This scheduler will sequence aircraft so that they arrive in a first- come - first-served (FCFS) order. While FCFS sequencing establishes a fair order based on estimated times of arrival, it does not take into account individual airline priorities among incoming flights. NASA is exploring the possibility of allowing airlines to express relative arrival priorities to air traffic management through the development of new CTAS scheduling algorithms which take into consideration airline arrival preferences. The accommodation of airline priorities in arrival sequencing and scheduling would under most circumstances result in a deviation from a "natural" or FCFS arrival order. As a First step toward developing airline influenced sequencing algorithms, an investigation was conducted to determine the feasibility of reordering arrival traffic from a strict FCFS sequence. A fast-time simulation has been developed which allows statistical evaluation of sequencing and scheduling algorithms for arrival traffic at the Dallas/Fort Worth Airport. In contrast to real-time simulation or field tests, which would require on the order of ninety minutes to examine a single traffic rush period, the fast-time simulation allows examination of multiple rush periods in a matter of seconds.

Carr, Greg↗
NASA NTRS2003

Single Station System and Method of Locating Lightning Strikes

An embodiment of the present invention uses a single detection system to approximate a location of lightning strikes. This system is triggered by a broadband RF detector and measures a time until the arrival of a leading edge of the thunder acoustic pulse. This time difference is used to determine a slant range R from the detector to the closest approach of the lightning. The azimuth and elevation are determined by an array of acoustic sensors. The leading edge of the thunder waveform is cross-correlated between the various acoustic sensors in the array to determine the difference in time of arrival, AT. A set of AT S is used to determine the direction of arrival, AZ and EL. The three estimated variables (R, AZ, EL) are used to locate a probable point of the lightning strike.

Medelius, Pedro J.↗
NASA NTRS2013

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

transportation network↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

negotiation↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

Sadovsky, A.↗
NASA NTRS2006

Characterization of Days Based On Analysis of National Airspace System Performance Metrics

Days of operations in the National Airspace System can be described in term of traffic demand, runway conditions, equipment outages, and surface and enroute weather conditions. These causes manifest themselves in terms of departure delays, arrival delays, enroute delays and traffic flow management delays, Traffic flow management initiatives such as, ground stops, ground delay programs, miles-in-trail restrictions, rerouting and airborne holding are imposed to balance the air traffic demand with respect to the available capacity, In order to maintain operational efficiency of the National Airspace System, the Federal Aviation Administration (FAA) maintains delay sad other statistics in the Air Traffic Operations Network (OPSNET) and the Aviation System Performance Metrics (ASPM) databases. OPSNET data includes reportable delays of fifteen minutes ox more experienced by Instrument Flight Rule (IFR) flights. Numbers of aircraft affected by departure delays, enroute delays, arrival delays and traffic flow delays are recorded in the OPSNET data. ASPM data consist of number of actual departures, number of canceled departures, percentage of on time departures, percentage of on time gate arrivals, taxi-out delays. taxi-in delays, gate delays, arrival delays and block delays. Surface conditions at the major U.S. airports are classified in terms of Instrument Meteorological Condition (IMC) and Visual Meteorological Condition (VMC) as a function of the time of the day in the ASPM data. The main objective of this paper is to use OPSNET and ASPM data to classify the days in the datasets into few distinct groups, where each group is separated from the other groups in terms of a distance metric. The motivations for classifying the days are two-fold, 1) to enable selection of days of traffic with particular operational characteristics for concept evaluation using system-wide simulation systems such as the National Aeronautics and Space Administration's Airspace Concepts Evaluation Tool (ACES) and 2) to enable evaluation of a given day with respect to the characteristics of the classified groups. The first part of the paper is devoted to the analysis of major trends seen in the OPSNET and ASPM data. The second part of the paper is devoted to describing features or measures derived from the OPSNET and ASPM data that are suitable for characterizing days, and the classification algorithm used for grouping the days. Finally, the method for evaluating the characteristics of a given day with respect to the properties of the groups is described.

Chatterji, Gano B.↗
NASA NTRS2012

Optimal Routing and Control of Multiple Agents Moving in a Transportation Network and Subject to an Arrival Schedule and Separation Constraints

We address the problem of navigating a set of moving agents, e.g. automated guided vehicles, through a transportation network so as to bring each agent to its destination at a specified time. Each pair of agents is required to be separated by a minimal distance, generally agent-dependent, at all times. The speed range, initial position, required destination, and required time of arrival at destination for each agent are assumed provided. The movement of each agent is governed by a controlled differential equation (state equation). The problem consists in choosing for each agent a path and a control strategy so as to meet the constraints and reach the destination at the required time. This problem arises in various fields of transportation, including Air Traffic Management and train coordination, and in robotics. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver.

Sadovsky, A. V.↗
NASA NTRS2009

Paper to Electronic Questionnaires: Effects on Structured Questionnaire Forms

With the use of computers, paper questionnaires are being replaced by electronic questionnaires. The formats of traditional paper questionnaires have been found to effect a subject's rating. Consequently, the transition from paper to electronic format can subtly change results. The research presented begins to determine how electronic questionnaire formats change subjective ratings. For formats where subjects used a flow chart to arrive at their rating, starting at the worst and middle ratings of the flow charts were the most accurate but subjects took slightly more time to arrive at their answers. Except for the electronic paper format, starting at the worst rating was the most preferred. The paper and electronic paper versions had the worst accuracy. Therefore, for flowchart type of questionnaires, flowcharts should start at the worst rating and work their way up to better ratings.

Trujillo, Anna C.↗
NASA NTRS2018

Preliminary Error Characterization and Parametric Error Model for the Automatic Dependent Surveillance - Contract Extended Projected Profile Message

A critical component of Trajectory-Based Operations (TBO) is the ability for a consistent and accurate 4-dimensional trajectory (4DT) to be shared and synchronized between airborne and ground systems as well as amongst various ground automation systems. The Aeronautical Telecommunication Network—Baseline 2 (ATN-B2) standard defines the Extended Projected Profile (EPP) trajectory that can be sent via Automatic Dependent Surveillance-Contract (ADS-C) from an aircraft to ground automation. The EPP trajectory message contains a representation of the reference trajectory from an aircraft’s Flight Management System (FMS). In this work, a set of scenarios were run in a high-fidelity aircraft and FMS simulation to perform an initial characterization of EPP trajectory errors under a given set of conditions. The parameters investigated were the route length, route type, wind magnitude error, wind direction error, and with and without a required time-of-arrival (RTA) constraint. In addition, linear regression was used to identify a set of EPP error models for the cross-track, vertical, and time errors.

Guerreiro, Nelson M.↗
NASA NTRS2019

Management by Trajectory: Improving Predictability for Airspace Operations

In the present-day National Airspace System, the air traffic management system attempts to predict the trajectory for each flight based on the flight plan and scheduled or controlled departure time. However, gaps in trajectory data and models, coupled with tactical control actions that are not communicated to automation systems or other stakeholders, lead to trajectory predictions that are less accurate than they could be. This affects traffic flow management performance. Management by Trajectory (MBT) is a NASA concept for air traffic management in which every flight operates in accordance with a 4D trajectory that is negotiated between the airspace user and the FAA to account for the airspace user’s goals while complying with NAS constraints. The primary benefit of MBT is an improvement in system performance due to increased trajectory predictability and stability, which result from managing traffic in all four dimensions (2D route, vertical, and time), ensuring that changes to the flight’s trajectory are incorporated into the assigned trajectory, and utilizing improved time or arrival control standards. Importantly, the performance improvements support increasing efficiency without increasing collision risk. This paper provides an overview of MBT and describes fast-time simulation results evaluating the safety, performance, and efficiency effects of MBT.

Fernandes, Alicia B.↗