Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error guarantees”

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.

124 records · Page 7

Analysis of adaptive identifiers in the presence of unmodelled dynamics: Averaging and tuned parameters

The behavior of a standard identifier is analyzed for the case in which the plant contains additional dynamics, called unmodeled dynamics, which invalidate the known order assumption. An input richness condition is obtained that does not depend on the order of the unmmodeled dynamics to guarantee persistency of excitation (PE) of the regressor. It is shown that the PE condition leads to a BIBO stability property for the identifier. The method of averaging is used to define formally the notion of tuned parameters as the equilibrium of the identifier-averaged system. It is shown that the tuned parameters always exist and that the actual parameters converge to some neighborhood of the tuned parameters. An explicit expression is derived to calculate and interpret them as the fixed parameter values that minimize the mean-squared output error.

Mason, J. E.↗

Nonlinear system controller design based on domain of attaction: An application to CELSS analysis and control

Nonlinear system controller design based on the domain of attraction is presented. This is particularly suited to investigating Closed Ecological Life Support Systems (CELSS) models. In particular, the dynamic consequences of changes in the waste storage capacity and system mass, and how information is used for control in CELSS models are examined. The models' high dimensionality and nonlinear state equations make them difficult to analyze by any other technique. The domain of attraction is the region in initial conditions that tend toward an attractor and it is delineated by randomly selecting initial conditions from the region of state space being investigated. Error analysis is done by repeating the domain simulations with independent samples. A refinement of this region is the domain of performance which is the region of initial conditions meeting a performance criteria. In nonlinear systems, local stability does not insure stability over a larger region. The domain of attraction marks out this stability region; hence, it can be considered a measure of a nonlinear system's ability to recovery from state perturbations. Considering random perturbations, the minimum radius of the domain is a measure of the magnitude of perturbations for which recovery is guaranteed. Design of both linear and nonlinear controllers are shown. Three CELSS models, with 9 to 30 state variable, are presented. Measures of the domain of attraction are used to show the global behavior of these models under a variety of design and controller scenarios.

Babcock, P. S., IV↗

Approximate effect of parameter pseudonoise intensity on rate of convergence for EKF parameter estimators

When using parameter estimation methods based on extended Kalman filter (EKF) theory, it is common practice to assume that the unknown parameter values behave like a random process, such as a random walk, in order to guarantee their identifiability by the filter. The present work is the result of an ongoing effort to quantitatively describe the effect that the assumption of a fictitious noise (called pseudonoise) driving the unknown parameter values has on the parameter estimate convergence rate in filter-based parameter estimators. The initial approach is to examine a first-order system described by one state variable with one parameter to be estimated. The intent is to derive analytical results for this simple system that might offer insight into the effect of the pseudonoise assumption for more complex systems. Such results would make it possible to predict the estimator error convergence behavior as a function of the assumed pseudonoise intensity, and this leads to the natural application of the results to the design of filter-based parameter estimators. The results obtained show that the analytical description of the convergence behavior is very difficult.

Hill, Bryon K.↗

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗

A least-squares finite element method for incompressible Navier-Stokes problem

Most finite element schemes for solving the Navier-Stokes equations can be categorized into the Galerkin mixed method and the penalty method. The mixed method leads to a saddle-point problem. In order to guarantee the existence of a solution, the combination of velocity and pressure interpolations requires satisfaction of the Ladyzhenskaya Babuska Brezzi (LBB) consistency condition which precludes the use of equal order interpolations and many seemingly natural pairs of velocity and pressure elements. In a previous paper a least-squares finite element method based on the first order velocity-pressure-vorticity formulation for the Stokes problem was proposed. This method leads to a minimization problem. The choice of combination of elements is thus not subject to the LBB condition. The numerical experiments exhibit the optimal rate of convergence for all variables with equal order interpolations. A theoretical error analysis supports the numerical results. In this paper the least-squares finite element method is extended to solving the incompressible Navier-Stokes problem.

Jiang, Bonan↗

Concrete Model Checking with Abstract Matching and Refinement

We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to he generated, but instead executes the concrete transitions while storing abstract versions of the concrete states, as specified by a set of abstraction predicates. For each explored transition. the method checks, with the help of a theorem prover, whether there is any loss of precision introduced by abstraction. The results of these checks are used to decide termination or to refine the abstraction, by generating new abstraction predicates. If the (possibly infinite) concrete system under analysis has a finite bisimulation quotient, then the method is guaranteed to eventually explore an equivalent finite bisimilar structure. We illustrate the application of the approach for checking concurrent programs. We also show how a lightweight variant can be used for efficient software testing.

Pasareanu Corina S.↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

Spatial and Temporal Deconfliction of Trajectories in the Presence of Uncertainties

