Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator exponential”

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.

223 records · Page 13

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

A Reliability Model for Ni-BaTiO3-Based (BME) Ceramic Capacitors

The evaluation of multilayer ceramic capacitors (MLCCs) with base-metal electrodes (BMEs) for potential NASA space project applications requires an in-depth understanding of their reliability. The reliability of an MLCC is defined as the ability of the dielectric material to retain its insulating properties under stated environmental and operational conditions for a specified period of time t. In this presentation, a general mathematic expression of a reliability model for a BME MLCC is developed and discussed. The reliability model consists of three parts: (1) a statistical distribution that describes the individual variation of properties in a test group of samples (Weibull, log normal, normal, etc.), (2) an acceleration function that describes how a capacitors reliability responds to external stresses such as applied voltage and temperature (All units in the test group should follow the same acceleration function if they share the same failure mode, independent of individual units), and (3) the effect and contribution of the structural and constructional characteristics of a multilayer capacitor device, such as the number of dielectric layers N, dielectric thickness d, average grain size r, and capacitor chip size S. In general, a two-parameter Weibull statistical distribution model is used in the description of a BME capacitors reliability as a function of time. The acceleration function that relates a capacitors reliability to external stresses is dependent on the failure mode. Two failure modes have been identified in BME MLCCs: catastrophic and slow degradation. A catastrophic failure is characterized by a time-accelerating increase in leakage current that is mainly due to existing processing defects (voids, cracks, delamination, etc.), or the extrinsic defects. A slow degradation failure is characterized by a near-linear increase in leakage current against the stress time; this is caused by the electromigration of oxygen vacancies (intrinsic defects). The two identified failure modes follow different acceleration functions. Catastrophic failures follow the traditional power-law relationship to the applied voltage. Slow degradation failures fit well to an exponential law relationship to the applied electrical field. Finally, the impact of capacitor structure on the reliability of BME capacitors is discussed with respect to the number of dielectric layers in an MLCC unit, the number of BaTiO3 grains per dielectric layer, and the chip size of the capacitor device.

reliability↗

Developing Mars-Based Clinical Scenarios for an Earth Independent Medical Operations (EIMO) – Based Decision Support Service

As crewed missions move beyond Low-Earth Orbit, pre-mission planning cannot fully buy down the medical risks of exploration-class missions. Martian missions, where increased hazards exist, (such as long-duration spaceflight, surface-level EVA operations, and communications delays) will require a paradigm shift in the structure of a medical system. An Earth-Independent Medical Operations-based Medical System (EIMO-MS) will need to optimize four critical domains to help provide medical care: utilization of Pre-Mission Planning, augmentation of Acute and Prolonged Medical Decision Making, automated tracking of Resource Management, and assistance in Task Load Balance. The ideal EIMO-MS will be able to accomplish this goal by having an interactive, adaptable interface that will be able to provide real-time medical services. It must respond based on the level of crewmember training, medical situation, and available medical and non-medical resources. To showcase the capabilities and requirements of such a sophisticated automated MS, a series of clinical scenarios of escalating complexity were developed with clinical and systems engineering input. These scenarios describe in clinical detail what a theoretical future medical system, enhanced with multiple information streams (such as a medical database, an AI-based Decision Support System, real-time monitoring, enhanced in-situ laboratory imaging, etc.) can achieve in conjunction with a trained and experienced crew. Scenarios are comprised of: a context section including objectives and applicable spaceflight environment, a highlighted assumptions section, a clinical narrative section, and a systems engineering activity diagram demonstrating the integrated Medical System (MS). The “swim lanes” of the activity diagram act as the logistical core of each scenario and show how the MS will interact with the crew, ground support, and other in-flight systems. The Design Reference Mission that is used for the scenarios is based on existing reference mission profiles [1] with a projected 30-sol stay on the Martian surface. Scenarios span the spectrum from planned evaluations, minor medical care, urgent care, surgical guidance, critical and expectant management, and behavioral health care. Mission complexity will exponentially increase during deep space and Mars exploration-class missions, and medical support for these missions will likewise need to increase in autonomy and adaptability. The integrated system that will support these missions will need to provide assistance in a variety of anticipated and unforeseen scenarios. These medical scenarios, guided by clinician input, are initial steps in crafting the requirements for an EIMO-based medical system. By working in a systems engineering framework, requirements and capabilities can be extracted and mapped while maintaining a clinical core.

