SEARCH · Search NASA

Results for “algorithmic structures”

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 847 records · Page 47

All sources NASA NTRS DOE OSTI

NASA NTRS2004

An Evolved Antenna for Deployment on NASA's Space Technology 5 Mission

We present an evolved X - band antenna design and flight prototype currently on schedule to be deployed on NASA's Space Technology 5(ST5) spacecraft. Current methods of designing and optimizing antennas by hand are time and labor intensive, limit complexity and require significant expertise and experience. Evolutionary design techniques can overcome these limitations by searching the design space and automatically finding effective solutions that would ordinarily not be found. The ST5 antenna was evolved to meet a challenging set of mission requirements, most notably the combination of wide beamwidth for a circularly-polarized wave and wide bandwidth.Two evolutionary algorithms were used: one used a genetic algorithm style representation that did not allow branching in the antenna arms: the second used a genetic programming style tree-structured representation that allowed branching in the antenna arms. The highest performance antennas from both algorithms were fabricated and tested and both yielded similar performance. Both were comparable in performance to a hand-designed antenna produced by a contractor for the mission, and so we consider them examples of human-competitive performance by evolutionary algorithms. One of the evolved antenna prototypes is undergoing flight qualification testing.

Lohn, Jason D.↗

NASA NTRS2018

Applications of the Dynamic N-Dimensional K-Vector

The n-dimensional k-vector (NDKV) is an appealing alternative to binary tress for resolving complex queries in large relational databases. The method has excelled in several applications involving static databases. The present paper extends the theory supporting the NDKV to handle dynamic databases, where the data is updated frequently. This includes deleting records, adding new entries, or editing existing elements. The merit of this new version of the NDKV, the dynamic n-dimensional k-vector (DNDKV), is that it is no longer necessary to recompute the entire k-vector (the main structure that indexes the data) every time a record changes. The algorithm updates the four constituents of the standard NDKV on the ﬂy: the database, sorted database, index, and k-vector tables. As a result, the DNDKV becomes comparable in terms of capabilities and ﬂexibility to stateof-the-art storage engines relying on structured query languages (SQL). The performance of the DNDKV is assessed by running typical read/write operations on a database that contains millions of pre-computed missions to celestial bodies. This database requires frequent updates whenever an orbit solution is reﬁned or new bodies are discovered. The DNDKV is faster than rebuilding the k-vector tables completely, provided that the number of elements being added or removed is not excessively large. Direct runtime comparisons with MySQL suggest that the DNDKV is several times faster for reading but might be slower for writing and updating the database. One limit of the technique is the elements being added must be within the range of the current k-vector tables. If this is not the case, the technique cannot be used and the k-vector tables must be rebuilt from scratch.

Mortari, Daniele↗

NASA NTRS2011

Producing Science-Ready Radar Datasets for the Retrieval of Forest Structure Parameters from Backscatter: Correcting for Terrain Topography and Changes in Vegetation Reflectivity

Radar backscatter data contain both geometric and radiometric distortions due to underlying topography and the radar viewing geometry. Our objective is to develop a radiometric correction algorithm specific to the UAVSAR system configuration that would improve retrieval of forest structure parameters. UAVSAR is an airborne Lband radar capable of repeat?pass interferometry producing images with a spatial resolution of 5m. It is characterized by an electronically steerable antenna to compensate for aircraft attitude. Thus, the computation of viewing angles (i.e. look, incidence and projection) must include aircraft attitude angles (i.e. yaw, pitch and roll) in addition to the antenna steering angle. In this presentation, we address two components of radiometric correction: area projection and vegetation reflectivity. The first correction is applied by normalization of the radar backscatter by the local ground area illuminated by the radar beam. The second is a correction due to changes in vegetation reflectivity with viewing geometry.

polarimetry↗

NASA NTRS2007

NavP: Structured and Multithreaded Distributed Parallel Programming

