SEARCH · Search NASA

Results for “Algorithm Change Process”

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 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS2020

A Global End-Member Approach to Derive aCDOM(440) from Near-Surface Optical Measurements

This study establishes an optical inversion scheme for deriving the absorption coefficient of colored (or chromophoric, depending on the literature) dissolved organic material (CDOM) at the 440 nm wavelength, which can be applied to global water masses with near-equal efficacy. The approach uses a ratio of diffuse attenuation coefficient spectral end members, i.e., a short and long wavelength pair. The global perspective is established by sampling "extremely" clear water plus a generalized extent in turbidity and optical properties that each span three decades of dynamic range. A unique data set was collected in oceanic, coastal, and inland waters (as shallow as 0.6 m) from the North Pacific Ocean, the Arctic Ocean, Hawaii, Japan, Puerto Rico, and the east and west coasts of the United States. The data were partitioned using subjective categorizations to define a validation quality subset of conservative water masses, i.e., the inflow and outflow of properties constrain the range in the gradient of a constituent, plus 15 subcategories of water masses that were not evolving conservatively. The dependence on subcategories was confirmed with an objective methodology based on cluster analysis techniques. The latter defined five distinct classes with validation quality data present in all classes, but which also decreased in percent composition as a function of increasing class number and optical complexity. Four different algorithms based on different validation quality end members were validated with accuracies of 1.–6.2 %, wherein pairs with the largest spectral span were most accurate. Although algorithm accuracy decreased with the inclusion of more subcategories containing non-conservative water masses, changes to the algorithm fit were small when a preponderance of subcategories were included. The high accuracy for all end-member algorithms was the result of data acquisition and data processing improvements, e.g., increased vertical sampling resolution to less than 1mm and a boundary constraint to mitigate wave focusing effects, respectively. An independent evaluation with a historical database confirmed the consistency of the algorithmic approach and its application to quality assurance, e.g., to flag data outside expected ranges, identify suspect spectra, and objectively determine the in-water extrapolation interval by converging agreement for all applicable end-member algorithms. The legacy data exhibit degraded performance (as 44 % uncertainty) due to a lack of high-quality near-surface observations, especially for clear waters wherein wave-focusing effects are problematic. The novel optical approach allows the in situ estimation of an in-water constituent in keeping with the accuracy obtained in the laboratory.

Stanford B Hooker↗

NASA NTRS2004

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗

NASA NTRSDate not supplied

Markov Decision Process based Trajectory Planning for UAVs under Uncertain Wind Conditions

In this paper we propose a Markov Decision Process (MDP) algorithm for path-planning of Unmanned Aviation Vehicles (UAVs) under varying wind conditions. Solutions to path-planning for UAVs are becoming increasingly necessary as autonomous UAVs continue to enter commercial and government spaces. Path-planning is inherently challenging, as UAVs needs to account for dynamically changing flying conditions such as weather, obstacle or no-fly zones, degraded vehicle health and off-nominal battery power consumption. Machine learning methods such as Markov Decision Process (MDPs) have the potential to revolutionize how vehicles navigate in such uncertain environments. Previous papers have demonstrated the use of MDPs to optimize UAV path-planning for energy consumption under time-varying wind distribution. In this study, UAV trajectories from a pre-determined waypoint to target cell, will be computed on a 7X7 grid environment by optimizing parameters for mission assurance and safety limits in addition to the energy consumption, and operation time. The UAV navigates the grid by taking actions to move in either of the eight cardinal and intercardinal directions, under constant thrust profile. The next state of the UAV is calculated by considering its action, transition probability, obstacle cells and the wind speed magnitude and direction. Both constant and stochastic wind will be considered in this paper, the parameters being extracted from real wind measurements in proximity to an experimental UAV flight. One of the studies to be demonstrated in this paper is that as the unmanned airspace gets more complex with multiple vehicles and environmental uncertainties, trade-offs between energy consumption, operation time, risk tolerance, and mission assurance needs to be made. Further, MDPs are capable of fast computation of UAV trajectories under varying wind, hence making them suitable for in-flight path planners.

decision-making↗

NASA NTRS1980

Algorithm for the stabilization of motion a bounding vehicle in the flight phase

The unsupported phase of motion of a multileg bounding vehicle is examined. An algorithm for stabilization of the angular motion of the vehicle housing by change of the motion of the legs during flight is constructed. The results of mathematical modelling of the stabilization process by computer are presented.