Prashant Parmar↗

Reconciling Scientific Aspirations and Engineering Constraints for a Lunar Mission via Hyperdimensional Interpolation

Virtually every NASA space-exploration mission represents a compromise between the interests of two expert, dedicated, but very different communities: scientists, who want to go quickly to the places that interest them most and spend as much time there as possible conducting sophisticated experiments, and the engineers and designers charged with maximizing the probability that a given mission will be successful and cost-effective. Recent work at NASA's Jet Propulsion Laboratory (JPL) seeks to enhance communication between these two groups, and to help them reconcile their interests, by developing advanced modeling capabilities with which they can analyze the achievement of science goals and objectives against engineering design and operational constraints. The analyses conducted prior to this study have been point-design driven. Each analysis has been of one hypothetical case which addresses the question: Given a set of constraints, how much science can be done? But the constraints imposed by the architecture team-e.g., rover speed, time allowed for extravehicular activity (EVA), number of sites at which science experiments are to be conducted- are all in early development and carry a great deal of uncertainty. Variations can be incorporated into the analysis, and indeed that has been done in sensitivity studies designed to see which constraint variations have the greatest impact on results. But if a very large number of variations can be analyzed all at once, producing a table that includes virtually the entire trade space under consideration, then we have a tool that enables scientists and mission architects to ask the inverse question: For a given desired level of science (or any other objective), what is the range of constraints that would be needed? With this tool, mission architects could determine, for example, what combinations of rover speed, EVA duration, and other constraints produce the desired results. Further, this tool would help them identify which technology-improvement investments would be likely to produce the largest or most important return. However, the number of variations that need to be considered for such analysis quickly balloons to an unwieldy size. If three variations are considered for each of six constraints-a very modest example-there are a total of 243 variations to consider. If it takes 40 minutes to compute each variation, as it does with HURON, our automated optimization system, then it would take 162 hours or nearly 7 days of round-the-clock computing to calculate the results. Adding further constraints or variations exponentially increases the amount of time that is needed.

Weisbin, Charles R.↗

Hidden Statistics Approach to Quantum Simulations

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

Zak, Michail↗

Long Term Missions at the Sun-Earth Libration Point L1: ACE, SOHO, and WIND