We present Navigational Programming (NavP) -- a distributed parallel programming methodology based on the principles of migrating computations and multithreading. The four major steps of NavP are: (1) Distribute the data using the data communication pattern in a given algorithm; (2) Insert navigational commands for the computation to migrate and follow large-sized distributed data; (3) Cut the sequential migrating thread and construct a mobile pipeline; and (4) Loop back for refinement. NavP is significantly different from the current prevailing Message Passing (MP) approach. The advantages of NavP include: (1) NavP is structured distributed programming and it does not change the code structure of an original algorithm. This is in sharp contrast to MP as MP implementations in general do not resemble the original sequential code; (2) NavP implementations are always competitive with the best MPI implementations in terms of performance. Approaches such as DSM or HPF have failed to deliver satisfying performance as of today in contrast, even if they are relatively easy to use compared to MP; (3) NavP provides incremental parallelization, which is beyond the reach of MP; and (4) NavP is a unifying approach that allows us to exploit both fine- (multithreading on shared memory) and coarse- (pipelined tasks on distributed memory) grained parallelism. This is in contrast to the currently popular hybrid use of MP+OpenMP, which is known to be complex to use. We present experimental results that demonstrate the effectiveness of NavP.

navigational programming (NavP)↗

NASA NTRS1996

An Analysis of Gamma-ray Burst Time Profiles from the Burst and Transient Source Experiment

This proposal requested funding to measure the durations of gamma-ray bursts (GRB) in the 4B catalog as well as to study the structure of GRB time profiles returned by the Burst And Transient Source Experiment (BATSE) on board the Compton Gamma-Ray Observatory. The duration (T90) was to be measured using the same techniques and algorithms developed by the principal investigator for the 3B data. The profile structure studies fall into the two categories of variability and fractal analyses.

Lestrade, John Patrick↗

NASA NTRS1985

Control of Flexible Structures (COFS) Flight Experiment Program

The Control of Flexible Structures (COFS) Flight Experiment Program consists of a series of four Shuttle-attached experiments specifically designed to systematically evaluate algorithms and techniques for on-orbit systems identification and flexible body control of large flexible structures, and as such, develops the enabling technologies for future NASA missions such as the evolutionary Space Station and large orbital antennas. These flight experiments are conducted on 1-year centers starting in 1989. This paper presents a description of the test article for the first two flights (COFS-I) and a discussion of the strategy for conducting the various experiments. A guest investigator program provides the opportunity for the research community to participate in the structures/controls research associated with the multi-flight COFS Program.

Fontana, A.↗

NASA NTRS1991

Dynamic analysis of truss-beam system

A simple truss-beam method for determining the dynamic characteristics of the space structures intended to perform various tasks in orbit is presented. Algorithms are provided to determine the flexibility matrix of the truss beam for use in the equation of motion. The natural frequencies obtained through this method are compared with those obtained through the finite element method. An experimental procedure for verifying the theoretical results is described. It is concluded that the truss-beam method is a simple analysis technique that yields reasonably accurate results with a minimum of computational effort, especially for the critical lower bending modes of flexible structures. The method takes less computer time than more conventional methods and can be programed in both BASIC and FORTRAN for use in micro- and mainframe computers.

Abu-Saba, Elias G.↗

NASA NTRS1978

Finite element dynamic analysis on CDC STAR-100 computer

Computational algorithms are presented for the finite element dynamic analysis of structures on the CDC STAR-100 computer. The spatial behavior is described using higher-order finite elements. The temporal behavior is approximated by using either the central difference explicit scheme or Newmark's implicit scheme. In each case the analysis is broken up into a number of basic macro-operations. Discussion is focused on the organization of the computation and the mode of storage of different arrays to take advantage of the STAR pipeline capability. The potential of the proposed algorithms is discussed and CPU times are given for performing the different macro-operations for a shell modeled by higher order composite shallow shell elements having 80 degrees of freedom.

Noor, A. K.↗

NASA NTRS1986

Multiplier Architecture for Coding Circuits

Multipliers based on new algorithm for Galois-field (GF) arithmetic regular and expandable. Pipeline structures used for computing both multiplications and inverses. Designs suitable for implementation in very-large-scale integrated (VLSI) circuits. This general type of inverter and multiplier architecture especially useful in performing finite-field arithmetic of Reed-Solomon error-correcting codes and of some cryptographic algorithms.

Wang, C. C.↗

NASA NTRS2024

A Trajectory-Tracking Algorithm for the LSMS Family of Cable-Driven Cranes

