SEARCH · Engineering Papers

Results for “Guaranteed performance”

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 199 records · Page 11

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Guaranteeing synchronous message deadlines with the timed token medium access control protocol

We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. We address the issue of appropriate allocation of the synchronous capacities. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed even if the synchronous traffic is extremely low. We propose a scheme called the normalized proportional allocation scheme which can guarantee the synchronous message deadlines for synchronous traffic of up to 33 percent of available utilization. To date, no other synchronous capacity allocation scheme has been reported to achieve such substantial performance. Another major contribution of this paper is an extension to the previous work on the bounded token rotation time. We prove that the time elapsed between any consecutive visits to a particular node is bounded by upsilon TTRT, where TTRT is the target token rotation time set up at system initialization time. The previous result by Johnson and Sevcik is a special case where upsilon = 2. We use this result in the analysis of various synchronous allocation schemes. It can also be applied in other similar studies.

Agrawal, Gopal↗

NASA NTRS2020

Development of a Supervisory Tool for Fault Detection and Diagnosis of DC Electric Power Systems with the Application of Deep Space Vehicles

This dissertation formulates the problem of fault detection and diagnosis of DC electric power systems for the application of autonomous spacecraft. The ability to accurately identify and isolate failures in the electrical power system is critical to ensure the reliability of a spacecraft. This problem becomes more pronounced during deep space missions that lack the ability to monitor from ground control. The current state of electrical power system fault supervision is insufficient to guarantee highly reliable and robust operation. To solve this issue, a combination of model-based and rules-based techniques are used in a hierarchical framework to improve the diagnostic performance of the spacecraft electrical power system. Noise, disturbances, and modeling errors are considered in the design of the method. Practical considerations related to the hardware and software are discussed for the flight application. A wide array of failure types are simulated in a series of experiments to assess the functionality of the design. The experiments showed that the methods used improved the diagnostic capability of the autonomous system while taking into account the limitations attributed to flight software requirements. The significance of this study is to provide a framework capable of advanced diagnostics of an electrical power system with little to no interaction from a human operator.

Fault Detection and Diagnosis↗

NASA NTRSDate not supplied

Fast Aircraft Separation Calculations for Gradient Based Optimization of Airspace Simulations

Simulations of airspace operational concepts can play a significant role in determining future paradigms that would allow for a safe increase in airspace density. In particular, airspace simulations which are capable of handling large numbers of aircraft act as an enabling capability for the testing of proposed airspace operational concepts. Simulations allowing for gradient based optimization methods are particularly attractive, since they would potentially allow for an efficient and empirical means to derive best operational practices. These could also allow for vehicle multidisciplinary design and optimization studies to include air traffic management considerations as a discipline. But any large scale simulation of airspace operations must include some methodology for addressing airspace separation requirements, which in the most direct sense would be tracked in a manner that computationally grows as a quadratic function of the number of simulated aircraft. Efficient indirect methods have been developed in certain contexts to address this limitation. However, any means of addressing separation requirements in a gradient based optimization context should be implemented by functions which provide analytic derivative information to maximize numerical precision and computational efficiency. In this paper, a fast and differentiable separation metric is described in application to gradient based optimization of airspace operations. Rather than computing the separation distance between every pair of aircraft in a simulation, this method effectively reduces the problem to a smaller relevant set using a geometric decomposition. This method guarantees that the smallest distance at all points in simulated time is determined exactly. When used in an optimization constraint context, this guarantees that a minimum separation is maintained between all pairs of aircraft. The presented metric has logarithmic computational growth with respect to the number of simulated aircraft, and is shown to perform well in a series of notional 2D airspace optimization problems when used to enforce specified airborne separation constraints. Results show that this is notably faster than a direct pairwise distance computing metric for optimizations involving both small and large numbers of aircraft, yet enforce separation requirements to the same tolerance. It is shown that this favorable scalability is an enabling capability for more sophisticated air traffic management conceptual studies.

Optimization↗