Lapshin, V. V.↗

NASA NTRS1979

Error detection and rectification in digital terrain models

Digital terrain models produced by computer correlation of stereo images are likely to contain occasional gross errors in terrain elevation. These errors typically result from having mismatched sub-areas of the two images, a problem which can occur for a variety of image- and terrain-related reasons. Such elevation errors produce undesirable effects when the models are further processed, and should be detected and corrected as early in the processing as possible. Algorithms have been developed to detect and correct errors in digital terrain models. These algorithms focus on the use of constraints on both the allowable slope and the allowable change in slope in local areas around each point. Relaxation-like techniques are employed in the iteration of the detection and correction phases to obtain best results.

Hannah, M. J.↗

NASA NTRS2011

Calibrated Noise Measurements with Induced Receiver Gain Fluctuations

The lack of well-developed techniques for modeling changing statistical moments in our observations has stymied the application of stochastic process theory in science and engineering. These limitations were encountered when modeling the performance of radiometer calibration architectures and algorithms in the presence of non stationary receiver fluctuations. Analyses of measured signals have traditionally been limited to a single measurement series. Whereas in a radiometer that samples a set of noise references, the data collection can be treated as an ensemble set of measurements of the receiver state. Noise Assisted Data Analysis is a growing field of study with significant potential for aiding the understanding and modeling of non stationary processes. Typically, NADA entails adding noise to a signal to produce an ensemble set on which statistical analysis is performed. Alternatively as in radiometric measurements, mixing a signal with calibrated noise provides, through the calibration process, the means to detect deviations from the stationary assumption and thereby a measurement tool to characterize the signal's non stationary properties. Data sets comprised of calibrated noise measurements have been limited to those collected with naturally occurring fluctuations in the radiometer receiver. To examine the application of NADA using calibrated noise, a Receiver Gain Modulation Circuit (RGMC) was designed and built to modulate the gain of a radiometer receiver using an external signal. In 2010, an RGMC was installed and operated at the National Institute of Standards and Techniques (NIST) using their Noise Figure Radiometer (NFRad) and national standard noise references. The data collected is the first known set of calibrated noise measurements from a receiver with an externally modulated gain. As an initial step, sinusoidal and step-function signals were used to modulate the receiver gain, to evaluate the circuit characteristics and to study the performance of a variety of calibration algorithms. The receiver noise temperature and time-bandwidth product of the NFRad are calculated from the data. Statistical analysis using temporal-dependent calibration algorithms reveals that the natural occurring fluctuations in the receiver are stationary over long intervals (100s of seconds); however the receiver exhibits local non stationarity over the interval over which one set of reference measurements are collected. A variety of calibration algorithms have been applied to the data to assess algorithms' performance with the gain fluctuation signals. This presentation will describe the RGMC, experiment design and a comparative analysis of calibration algorithms.

Racette, Paul↗

NASA NTRS1983

Development of a Multilevel Optimization Approach to the Design of Modern Engineering Systems

A general algorithm is proposed which carries out the design process iteratively, starting at the top of the hierarchy and proceeding downward. Each subproblem is optimized separately for fixed controls from higher level subproblems. An optimum sensitivity analysis is then performed which determines the sensitivity of the subproblem design to changes in higher level subproblem controls. The resulting sensitivity derivatives are used to construct constraints which force the controlling subproblems into chosing their own designs so as to improve the lower levels subproblem designs while satisfying their own constraints. The applicability of the proposed algorithm is demonstrated by devising a four-level hierarchy to perform the simultaneous aerodynamic and structural design of a high-performance sailplane wing for maximum cross-country speed. Finally, the concepts discussed are applied to the two-level minimum weight structural design of the sailplane wing. The numerical experiments show that discontinuities in the sensitivity derivatives may delay convergence, but that the algorithm is robust enough to overcome these discontinuities and produce low-weight feasible designs, regardless of whether the optimization is started from the feasible space or the infeasible one.

Barthelemy, J. F. M.↗

NASA NTRS2017

Surface-Height Determination of Crevassed Glaciers-Mathematical Principles of an Autoadaptive Density-Dimension Algorithm and Validation Using ICESat-2 Simulator (SIMPL) Data

