Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coordinate computing”

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.

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
NASA NTRS1973

Calculation of unsteady transonic aerodynamics for oscillating wings with thickness.

An analytical approach is presented to account for some of the nonlinear characteristics of the transonic flow equation for finite thickness wings undergoing harmonic oscillation at sonic flight speed in an inviscid, shock-free fluid. The thickness effect is accounted for in the analysis through use of the steady local Mach number distribution over the wing at its mean position by employing the local linearization concept and a coordinate transformation. Computed results are compared with that of the linearized theory and experiments. Application to a flutter problem is shown.

Ruo, S. Y.↗
NASA NTRS1977

The navigation system of the JPL robot

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery.

Thompson, A. M.↗
NASA NTRS1985

Advanced dc-Traction-Motor Control System

Motor-control concept for battery-powered vehicles includes stateof-the-art power-transistor switching and separate excitation of motor windings in traction and regenerative braking. Switching transistors and other components of power-conditioning subsystem operate under control of computer that coordinates traction, braking, and protective functions.

Vittone, O.↗
NASA NTRS1989

Dynamic analysis of a 6 DOF CKCM robot end-effector for dual-arm telerobot systems

A dynamical analysis is performed for a six DOF robot end-effector built to study telerobotic service and maintenance of NASA hardwares in space. The design of the end-effector is based on the concept of closed-kinematic chain mechanism capable of performing precise motion in a small workspace. After presenting a closed-form solution for the inverse kinematic problem, the Lagrangian approach is used to derive a set of equations of motion for the end-effector where the generalized coordinates are selected to be the Cartesian coordinates. A computer simulation study shows that the centrifugal and Coriolis terms can be neglected for slow motion.

Nguyen, Charles C.↗
NASA NTRS1990

Anthropomorphic dual-arm space telemanipulation system

Dexterous dual-arm manipulations are feasible with the system described and illustrated in the paper. The structure is based on an extensible host arm that carries the dual-arm robot which comprises two 7-DOF arms each of which includes a hand with a thumb and three fingers with 4 DOF each. Joint compliance can be stiffened to any level, and the operator uses arm harnesses and gloves to utilize the robotics in an anthropomorphic fashion. The configuration eliminates coordinate-transformation computations, and the system is found to achieve a control-frequency rate of 1000 Hz for its direct man/machine interfaces based on fiber-optic cables. The electronics control for the system utilizes a sensory system consisting of force, position, and compliance sensors. The robotics system is expected to be a user-friendly device that permits assembly, repair, tethering, and other complex mechanical operations.

Jau, Bruno M.↗
NASA NTRS1996

Modeling, Monitoring and Fault Diagnosis of Spacecraft Air Contaminants

Progress and results in the development of an integrated air quality modeling, monitoring, fault detection, and isolation system are presented. The focus was on development of distributed models of the air contaminants transport, the study of air quality monitoring techniques based on the model of transport process and on-line contaminant concentration measurements, and sensor placement. Different approaches to the modeling of spacecraft air contamination are discussed, and a three-dimensional distributed parameter air contaminant dispersion model applicable to both laminar and turbulent transport is proposed. A two-dimensional approximation of a full scale transport model is also proposed based on the spatial averaging of the three dimensional model over the least important space coordinate. A computer implementation of the transport model is considered and a detailed development of two- and three-dimensional models illustrated by contaminant transport simulation results is presented. The use of a well established Kalman filtering approach is suggested as a method for generating on-line contaminant concentration estimates based on both real time measurements and the model of contaminant transport process. It is shown that high computational requirements of the traditional Kalman filter can render difficult its real-time implementation for high-dimensional transport model and a novel implicit Kalman filtering algorithm is proposed which is shown to lead to an order of magnitude faster computer implementation in the case of air quality monitoring.

Ramirez, W. Fred↗
NASA NTRS1996

Satellite Angular Rate Estimation From Vector Measurements

This paper presents an algorithm for estimating the angular rate vector of a satellite which is based on the time derivatives of vector measurements expressed in a reference and body coordinate. The computed derivatives are fed into a spacial Kalman filter which yields an estimate of the spacecraft angular velocity. The filter, named Extended Interlaced Kalman Filter (EIKF), is an extension of the Kalman filter which, although being linear, estimates the state of a nonlinear dynamic system. It consists of two or three parallel Kalman filters whose individual estimates are fed to one another and are considered as known inputs by the other parallel filter(s). The nonlinear dynamics stem from the nonlinear differential equation that describes the rotation of a three dimensional body. Initial results, using simulated data, and real Rossi X ray Timing Explorer (RXTE) data indicate that the algorithm is efficient and robust.

Azor, Ruth↗
NASA NTRS1959

Turbulent Boundary Layer on a Yawed Cone in a Supersonic Stream

The momentum integral equations are derived for the boundary layer on an arbitrary curved surface, using a streamline coordinate system. Computations of the turbulent boundary layer on a slightly yawed cone are made for a Prandtl number of 0.729, wall to free-stream temperature ratios of 1/2, 1, and 2, and Mach numbers from 1 to 4. Deflection of the fluid in the boundary layer from outer stream direction, local friction coefficient, displacement surface, lift coefficient, and pitching-moment coefficient are presented.