Demonstration of conflict-free movement for multi-agent teams in challenging scenarios is crucial in developing trust and trustworthiness in an autonomous transport system. Tolerance verification queries are explored as a mechanism to enforce spatial and temporal deconfliction for a cooperating team of Unmanned Aerial Systems (UAS) with prescribed heterogeneous path-following performance. Obstacles in the environment are modelled as set of polyhedra, whereas each vehicle’s trajectory is represented as a sequence of polynomial curves with C2 continuity, expressed in a Bernstein basis. Each vehicle is modelled as a point mass and a safety distance, informed by the geometry of the UAS and the worst-case path-following error. This defines a tube around the trajectories where each UAS is most likely to fly through. In addition, obstacles in the environment have an associated safety buffer around them to account for the uncertainty in their location and geometric description. The tolerance verification queries explored in this paper combine the safety distance information from each UAS and environmental hazard to compute trajectories that are contained within the safe configuration space. Tolerance verification is also compared with other proximity queries to determine the suitability of each method along the different steps of the trajectory generation algorithm. This paper analyzes the fitness and performance of three proximity queries – collision, tolerance verification, and distance computations – between polyhedral and polynomial curves to ensure deconfliction between obstacles and vehicles, but also between polynomial curves to guarantee safe separation among cooperating UAS.

trajectory generation↗

Mitigating Fading in Cislunar Communications: Application to the Human Landing System

NASA’s human exploration program is currently working towards landing astronauts on the surface of the Moon by 2024, close the lunar South Pole. To guarantee astronaut safety and maximize science data return, NASA is in the process of defining the communication architecture that will support all astronaut activities from launch to surface operations. Of particular interest to this paper are links from the lunar surface back to Earth without any intermediate relays. We show that the system geometry is such that antennas on the landing system will need to be pointed at low elevation angles, thus potentially causing multi-path fading effects not typically encountered in space communications. This paper is organized in three parts. First, we characterize the multi-path fading effects expected in links between the lunar South Pole and Earth and show that for moderate data rates (less than 1 Mbps) the links suffer from slow fading. We then show that for this operations regime the performance of forward error correction schemes is significantly worse for traditional Additive White Gaussian Noise channels. Finally, we investigate multi-copy mechanisms to mitigate the effects of fading, most notably repetition schemes and Automatic Repeat Request.

Sanchez Net, Marc↗

Robust time and frequency domain estimation methods in adaptive control

A robust identification method was developed for use in an adaptive control system. The type of estimator is called the robust estimator, since it is robust to the effects of both unmodeled dynamics and an unmeasurable disturbance. The development of the robust estimator was motivated by a need to provide guarantees in the identification part of an adaptive controller. To enable the design of a robust control system, a nominal model as well as a frequency-domain bounding function on the modeling uncertainty associated with this nominal model must be provided. Two estimation methods are presented for finding parameter estimates, and, hence, a nominal model. One of these methods is based on the well developed field of time-domain parameter estimation. In a second method of finding parameter estimates, a type of weighted least-squares fitting to a frequency-domain estimated model is used. The frequency-domain estimator is shown to perform better, in general, than the time-domain parameter estimator. In addition, a methodology for finding a frequency-domain bounding function on the disturbance is used to compute a frequency-domain bounding function on the additive modeling error due to the effects of the disturbance and the use of finite-length data. The performance of the robust estimator in both open-loop and closed-loop situations is examined through the use of simulations.

Lamaire, Richard Orville↗

Automatic Overset Grid Generation with Heuristic Feedback Control

An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.

Robinson, Peter I.↗

Convergence properties of finite-difference hydrodynamics schemes in the presence of shocks

We investigate the asymptotic convergence of finite-difference schemes for the Euler equations when the limiting solution contains shocks. The Lax-Wendroff theorem guarantees that certain conservative schemes converge to correct, physically valid solutions. We focus on two one-dimensional operator-split schemes with explicit artificial-viscosity terms. One, an internal-energy scheme, does not satisfy the assumptions of Lax-Wendroff; the other, a conservative total-energy scheme, does. With viscous lengths chosen proportional to the grid size, we find that both schemes converge to their zero-grid-size limits at the theoretically expected rate, but only the conversative scheme converges toward correct solutions of the inviscid fluid equations. We show that the difference in their behaviors results directly from the presence of shocks in the limiting solution. Empirically, we find that when the viscous lenghts tend toward zero more slowly than the grid size, however the nonconservative scheme also converges toward correct solutions. We characterize the asymptotic behavior of the total-energy scheme in a particular problem in which a shock forms. As the grid is refined, a Cauchy error approaches the expected rate of change slowly. We show that the changes in the artificial viscosity alter the diffusion of small-amplitude waves. The differences associated with such waves make the dominant contribution to the Cauchy error. We formulate an analytic model to relate the rate of approach to the effect of varying diffusion in waves and find quantitative agreement with our numerical results.

Kimoto, Paul A.↗

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

Trajectory Specification Applied to Terminal Airspace