Three heliophysics missions -- the Advanced Composition Explorer (ACE), Solar Heliospheric Observatory (SOHO), and the Global Geoscience WIND -- have been orbiting the Sun-Earth interior libration point L1 continuously since 1997, 1996, and 2004, respectively. ACE and WIND (both NASA missions) and SOHO (an ESA-NASA joint mission) are all operated from the NASA Goddard Space Flight Center (GSFC). While ACE and SOHO have been dedicated libration point orbiters since their launches, WIND has had also a remarkable 10-year career flying a deep-space, multiple lunar-flyby trajectory prior to 2004. That era featured 36 targeted lunar flybys with excursions to both L1 and L2 before its final insertion in L1 orbit. A figure depicts the orbits of the three spacecraft, showing projections of the orbits onto the orthographic planes of a solar rotating ecliptic frame of reference. The SOHO orbit is a quasi-periodic halo orbit, where the frequencies of the in-plane and out-of-plane motions are practically equal. Such an orbit is seen to repeat itself with a period of approximately 178 days. For ACE and WIND, the frequencies of the in-plane and out-of-plane motions are unequal, giving rise to the characteristic Lissajous motion. ACE's orbit is of moderately small amplitude, whereas WIND's orbit is a large-amplitude Lissajous of dimensions close to those of the SOHO halo orbit. As motion about the collinear points is inherently unstable, stationkeeping maneuvers are necessary to prevent orbital decay and eventual escape from the L1 region. Though the three spacecraft are dissimilar (SOHO is a 3-axis stabilized Sun pointer, WIND is a spin-stabilized ecliptic pole pointer, and ACE is also spin-stabilized with its spin axis maintained between 4 and 20 degrees of the Sun), the stationkeeping technique for the three is fundamentally the same. The technique consists of correcting the energy of the orbit via a delta-V directed parallel or anti-parallel to the Spacecraft-to-Sun line. SOHO achieves this using thrusters oriented in line with the solar direction. WIND achieves the delta-V via pulsing radial thrusters when aligned with the Sun. ACE uses axial thrusters to apply delta-V with a component that is 94% or more aligned with the ACE-Sun line. Sunward thrust adds energy to the orbit preventing decay back toward Earth. Thrust directed anti-Sunward takes energy out of the L1 orbit, thereby preventing escape from the Earth-Moon system into independent heliocentric orbit. Libration point orbit stationkeeping delta-V costs grow exponentially with time elapsed from the last maneuver performed. The doubling time constant is approximately 16 days. For the sake of fuel conservation, and for limiting the absolute magnitude of propulsion performance errors, stationkeeping maneuvers should be performed before the delta-V grows too large; for our purposes 'too large' is considered to be greater than 0.5 m/sec. In practice, the typical interval between burns for this trio is about three months, and the typical delta-V is much smaller than 0.5 m/sec. Typical annual stationkeeping costs have been around 1.0 m/sec for ACE and WIND, and much less than that for SOHO. All three spacecraft have ample fuel remaining; barring contingencies all three could, in principle, be maintained at L1 for decades to come. This paper will review the L1 orbits and the mission history of ACE, WIND, and SOHO, and describe the stationkeeping techniques and orbit maneuver experience. The Lissajous phase control that was practiced for ACE during the period from 1999 to 2001 will also be briefly discussed. The final section will consider the future of these ongoing missions.

Roberts, Craig E.↗

Dynamics and Control of a Disordered System in Space