Glacial acceleration is a main source of uncertainty in sea-level-change assessment. Measurement of ice-surface heights with a spatial and temporal resolution that not only allows elevation-change calculation, but also captures ice-surface morphology and its changes is required to aid in investigations of the geophysical processes associated with glacial acceleration.The Advanced Topographic Laser Altimeter System aboard NASAs future ICESat-2 Mission (launch 2017) will implement multibeam micropulse photon-counting lidar altimetry aimed at measuring ice-surface heights at 0.7-m along-track spacing. The instrument is designed to resolve spatial and temporal variability of rapidly changing glaciers and ice sheets and the Arctic sea ice. The new technology requires the development of a new mathematical algorithm for the retrieval of height information.We introduce the density-dimension algorithm (DDA) that utilizes the radial basis function to calculate a weighted density as a form of data aggregation in the photon cloud and considers density an additional dimension as an aid in auto-adaptive threshold determination. The auto-adaptive capability of the algorithm is necessary to separate returns from noise and signal photons under changing environmental conditions. The algorithm is evaluated using data collected with an ICESat-2 simulator instrument, the Slope Imaging Multi-polarization Photon-counting Lidar, over the heavily crevassed Giesecke Braer in Northwestern Greenland in summer 2015. Results demonstrate that ICESat-2 may be expected to provide ice-surface height measurements over crevassed glaciers and other complex ice surfaces. The DDA is generally applicable for the analysis of airborne and spaceborne micropulse photon-counting lidar data over complex and simple surfaces.

Herzfeld, Ute C.↗

NASA NTRS1982

A new solution to parameter adaptive estimation of random processes

This paper is concerned with the development of an adaptive state estimator that is capable of tracking switched linear plants that undergo rapid configuration changes. The particular adaptive estimator developed here is called the Sliding Window Detector/Estimator (SWDE) algorithm. Unlike previous algorithms, the SWDE algorithm is designed specifically for the switched-linear plant problem. It uses a joint detection/estimation approach to give a very close approximation to the unrealizable optimum switched-linear estimator. An extremely reliable and accurate estimator can be constructed by combining a modified Parameter Adaptive Estimation (PAE) algorithm with SWDE. The algorithm has been fully verified by extensive computer simulation, and the implementation advantages afforded by this method make it suitable for use in a wide variety of applications.

Zwicke, P. E.↗

NASA NTRS1989

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗

NASA NTRS1974

Weighted adaptive algorithms for estimation of Gaussian distribution parameters

Two weighted adaptive algorithms are proposed for updating the estimates of the mean vector and the covariance matrix, respectively, in a multispectral pattern recognition system. To achieve computational efficiency, the auxiliary matrices have been utilized in the algorithm for covariance matrix updating. Enhancements in the performance accuracy of a multispectral processing system and extensions of the Gaussian maximum likelihood classification capabilities to larger scale surveys are the motivations in developing the algorithms presented herein.

Chang, C. Y.↗

NASA NTRS2019

Goddard Latent Heating (LH) Retrieval Algorithm

Rainfall production is a fundamental process within the Earth's hydrological cycle because it represents both a principal forcing term in surface water budgets, and its energetics corollary, latent heating, is the principal source of atmospheric diabatic heating. Latent heat release itself is a consequence of phase changes between the vapor, liquid, and frozen states of water. The properties of the vertical distribution of latent heat release modulate large-scale meridional and zonal circulations within the Tropics - as well as modify the energetic efficiencies of mid-latitude weather systems. This paper highlights the retrieval of latent heat release from satellite measurements generated by the Tropical Rainfall Measuring Mission (TRMM) and Global Precipitation Mission (GPM) satellite observatory, which were launched in November 1997 and February 2014, respectively. Both TRMM and GPM measurements have been providing an accurate four-dimensional account of rainfall over the global Tropics and mid-latitudes: information that can be used to estimate the space-time structure of latent heating. Two sets of latent heating retrieval algorithm methodologies (Goddard Convective-Stratiform or CSH, and Japan Spectral Latent Heating or SLH) have been developed to estimate latent heating based on rain rate profile retrievals obtained from TRMM and GPM measurements. The CSH algorithm will be described followed by a discussion its improvements and performance against the combined derived surface ran rates. We will also present the CSH retrieved LH for TRMM and GPM.

Tao, Wei-Kuo↗

NASA NTRS2019

Latent Heating Algorithm