NASA NTRS1982

Nuclear reactor system study for NASA/JPL

Reactor shielding, safety studies, and heat pipe development work are described. Monte Carlo calculations of gamma and neutron shield configurations show that substantial weight penalties are incurred if exposure at 25 m to neutrons and gammas must be limited to 10 to the 12th power nvt and 10 to the 6th power rad, instead of the 10 to the 13th power nvt and 10 to the 7th power rad values used earlier. For a 1.6 MW sub t reactor, the required shield weight increases from 400 to 815 kg. Water immersion critically calculations were extended to study the effect of water in fuel void spaces as well as in the core heat pipes. These show that the insertion into the core of eight blades of B4C with a mass totaling 2.5 kg will guarantee subcriticality. The design, fabrication procedure, and testing of a 4m long molybdenum/lithium heat pipe are described. It appears that an excess of oxygen in the wick prevented the attainment of expected performance capability.

Palmer, R. G.↗

NASA NTRS1988

An approach to CMG steering using feedback linearization

This paper presents an approach for controlling spacecraft equipped with control moment gyroscopes. A technique from feedback linearization theory is used to transform the original nonlinear problem to an equivalent linear form without approximating assumptions. In this form, the spacecraft dynamics appear linearly, and are decoupled from redundancy in the system of gyroscopes. A general approach to distributing control effort among the available actuators is described which includes provisions for redistribution of rotors, explicit bounds in gimbal rates, and guaranteed operation at or near singular configurations. A particular algorithm is developed for systems of double-gimbal devices, and demonstrated in two examples for which existing approaches fail to give adequate performance.

Dzielski, John↗

NASA NTRS1991

Approach to control moment gyroscope steering using feedback linearization

Dzielski, John↗

NASA NTRS1992

Spacecraft dynamics characterization and control system failure detection, volume 1

The work under this grant has been directed to two aspects of the control of flexible spacecraft: (1) the modeling of deployed or erected structures including nonlinear joint characteristics; and (2) the detection and isolation of failures of the components of control systems for large space structures. The motivation for the first of these research tasks is the fact that very large assemblies in space will have to be built or deployed in situ. A likely scenario is, in fact, a combination of these wherein modules which are folded for transportation into orbit are erected to their final configuration and then jointed with other such erected modules to form the full assembly. Any such erectable modules will have joints. It remains to be seen whether or not joints designed for operational assemblies will have nonlinear properties, but it seems prudent to develop a methodology for dealing with that possibility. The motivation for the second of these research tasks is the fact that we foresee large assemblies in space which will require active control to damp vibrations and/or hold a desired shape. Lightweight structures will be very flexible, with many elastic modes having very low frequencies. In order to control these modes well, the control system will likely require many sensors and many actuators, probably distributed over much of the structure. The combination of a large number of control system components with long operational periods virtually guarantees that these systems will suffer control system component failures during operation. The control system must be designed to tolerate failures of some sensors and actuators, and still be able to continue to perform its function.

Source record↗

NASA NTRS2010

Optimal Codes for the Burst Erasure Channel

Deep space communications over noisy channels lead to certain packets that are not decodable. These packets leave gaps, or bursts of erasures, in the data stream. Burst erasure correcting codes overcome this problem. These are forward erasure correcting codes that allow one to recover the missing gaps of data. Much of the recent work on this topic concentrated on Low-Density Parity-Check (LDPC) codes. These are more complicated to encode and decode than Single Parity Check (SPC) codes or Reed-Solomon (RS) codes, and so far have not been able to achieve the theoretical limit for burst erasure protection. A block interleaved maximum distance separable (MDS) code (e.g., an SPC or RS code) offers near-optimal burst erasure protection, in the sense that no other scheme of equal total transmission length and code rate could improve the guaranteed correctible burst erasure length by more than one symbol. The optimality does not depend on the length of the code, i.e., a short MDS code block interleaved to a given length would perform as well as a longer MDS code interleaved to the same overall length. As a result, this approach offers lower decoding complexity with better burst erasure protection compared to other recent designs for the burst erasure channel (e.g., LDPC codes). A limitation of the design is its lack of robustness to channels that have impairments other than burst erasures (e.g., additive white Gaussian noise), making its application best suited for correcting data erasures in layers above the physical layer. The efficiency of a burst erasure code is the length of its burst erasure correction capability divided by the theoretical upper limit on this length. The inefficiency is one minus the efficiency. The illustration compares the inefficiency of interleaved RS codes to Quasi-Cyclic (QC) LDPC codes, Euclidean Geometry (EG) LDPC codes, extended Irregular Repeat Accumulate (eIRA) codes, array codes, and random LDPC codes previously proposed for burst erasure protection. As can be seen, the simple interleaved RS codes have substantially lower inefficiency over a wide range of transmission lengths.