Braun, Willis H.↗
NASA NTRS2016

Simultaneous Boundary-Layer Transition, Tip Vortex, and Blade Deformation Measurements of a Rotor in Hover

This paper describes simultaneous optical measurements of a sub-scale helicopter rotor in the U.S. Army Hover Chamber at NASA Ames Research Center. The measurements included thermal imaging of the rotor blades to detect boundary layer transition; retro-reflective background-oriented schlieren (RBOS) to visualize vortices; and stereo photogrammetry to measure displacements of the rotor blades, to compute spatial coordinates of the vortices from the RBOS data, and to map the thermal imaging data to a three-dimensional surface grid. The test also included an exploratory effort to measure flow near the rotor tip by tomographic particle image velocimetry (tomo PIV)an effort that yielded valuable experience but little data. The thermal imaging was accomplished using an image-derotation method that allowed long integration times without image blur. By mapping the thermal image data to a surface grid it was possible to accurately locate transition in spatial coordinates along the length of the rotor blade.

Rotorcraft↗
NASA NTRS1980

Documentation of program COORDC to generate and coordinate system for 3D corners with or without fillet using body fitted curvilinear coordinates, part 2

The computer program COORDC generates a body fitted curvilinear coordinate system for corner geometry with or without corner fillets. It is assumed that at any given xi, x remains constant; consequently the only variation is in y and z. It is also assumed that for all xi's in the physical plane the coordinate system in y-z plane is similar. This enables solution of coordinate system for one particular xi = 1 (x for xi = 1 is arbitrarily chosen to be 0.0) and the solution for all other xi plane can be easily specified once the coordinates in the physical plane on the line 1 or = to xi or = to IMAX, eta = 1, zeta = 1 are specified.

Kumar, D.↗
NASA NTRS1980

Documentation of program AFTBDY to generate coordinate system for 3D after body using body fitted curvilinear coordinates, part 1

The computer program AFTBDY generates a body fitted curvilinear coordinate system for a wedge curved after body. This wedge curved after body is being used in an experimental program. The coordinate system generated by AFTBDY is used to solve 3D compressible N.S. equations. The coordinate system in the physical plane is a cartesian x,y,z system, whereas, in the transformed plane a rectangular xi, eta, zeta system is used. The coordinate system generated is such that in the transformed plane coordinate spacing in the xi, eta, zeta direction is constant and equal to unity. The physical plane coordinate lines in the different regions are clustered heavily or sparsely depending on the regions where physical quantities to be solved for by the N.S. equations have high or low gradients. The coordinate distribution in the physical plane is such that x stays constant in eta and zeta direction, whereas, z stays constant in xi and eta direction. The desired distribution in x and z is input to the program. Consequently, only the y-coordinate is solved for by the program AFTBDY.

Kumar, D.↗
NASA NTRS1989

Efficient grid generation

Because the governing equations in fluid dynamics contain partial differentials and are too difficult in most cases to solve analytically, these differentials are generally replaced by finite difference terms. These terms contain terms in the solution at nearby states. This procedure discretizes the field into a finite number of states. These states, when plotted, form a grid, or mesh, of points. It is at these states, or field points, that the solution is found. The optimum choice of states, the x, y, z coordinate values, minimizes error and computational time. But the process of finding these states is made more difficult by complex boundaries, and by the need to control step size differences between the states, that is, the need to control the spacing of field points. One solution technique uses a different set of state variables, which define a different coordinate system, to generate the grid more easily. A new method, developed by Dr. Joseph Steger, combines elliptic and hyperbolic partial differential equations into a mapping function between the physical and computational coordinate systems. This system of equations offers more control than either equation provides alone. The Steger algorithm was modified in order to allow bodies with stronger concavities to be used, offering the possibility of generating a single grid about multiple bodies. Work was also done on identifying areas where grid breakdown occurs.

Seki, Rycichi↗
NASA NTRS1978

Body-fitted coordinates systems transformations

Two computer programs generate two-dimensional body-fitted coordinate systems and coordinate transformation. Programs are useful in fields requiring accurate numerical representation of boundary conditions and accurate numerical solutions of partial differential equations.

Mastin, C. W.↗
NASA NTRS1966

Laser measuring system accurately locates point coordinates on photograph

Laser activated ultraprecision ranging apparatus interfaced with a computer determines point coordinates on a photograph. A helium-neon gas CW laser provides collimated light for a null balancing optical system. This system has no mechanical connection between the ranging apparatus and the photograph.

Doede, J. H.↗
NASA NTRS1976

Protection coordination of the Kennedy Space Center electric distribution network

A computer technique is described for visualizing the coordination and protection of any existing system of devices and settings by plotting the tripping characteristics of the involved devices on a common basis. The program determines the optimum settings of a given set of protective devices and configuration in the sense of the best expected coordinated operation of these devices. Subroutines are given for simulating time versus current characteristics of the different relays, circuit breakers, and fuses in the system; coordination index computation; protection checks; plotting; and coordination optimation.

Source record↗