In this paper, we present some ideas regarding the modeling, dynamics and control aspects of granular spacecraft. Granular spacecraft are complex multibody systems composed of a spatially disordered distribution of a large number of elements, for instance a cloud of N grains in orbit, with N greater than 10(exp 3). These grains can be large (Cubesat-size) or small (mm-size), and can be active, i.e., a fully equipped vehicle capable sensing their own position and attitude, and enabled with propulsion means, or entirely passive. The ultimate objective would be to study the behavior of the single grains and of large ensembles of grains in orbit and to identify ways to guide and control the shape of a cloud composed of these grains so that it can perform a useful function in space, for instance, as an element of an optical imaging system for astrophysical applications. This concept, in which the aperture does not need to be continuous and monolithic, would increase the aperture size several times compared to large NASA observatories such as ATLAST, allowing for a true Terrestrial Planet Imager that would be able to resolve exo-planet details and do meaningful spectroscopy on distant world. In the paper, we address the modeling and autonomous operation of a distributed assembly (the cloud) of large numbers of highly miniaturized space-borne elements (the grains). A multi-scale, multi-physics model is proposed of the dynamics of the cloud in orbit, as well as a control law for cloud shape maintenance, and preliminary simulation studies yield an estimate of the computational effort, indicating a scale factor of approximately N(exp 1.4) as a function of the number of grains. A granular spacecraft can be defined as a collection of a large number of space-borne elements (in the 1000s) designed and controlled such that a desirable collective behavior emerges, either from the interactions among neighboring grains, and/or between the grains and the environment. In this paper, each grain is considered to be a highly miniaturized spacecraft which has limited size and mass, hence it has limited actuation, limited propulsive capability, limited power, limited sensing, limited communication, limited computational resources, limited range of motion, limited lifetime, and may be expendable. The modeling and dynamics of clouds of vehicles is more challenging than with conventional vehicles because we are faced with a probabilistic vehicle composed of a large number of physically disconnected vehicles. First, different scales of motion occur simultaneously in a cloud: translations and rotations of the cloud as a whole (macro-dynamics), relative rotation and translation of one cloud member with respect to another (meso-dynamics), and individual cloud member dynamics (micro-dynamics). Second, the control design needs to be tolerant of the system complexity, of the system architecture (centralized vs. decentralized large scale system control) as well as robust to un-modeled dynamics and noise sources. Figure 1, top left, shows the kinematic parameters of a 1000 element cloud in orbit. The motion of the system is described with respect to a local vertical-local horizontal (LV-LH) orbiting reference frame (x,y,z)=F(sub ORF) of origin O(sub ORF) which rotates with mean motion omega and orbital semi-major axis R(sub 0). The orbital geometry at the initial time is defined in terms of its six orbital elements, and the orbital dynamics equation for point O(sub ORF) is propagated forward in time under the influence of the gravitational field of the primary and other external perturbations, described below. The origin of this frame coincides with the initial position of the center of mass of the system, and the coordinate axes are z along the local vertical, x toward the flight direction, and y in the orbit normal direction. The assumptions we used to model the dynamics are as follows: 1) The inertial frame is fixed at Earth's center. 2) The orbiting Frame ORF follows Keplerian orbit. 3) the cloud system dynamics is referred to ORF. 4) the attitude of each grain uses the principal body frame as body fixed frame. 5) the atmosphere is assumed to be rigidly rotating with the Earth. Regarding the grains forming the cloud: 1) each grain is modeled as a rigid body; 2) a simple attitude estimator provides attitude estimates, 3) a simple guidance logic commands the position and attitude of each grain, 4) a simple local feedback controller based on PD control of local states is used to stabilize the attitude of the vehicle. Regarding the cloud: 1) the cloud as a whole is modeled as an equivalent rigid body in orbit, and 2) an associated graph establishes agent connectivity and enables coupling between modes of motion at the micro and macro scales; 3) a simple guidance and estimation logic is modeled to estimate and command the attitude of this equivalent rigid body; 4) a cloud shape maintenance controller is based on the dynamics of a stable virtual truss in the orbiting frame. Regarding the environmental perturbations acting on the cloud: 1) a non-spherical gravity field including JO (Earth's spherical field) zonal component, J2 (Earth's oblateness) and J3 zonal components is implemented; 2) atmospheric drag is modeled with an exponential model; 3) solar pressure is modeled assuming the Sun is inertially fixed; and 4) the Earth's magnetic field is model using an equivalent dipole model. The equations of motion are written in a referential system with respect to the origin of the orbiting frame and the state is propagated forward in time using an incremental predictor-corrector scheme. A representative cloud with varying number of grains is simulated to identify the limitations in computation time as the number of grains grows. We derive a control law to track a desired surface in the ORF (equivalently to maintain a reference cloud shape) by defining an error from a desired surface shape, and designing a control law that is exponentially stable and reduces the tracking error to zero. Figure 1 (top right) shows a comparison of various requirements for simulation of single spacecraft vs. granular spacecraft, indicating the high degree of complexity that needs to be taken into consideration. The ORF components of control force required by one of the grains is, for this particular case, in the micro-Newton range. However, no attempt has been made yet to reconfigure (or re-orient) the cloud configuration internally, for which forces in the milli-Newton level are expected, depending on the time required to do the reconfiguration. Figure 1, bottom, shows the computation time as a function of the number of grains, indicating an order N(exp 1.43) scaling on a 8 Gb, 1067 MHz RAM MacOSX computer with a 3.06 GHz Intel Core 2 Duo processor. With this metric, the same simulation for a system of N=1000 grains would take 5.4 hours, and 146 hours (i.e., 6 days) for a system with N=10,000 grains. Therefore, efficient ways to simulate this complex system, where not only the time scales of natural system dynamics, but also the sampling times of the Guidance, Navigation, and Control are included, remain to be explored. Additional details on the cloud modeling, dynamics, and control will be described in the paper.

simulation↗