The Lightweight Surface Manipulation System, or LSMS, is a family of scalable long-reach cable-actuated manipulators. The design of the LSMS has a high payload ratio for efficient operations on planetary surfaces like the Moon or Mars. The LSMS has nonlinear, coupled, and hybrid dynamics. The engineering decisions that led to these challenging dynamics make this structure light and efficient. This paper proposes a novel trajectory tracking algorithm for these cranes that facilitates precise autonomous and teleoperated operations. This algorithm enables these robots to follow complex trajectories that avoid obstacles and pickup regolith in a construction site.

trajectory tracking↗

NASA NTRS1989

Computational complexities and storage requirements of some Riccati equation solvers

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

Utku, Senol↗

NASA NTRS1992

Design of structure/control systems with transient response constraints exhibiting relative minima

Structural optimization problems involving dynamic behavior constraints often exhibit nonconvex design spaces. The direct application of a global optimization algorithm requires a large number of function evaluations which in term require a large number of dynamic structural analyses. This work presents a strategy aimed at finding the global optimum for problems with transient dynamic behavior constraints based on approximation concepts. The method consists of generating and solving a sequence of approximate problems using a global optimizer. The approximations are explicit and capture the inherent nonconvexity of the exact functions. A simple example problem is presented.

Sepulveda, A. E.↗

NASA NTRS1992

Controlled motion in an elastic world. Research project: Manipulation strategies for massive space payloads

The flexibility of the drives and structures of controlled motion systems are presented as an obstacle to be overcome in the design of high performance motion systems, particularly manipulator arms. The task and the measure of performance to be applied determine the technology appropriate to overcome this obstacle. Included in the technologies proposed are control algorithms (feedback and feed forward), passive damping enhancement, operational strategies, and structural design. Modeling of the distributed, nonlinear system is difficult, and alternative approaches are discussed. The author presents personal perspectives on the history, status, and future directions in this area.

Book, Wayne J.↗

NASA NTRS1993

Controlled motion in an elastic world

Book, Wayne J.↗

NASA NTRS2024

A Trajectory Tracking Algorithm for the LSMS Family of Cable-Driven Crane

lunar operations↗

NASA NTRS1971

Analytical methods for performance evaluation of nonlinear filters.

In the investigation, the filtering problem is considered in the continuous time domain. The postulated simple suboptimal nonlinear filter structure closely parallels the structure of the Kalman-Bucy optimal linear filter algorithm. Two filter performance evaluation methods are developed based on the Kolmogorov equations for the transition density of Markov processes. The expansions in the approximations for the nonlinear system and observation functions are in effect carried out up to second-order terms in both methods. The description of the filter's performance is sought in terms of second-order statistics in both methods.

Bejczy, A. K.↗

NASA NTRS1979

A new approach to the solution of large, full matrix equations: A two-dimensional potential flow feasibility study

An approach to the solution of matrix problems resulting from integral equations of mathematical physics is presented. Based on the inherent smoothness in such equations, the problem is reformulated using a set of orthogonal basis vectors, leading to an equivalent coefficient problem which can be of lower order without significantly impairing the accuracy of the solution. This approach was evaluated using a two-dimensional Neumann problem describing the inviscid, incompressible flow over an airfoil. Two different kinds of mode functions were investigated, namely eigenfunction series and Fourier series. The method using Fourier series was found preferable. It uses all of the coefficients from a Fast Fourier Transform algorithm in an approximate method which exploits the known structure of the transformed coefficient matrix and very promising results for the flow over a realistic airfoil are obtained. On the basis of the results presented here, an order of magnitude reduction in this computer time can be expected for such problems as compared with the time for a direct matrix solution.

James, R. M.↗

NASA NTRS1982

Rain measurements from space using a modified Seasat-type radar altimeter

The incorporation in the 13.5 GHz Seasat-type radar altimeter of a mode to measure rain rate is investigated. Specifically, an algorithm is developed relating the echo power at the various range bins, to the rain rate taking into consideration Mie scattering and path attenuation. The dependence of the algorithm on rain drop size distribution and nonuniform rain structure are examined and associated uncertainties defined. A technique for obtaining drop size distribution through the measurements of power at the top of the raincell and power difference through the cell also is investigated together with an associated error analysis. A description of the minor hardware modifications to the basic Seasat design is given for implementing the rain measurements.

Goldhirsh, J.↗