Despite major efforts to automate air traffic control (ATC), it is still performed by humans today. The complexity and safety-criticality of ATC makes it very difficult to safely automate, but it must be automated to increase airspace capacity (the density of traffic that can be safely managed) and airport throughput (the number of arrivals and departures that an airport can safely handle in a given period of time) beyond what is possible with human controllers. This paper presents the Trajectory Specification (TS) concept, which can help to safely automate ATC. TS is a method of specifying aircraft trajectories such that the position at any given time in flight is restricted to a precisely defined bounding space, removing all ambiguity as to where the flight is allowed to be. The bounding space or volume is determined by tolerances relative to a reference trajectory (position as a function of time). The tolerances are dynamic and are based on the aircraft navigation capabilities and the traffic situation. The tolerances can be a piecewise linear function of time or distance along the route, allowing the tolerances to vary as needed, typically increasing with time for departures and decreasing for arrivals. A Trajectory Specification Language (TSL) is proposed for communicating trajectories from aircraft to ATC as requests and from ATC to aircraft as assignments. The TS concept requires a new generation of airborne Flight Management Systems (FMS) that understand the TSL and can fly the assigned trajectories, but this paper focuses on the ATC functions and the prototype ATC algorithms and software that were developed to test the TS concept. Assuming conformance, TS can guarantee safe separation for an arbitrary length of time even in the event of an ATC system or communication outage. It can help to achieve the high level of safety and reliability needed for ATC automation, and it can also reduce the reliance on ATC backup systems for tactical conflict detection and resolution during normal operation. TS can be applied to any controlled airspace, including enroute, terminal, and urban airspace, but this paper presents algorithms and software for arrival spacing and conflict detection and resolution in the terminal airspace serving a major airport. In a fast-time simulation of a full day of traffic in a major terminal airspace, all conflicts were resolved in near real time, demonstrating the computational feasibility and the preliminary operational feasibility of the TS concept. This paper is a compilation of previous papers, and it adds significant information that was omitted from those papers due to length limitations. It also updates some of the results of those earlier papers due to algorithm refinements and corrections of minor software errors.

air traffic control, trajectory↗

Science Benefits of Onboard Spacecraft Navigation

Primitive bodies (asteroids and comets), which have remained relatively unaltered since their formation, are important targets for scientific missions that seek to understand the evolution of the solar system. Often the first step is to fly by these bodies with robotic spacecraft. The key to maximizing data returns from these flybys is to determine the spacecraft trajectory relative to the target body-in short, navigate the spacecraft- with sufficient accuracy so that the target is guaranteed to be in the instruments' field of view. The most powerful navigation data in these scenarios are images taken by the spacecraft of the target against a known star field (onboard astrometry). Traditionally, the relative trajectory of the spacecraft must be estimated hours to days in advance using images collected by the spacecraft. This is because of (1)!the long round-trip light times between the spacecraft and the Earth and (2)!the time needed to downlink and process navigation data on the ground, make decisions based on the result, and build and uplink instrument pointing sequences from the results. The light time and processing time compromise navigation accuracy considerably, because there is not enough time to use more accurate data collected closer to the target-such data are more accurate because the angular capability of the onboard astrometry is essentially constant as the distance to the target decreases, resulting in better "plane-of- sky" knowledge of the target. Excellent examples of these timing limitations are high-speed comet encounters. Comets are difficult to observe up close; their orbits often limit scientists to brief, rapid flybys, and their coma further restricts viewers from seeing the nucleus in any detail, unless they can view the nucleus at close range. Comet nuclei details are typically discernable for much shorter durations than the roundtrip light time to Earth, so robotic spacecraft must be able to perform onboard navigation. This onboard navigation can be accomplished through a self- contained system that by eliminating light time restrictions dramatically improves the relative trajectory knowledge and control and subsequently increases the amount of quality data collected. Flybys are one-time events, so the system's underlying algorithms and software must be extremely robust. The autonomous software must also be able to cope with the unknown size, shape, and orientation of the previously unseen comet nucleus. Furthermore, algorithms must be reliable in the presence of imperfections and/or damage to onboard cameras accrued after many years of deep-space operations. The AutoNav operational flight software packages, developed by scientists at the Jet Propulsion Laboratory (JPL) under contract with NASA, meet all these requirements. They have been directly responsible for the successful encounters on all of NASA's close-up comet-imaging missions (see Figure !1). AutoNav is the only system to date that has autonomously tracked comet nuclei during encounters and performed autonomous interplanetary navigation. AutoNav has enabled five cometary flyby missions (Table!1) residing on four NASA spacecraft provided by three different spacecraft builders. Using this software, missions were able to process a combined total of nearly 1000 images previously unseen by humans. By eliminating the need to navigate spacecraft from Earth, the accuracy gained by AutoNav during flybys compared to ground-based navigation is about 1!order of magnitude in targeting and 2!orders of magnitude in time of flight. These benefits ensure that pointing errors do not compromise data gathered during flybys. In addition, these benefits can be applied to flybys of other solar system objects, flybys at much slower relative velocities, mosaic imaging campaigns, and other proximity activities (e.g., orbiting, hovering, and descent/ascent).

Autonomy↗