Hamkins, Jon↗

NASA NTRS2012

Adaptive Control with Reference Model Modification

This paper presents a modification of the conventional model reference adaptive control (MRAC) architecture in order to improve transient performance of the input and output signals of uncertain systems. A simple modification of the reference model is proposed by feeding back the tracking error signal. It is shown that the proposed approach guarantees tracking of the given reference command and the reference control signal (one that would be designed if the system were known) not only asymptotically but also in transient. Moreover, it prevents generation of high frequency oscillations, which are unavoidable in conventional MRAC systems for large adaptation rates. The provided design guideline makes it possible to track a reference commands of any magnitude from any initial position without re-tuning. The benefits of the method are demonstrated with a simulation example

Stepanyan, Vahram↗

NASA NTRS1985

Electron density in the equatorial topside

Ionospheric electron content studies have revealed severe discrepancies between Faraday measurements and model predictions at low latitudes. In this investigation, satellite data of AE-C and Aeros and incoherent scatter data from Jicamarca, Peru and Arecibo, Puerto Rico are used to examine the latitudinal and diurnal extent of this disagreement. It is found that in the modified dip range -30 deg to +30 deg the present IRI relative layer shape underestimates the thickness of the topside electron density during both, day and night. The Bent model which was used as a source for the IRI description performs somewhat better in this critical dip range, though it does not reach the observed values. Also it does not show the observed diurnal variation. A correction to the IRI formula is proposed that guarantees better agreement with the satellite and incoherent scatter data.

Bilitza, D.↗

NASA NTRS1994

A new communication protocol family for a distributed spacecraft control system

In this paper we describe the concepts behind and architecture of a communication protocol family, which was designed to fulfill the communication requirements of ESOC's new distributed spacecraft control system SCOS 2. A distributed spacecraft control system needs a data delivery subsystem to be used for telemetry (TLM) distribution, telecommand (TLC) dispatch and inter-application communication, characterized by the following properties: reliability, so that any operational workstation is guaranteed to receive the data it needs to accomplish its role; efficiency, so that the telemetry distribution, even for missions with high telemetry rates, does not cause a degradation of the overall control system performance; scalability, so that the network is not the bottleneck both in terms of bandwidth and reconfiguration; flexibility, so that it can be efficiently used in many different situations. The new protocol family which satisfies the above requirements is built on top of widely used communication protocols (UDP and TCP), provides reliable point-to-point and broadcast communication (UDP+) and is implemented in C++. Reliability is achieved using a retransmission mechanism based on a sequence numbering scheme. Such a scheme allows to have cost-effective performances compared to the traditional protocols, because retransmission is only triggered by applications which explicitly need reliability. This flexibility enables applications with different profiles to take advantage of the available protocols, so that the best rate between sped and reliability can be achieved case by case.

Baldi, Andrea↗

NASA NTRS1998

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System Signal Operations