Rainfall production is a fundamental process within the Earth's hydrological cycle because it represents both a principal forcing term in surface water budgets, and its energetics corollary, latent heating, is the principal source of atmospheric diabatic heating. Latent heat release itself is a consequence of phase changes between the vapor, liquid, and frozen states of water. The properties of the vertical distribution of latent heat release modulate large-scale meridional and zonal circulations within the Tropics - as well as modify the energetic efficiencies of mid-latitude weather systems. This paper highlights the retrieval of latent heat release from satellite measurements generated by the Tropical Rainfall Measuring Mission (TRMM) and Global Precipitation Measurement (GPM) Mission satellite observatory, which were launched in November 1997 and February 2014, respectively. Both TRMM and GPM measurements have been providing an accurate four-dimensional account of rainfall over the global Tropics and mid-latitudes: information that can be used to estimate the space-time structure of latent heating.Two sets of latent heating (LH) retrieval algorithm methodologies (Goddard Convective-Stratiform Heating or CSH, and Japan's Spectral Latent Heating or SLH) have been developed to estimate latent heating based on rain rate profile retrievals obtained from TRMM and GPM measurements. The differences and similarities between the CSH and SLH algorithm designs will be presented. The presentation then will provide the results of LH structures derived from the TRMM and GPM. At the end of presentation, the further research on latent heating retrieval from satellites will be discussed.

Tao, Wei-Kuo↗

NASA NTRS2010

An Overview of the Landsat Data Continuity Mission

The advent of the Landsat Data Continuity Mission (LDCM), currently with a launch readiness date of December, 2012, will see evolutionary changes in the Landsat data products available from the U.S. Geological Survey (USGS) Earth Resources Observation and Science (EROS) Center. The USGS initiated a revolution in 2009 when EROS began distributing Landsat data products at no cost to requestors in contrast to the past practice of charging the cost of fulfilling a request; that is, charging $600 per Landsat scene. To implement this drastic change, EROS terminated data processing options for requestors and began to produce all data products using a consistent processing recipe. EROS plans to continue this practice for the LDCM and will required new algorithms to process data from the LDCM sensors. All previous Landsat satellites flew multispectral scanners to collect image data of the global land surface. Additionally, Landsats 4, 5, and 7 flew sensors that acquired imagery for both reflective spectral bands and a single thermal band. In contrast, the LDCM will carry two pushbroom sensors; the Operational Land Imager (OLI) for reflective spectral bands and the Thermal InfraRed Sensor (TIRS) for two thermal bands. EROS is developing the ground data processing system that will both calibrate and correct the data from the thousands of detectors employed by the pushbroom sensors and that will also combine the data from the two sensors to create a single data product with registered data for all of the OLI and TIRS bands.

Irons, James R.↗

NASA NTRS1981

Project resource reallocation algorithm

A methodology for adjusting baseline cost estimates according to project schedule changes is described. An algorithm which performs a linear expansion or contraction of the baseline project resource distribution in proportion to the project schedule expansion or contraction is presented. Input to the algorithm consists of the deck of cards (PACE input data) prepared for the baseline project schedule as well as a specification of the nature of the baseline schedule change. Output of the algorithm is a new deck of cards with all work breakdown structure block and element of cost estimates redistributed for the new project schedule. This new deck can be processed through PACE to produce a detailed cost estimate for the new schedule.

Myers, J. E.↗

NASA NTRS1989

A programmable image compression system

A programmable image compression system which has the necessary flexibility to address diverse imaging needs is described. It can compress and expand single frame video images (monochrome or color) as well as documents and graphics (black and white or color) for archival or transmission applications. Through software control, the compression mode can be set for lossless or controlled quality coding; the image size and bit depth can be varied; and the image source and destination devices can be readily changed. Despite the large combination of image data types, image sources, and algorithms, the system provides a simple consistent interface to the programmer. This system (OPTIPAC) is based on the TITMS320C25 digital signal processing (DSP) chip and has been implemented as a co-processor board for an IBM PC-AT compatible computer. The underlying philosophy can readily be applied to different hardware platforms. By using multiple DSP chips or incorporating algorithm specific chips, the compression and expansion times can be significantly reduced to meet performance requirements.

Farrelle, Paul M.↗

NASA NTRS2011

In Situ Surface Characterization