In this paper, a new and efficient algorithm is developed for attitude determination from Global Positioning System signals. The new algorithm is derived from a generalized nonlinear predictive filter for nonlinear systems. This uses a one time-step ahead approach to propagate a simple kinematics model for attitude determination. The advantages of the new algorithm over previously developed methods include: it provides optimal attitudes even for coplanar baseline configurations; it guarantees convergence even for poor initial conditions; it is a non-iterative algorithm; and it is computationally efficient. These advantages clearly make the new algorithm well suited to on-board applications. The performance of the new algorithm is tested on a dynamic hardware simulator. Results indicate that the new algorithm accurately estimates the attitude of a moving vehicle, and provides robust attitude estimates even when other methods, such as a linearized least-squares approach, fail due to poor initial starting conditions.

Crassidis, John L.↗

NASA NTRS2001

Ontolology Negotiation Between Scientific Archives

This paper describes an approach to ontology negotiation between information agents. Ontologies are declarative (data driven) expressions of an agent's "world": the objects, operations, facts, and rules that constitute the logical space within which an agent performs. Ontology negotiation enables agents to cooperate in performing a task, even if they are based on different ontologies. 'Me process allows agents to discover ontology conflicts and then, though incremental interpretation, clarification, and explanation, establish a common basis for communicating with each other. The need for ontology negotiation stems from the proliferation of information sources and of agents with widely varying specialty expertise. The unmanageability of massive amounts of web-based information is already becoming apparent. It is starting to have an impact on professions that rely on distributed archived information. If the expansion continues at its present rate without an ontology negotiation process being introduced, there will soon be no way to ensure the accuracy and completeness of information that scientists obtain from sources other than their own experiments. Ontology negotiation is becoming increasingly recognized as a crucial element of scalable agent technology. This is because agents, by their very nature, are supposed to operate with a fair amount of autonomy and independence from their end-users. Part of this independence is the ability to enlist other agents for help in performing a task (such as locating information on the web). The agents enlisted for help may be "owned" by a different end-user or organization (such as a document archive), and there is no guarantee that they will use the same terminology or understand the same concepts (objects, operators, theorems, rules) as the recruiting agent. For NASA, the need for ontology negotiation arises at the boundaries between scientific disciplines. For example: modeling the effects of global warming might involve knowledge about imaging, climate analysis, ecology, demographics, industrial economics, and biology. The need for ontology negotiation also arises at the boundaries between scientific programs. For example, a Principal Investigator may want to use information from a previous mission to complement downloads from the instruments currently deployed.

Bailin, Sidney C.↗

NASA NTRS2019

Coordinated Turn Trajectory Generation and Tracking Control for Multi-rotors Operating in Urban Environment

The paper presents an efficient trajectory generation and tracking approach for multi-rotor air vehicles operating in urban environment, which takes into account uncertainties in the urban wind field and in the vehicle's parameters. Generated trajectories are sufficiently smooth, based on the differential flatness of the vehicle's dynamics and optimal in the sense of minimum agility and time. They pass through given set of way points, guarantee flight without a side-slip, and satisfy vehicle's dynamics and actuator constraints. In addition, an algorithm is presented to compute the required power to traverse the generated trajectory. Presented algorithms are implementable in real time using on-board computers. They do not take into account the vehicle's existing flight controller, hence there is no guarantee that the controller will be able to provide acceptable tracking of the generated trajectory, especially in the presence of atmospheric disturbances. To this end, we propose an adaptive augmentation algorithm to improve vehicle's performance by taking into account the effects of disturbances and on-line estimates of vehicle's existing flight controller's gains. The algorithms have been verified by simulations using DJI S1000 octocopter's model.

Stepanyan, Vahram↗

NASA NTRS2019

Coordinated Turn Trajectory Generation and Tracking Control for Multi-Rotors Operating in Urban Environment

The paper presents an efficient trajectory generation and tracking approach for multi-rotor air vehicles operating in urban environment, which takes into account uncertainties in the urban wind field and in the vehicle's parameters. Generated trajectories are sufficiently smooth, based on the differential flatness of the vehicle's dynamics and optimal in the sense of minimum agility and time. They pass through given set of way points, guarantee flight without a side-slip, and satisfy vehicle's dynamics and actuators constraints. In addition, an algorithm is presented to compute the required power to traverse the generated trajectory. Presented algorithms are implementable in real time using on-board computers. They do not take into account the vehicle's existing flight controller, hence there is no guarantee that the controller will be able to provide acceptable tracking of the generated trajectory, especially in the presence of atmospheric disturbances. To this end, we propose an adaptive augmentation algorithm to improve vehicle's performance by taking into account the effects of disturbances and on-line estimates of vehicle's existing flight controller's gains. The algorithms have been verified by simulations using DJI S1000 octocopter's model.

Stepanyan, Vahram↗

NASA NTRS2009

Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle

This paper presents the specification and verification in the Prototype Verification System (PVS) of a protocol intended to facilitate communication in an experimental remotely operated vehicle used by NASA researchers. The protocol is defined as a stack-layered com- position of simpler protocols. It can be seen as the vertical composition of protocol layers, where each layer performs input and output message processing, and the horizontal composition of different processes concurrently inhabiting the same layer, where each process satisfies a distinct requirement. It is formally proven that the protocol components satisfy certain delivery guarantees. Compositional techniques are used to prove these guarantees also hold in the composed system. Although the protocol itself is not novel, the methodology employed in its verification extends existing techniques by automating the tedious and usually cumbersome part of the proof, thereby making the iterative design process of protocols feasible.

Goodloe, Alwyn E.↗

NASA NTRS2016

Comparison of Simultaneous PIV and Hydroxyl Tagging Velocimetry in Low Velocity Flows

Hydroxyl tagging velocimetry (HTV) is a molecular tagging velocimetry (MTV) technique that relies on the photo- dissociation of water vapor into OH radicals and their subsequent tracking using laser-induced fluorescence. At ambient temperature in air, the OH species lifetime is about 50 micro-s. The feasibility of using HTV for probing low- speed flows (a few m/s) is investigated by using an inert, heated gas as a means to increase the OH species lifetime. Unlike particle-based techniques, MTV does not suffer from tracer settling, which is particularly problematic at low speeds. Furthermore, the flow needs to be seeded with only a small mole fraction of water vapor, making it safer for both the user and facilities than other MTV techniques based on corrosive or toxic chemical tracers. HTV is demonstrated on a steam-seeded nitrogen jet at approximately 75 C in the laminar (Umean=3.31 m/s, Re=1,540), transitional (Umean=4.48 m/s, Re=2,039), and turbulent (Umean=6.91 m/s, Re=3,016) regimes at atmospheric pressure. The measured velocity profiles are compared with particle image velocimetry (PIV) measurements performed simultaneously with a second imager. Seeding for the PIV is achieved by introducing micron-sized water droplets into the flow with the steam; the same laser sheet is used for PIV and HTV to guarantee spatial and temporal overlap of the data. Optimizing each of these methods, however, requires conflicting operating conditions: higher temperatures benefit the HTV signals but reduce the available seed density for the PIV through evaporation. Nevertheless, data are found to agree within 10% for the instantaneous velocity profiles and within 5% for the mean profiles and demonstrate the feasibility of HTV for low-speed flows at moderate to high temperatures.

Andre, Matthieu A.↗

NASA NTRS2024

Generating Dominating Sets Using Locally Defined Centrality Measures

The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient heuristic algorithms, especially in applications such as ad hoc wireless networks. Most distributed algorithms proposed in the literature assume that each node has knowledge of the network structure. We propose a distributed heuristic algorithm that uses two rounds of communication, and where each node has only local information, both in terms of network structure and dominating set assignment. First, each node calculates a local centrality measure to determine whether it is part of the dominating set D. The second round guarantees D is a dominating set by adding any non-dominated nodes. We compare several centrality measures and show that the Shapley centrality, derived from the Shapley value in game theory, is theoretically motivated and performs well in practice on several synthetic and real-world networks.

Network↗