Operation of in situ space assets, such as rovers and landers, requires operators to acquire a thorough understanding of the environment surrounding the spacecraft. The following programs help with that understanding by providing higher-level information characterizing the surface, which is not immediately obvious by just looking at the XYZ terrain data. This software suite covers three primary programs: marsuvw, marsrough, and marsslope, and two secondary programs, which together use XYZ data derived from in situ stereo imagery to characterize the surface by determining surface normal, surface roughness, and various aspects of local slope, respectively. These programs all use the Planetary Image Geometry (PIG) library to read mission-specific data files. The programs themselves are completely multimission; all mission dependencies are handled by PIG. The input data consists of images containing XYZ locations as derived by, e.g., marsxyz. The marsuvw program determines surface normals from XYZ data by gathering XYZ points from an area around each pixel and fitting a plane to those points. Outliers are rejected, and various consistency checks are applied. The result shows the orientation of the local surface at each point as a unit vector. The program can be run in two modes: standard, which is typically used for in situ arm work, and slope, which is typically used for rover mobility. The difference is primarily due to optimizations necessary for the larger patch sizes in the slope case. The marsrough program determines surface roughness in a small area around each pixel, which is defined as the maximum peak-to-peak deviation from the plane perpendicular to the surface normal at that pixel. The marsslope program takes a surface normal file as input and derives one of several slope-like outputs from it. The outputs include slope, slope rover direction (a measure of slope radially away from the rover), slope heading, slope magnitude, northerly tilt, and solar energy (compares the slope with the Sun s location at local noon). The marsuvwproj program projects a surface normal onto an arbitrary plane in space, resulting in a normalized 3D vector, which is constrained to lie in the plane. The marsuvwrot program rotates the vectors in a surface normal file, generating a new surface normal file. It also can change coordinate systems for an existing surface normal file. While the algorithms behind this suite are not particularly unique, what makes the programs useful is their integration into the larger in situ image processing system via the PIG library. They work directly with space in situ data, understanding the appropriate image metadata fields and updating them properly. The secondary programs (marsuvwproj, marsuvwrot) were originally developed to deal with anomalous situations on Opportunity and Spirit, respectively, but may have more general applicability.

Deen, Robert G.↗

NASA NTRS2014

Elastic Model Transitions: A Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes a hybrid approach for determining physical displacements by augmenting the original quadratically constrained least squares (LSQI) algorithm with Direct Shape Mapping (DSM) and modifying the energy constraints. The approach presented is applicable to simulation of the elastic behavior of launch vehicles and other structures that utilize discrete LTI finite element model (FEM) derived mode sets (eigenvalues and eigenvectors) that are propagated throughout time. The time invariant nature of the elastic data presents a problem of how to properly transition elastic states from the prior to the new model while preserving motion across the transition and ensuring there is no truncation or excitation of the system. A previous approach utilizes a LSQI algorithm with an energy constraint to effect smooth transitions between eigenvector sets with no requirement that the models be of similar dimension or have any correlation. This approach assumes energy is conserved across the transition, which results in significant non-physical transients due to changing quasi-steady state energy between mode sets, a phenomenon seen when utilizing a truncated mode set. The computational burden of simulating a full mode set is significant so a subset of modes is often selected to reduce run time. As a result of this truncation, energy between mode sets may not be constant and solutions across transitions could produce non-physical transients. In an effort to abate these transients an improved methodology was developed based on the aforementioned approach, but this new approach can handle significant changes in energy across mode set transitions. It is proposed that physical velocities due to elastic behavior be solved for using the LSQI algorithm, but solve for displacements using a two-step process that independently addresses the quasi-steady-state and non-steady-state contributions to the elastic displacement. For structures subject to large external forces, such as thrust or atmospheric drag, it is imperative to capture these forces when solving for elastic displacement. To simplify the mathematical formulation, assumptions are made regarding mass matrix normalization, constant external forcing, and constant viscous damping. These simplifications allow for direct solutions to the quasi-steady-state displacements through a process titled Direct Shape Mapping. DSM solves for the displacements using the eigenvalues of the elastic modes and the external forcing and returns a set of elastic displacements dictated by the eigenvectors of the post-transition mode set. For the non-steady-state contributions to displacement we formulate a LSQI problem that is constrained by energy of the non-steady state terms. The contributions from the quasi-steady-state and non-steady state solutions are then combined to obtain the physical displacements associated with the new set of eigenvectors. Results for the LSQI-DSM approach show significant reduction/complete removal of transients across mode set transitions while maintaining elastic motion from the prior state. For time propagation applications employing discrete elastic models that need to be transitioned in time and where running with full a full mode set is not feasible, the method developed offers a practical solution to simulating vehicle elasticity.

Hannan, Mike R.↗