Search NASA⌕ Search

SEARCH · Search NASA

Results for “object orientation algorithms”

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 307 records · Page 17

Algorithms for high aspect ratio oriented triangulations

Grid generation plays an integral part in the solution of computational fluid dynamics problems for aerodynamics applications. A major difficulty with standard structured grid generation, which produces quadrilateral (or hexahedral) elements with implicit connectivity, has been the requirement for a great deal of human intervention in developing grids around complex configurations. This has led to investigations into unstructured grids with explicit connectivities, which are primarily composed of triangular (or tetrahedral) elements, although other subdivisions of convex cells may be used. The existence of large gradients in the solution of aerodynamic problems may be exploited to reduce the computational effort by using high aspect ratio elements in high gradient regions. However, the heuristic approaches currently in use do not adequately address this need for high aspect ratio unstructured grids. High aspect ratio triangulations very often produce the large angles that are to be avoided. Point generation techniques based on contour or front generation are judged to be the most promising in terms of being able to handle complicated multiple body objects, with this technique lending itself well to adaptivity. The eventual goal encompasses several phases: first, a partitioning phase, in which the Voronoi diagram of a set of points and line segments (the input set) will be generated to partition the input domain; second, a contour generation phase in which body-conforming contours are used to subdivide the partition further as well as introduce the foundation for aspect ratio control, and; third, a Steiner triangulation phase in which points are added to the partition to enable triangulation while controlling angle bounds and aspect ratio. This provides a combination of the advancing front/contour techniques and refinement. By using a front, aspect ratio can be better controlled. By using refinement, bounds on angles can be maintained, while attempting to minimize the number of Steiner points.

Posenau, Mary-Anne K.↗

Vision based object pose estimation for mobile robots

Mobile robot navigation using visual sensors requires that a robot be able to detect landmarks and obtain pose information from a camera image. This paper presents a vision system for finding man-made markers of known size and calculating the pose of these markers. The algorithm detects and identifies the markers using a weighted pattern matching template. Geometric constraints are then used to calculate the position of the markers relative to the robot. The selection of geometric constraints comes from the typical pose of most man-made signs, such as the sign standing vertical and the dimensions of known size. This system has been tested successfully on a wide range of real images. Marker detection is reliable, even in cluttered environments, and under certain marker orientations, estimation of the orientation has proven accurate to within 2 degrees, and distance estimation to within 0.3 meters.

Wu, Annie↗

Using XML and Java Technologies for Astronomical Instrument Control

Traditionally, instrument command and control systems have been highly specialized, consisting mostly of custom code that is difficult to develop, maintain, and extend. Such solutions are initially very costly and are inflexible to subsequent engineering change requests, increasing software maintenance costs. Instrument description is too tightly coupled with details of implementation. NASA Goddard Space Flight Center, under the Instrument Remote Control (IRC) project, is developing a general and highly extensible framework that applies to any kind of instrument that can be controlled by a computer. The software architecture combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML), a human readable and machine understandable way to describe structured data. A key aspect of the object-oriented architecture is that the software is driven by an instrument description, written using the Instrument Markup Language (IML), a dialect of XML. IML is used to describe the command sets and command formats of the instrument, communication mechanisms, format of the data coming from the instrument, and characteristics of the graphical user interface to control and monitor the instrument. The IRC framework allows the users to define a data analysis pipeline which converts data coming out of the instrument. The data can be used in visualizations in order for the user to assess the data in real-time, if necessary. The data analysis pipeline algorithms can be supplied by the user in a variety of forms or programming languages. Although the current integration effort is targeted for the High-resolution Airborne Wideband Camera (HAWC) and the Submillimeter and Far Infrared Experiment (SAFIRE), first-light instruments of the Stratospheric Observatory for Infrared Astronomy (SOFIA), the framework is designed to be generic and extensible so that it can be applied to any instrument. Plans are underway to test the framework with other types of instruments, such as remote sensing earth science instruments.

Ames, Troy↗

Optimizing River Flows for Salmon and Energy

This study identified trade-offs and complementarities between seasonal flow regimes that favor energy producers and those that benefit salmon production in the Tuolumne River, California below Don Pedro Dam. We produced and analyzed a non-dominated set of solutions using two models, one to estimate relative energy value and one to estimate relative salmon production from candidate flow regimes. The analysis suggested that both salmon and energy producers benefitted from pulse-flow releases during hot summer temperatures. However, the timing of an earlier pulse flow differed substantially between optimal flow regimes favoring the two objectives. Earlier flow releases that favored salmon production were allocated in late-winter over an extended period. This broad late-winter pulse inundated floodplain and promoted faster juvenile growth for early cohorts, whereas the later pulse flow mitigated exposure to high river temperatures by later cohorts of juvenile salmon. Optimal minimum flows were also higher in salmon-oriented solutions than in those that favored energy value. Flow releases allocated to maximize energy value occurred in both summer and winter, when cooling and heating increased electricity demand. Intermediate solutions generally allocated steeper and narrow pulses both in summer and during the late-winter, at times mirroring those used by salmon regimes. The steepness of pulse flows to maximize energy was driven primarily by hydraulic capacity (maximum generating flows). In summary, this analysis has improved understanding of the trade-offs and complementarities between seasonal patterns of reservoir releases that favor salmon and those that favor energy value to producers.

Chinook salmon↗

Automatic Synthesis of UML Designs from Requirements in an Iterative Process

The Unified Modeling Language (UML) is gaining wide popularity for the design of object-oriented systems. UML combines various object-oriented graphical design notations under one common framework. A major factor for the broad acceptance of UML is that it can be conveniently used in a highly iterative, Use Case (or scenario-based) process (although the process is not a part of UML). Here, the (pre-) requirements for the software are specified rather informally as Use Cases and a set of scenarios. A scenario can be seen as an individual trace of a software artifact. Besides first sketches of a class diagram to illustrate the static system breakdown, scenarios are a favorite way of communication with the customer, because scenarios describe concrete interactions between entities and are thus easy to understand. Scenarios with a high level of detail are often expressed as sequence diagrams. Later in the design and implementation stage (elaboration and implementation phases), a design of the system's behavior is often developed as a set of statecharts. From there (and the full-fledged class diagram), actual code development is started. Current commercial UML tools support this phase by providing code generators for class diagrams and statecharts. In practice, it can be observed that the transition from requirements to design to code is a highly iterative process. In this talk, a set of algorithms is presented which perform reasonable synthesis and transformations between different UML notations (sequence diagrams, Object Constraint Language (OCL) constraints, statecharts). More specifically, we will discuss the following transformations: Statechart synthesis, introduction of hierarchy, consistency of modifications, and "design-debugging".

Schumann, Johann↗

Neural Network Based Sensory Fusion for Landmark Detection

NASA is planning to send numerous unmanned planetary missions to explore the space. This requires autonomous robotic vehicles which can navigate in an unstructured, unknown, and uncertain environment. Landmark based navigation is a new area of research which differs from the traditional goal-oriented navigation, where a mobile robot starts from an initial point and reaches a destination in accordance with a pre-planned path. The landmark based navigation has the advantage of allowing the robot to find its way without communication with the mission control station and without exact knowledge of its coordinates. Current algorithms based on landmark navigation however pose several constraints. First, they require large memories to store the images. Second, the task of comparing the images using traditional methods is computationally intensive and consequently real-time implementation is difficult. The method proposed here consists of three stages, First stage utilizes a heuristic-based algorithm to identify significant objects. The second stage utilizes a neural network (NN) to efficiently classify images of the identified objects. The third stage combines distance information with the classification results of neural networks for efficient and intelligent navigation.

Kumbla, Kishan -K.↗

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗

Microcracking in composite laminates under thermal and mechanical loading

Composites used in space structures are exposed to both extremes in temperature and applied mechanical loads. Cracks in the matrix form, changing the laminate thermoelastic properties. The goal of the present investigation is to develop a predictive methodology to quantify microcracking in general composite laminates under both thermal and mechanical loading. This objective is successfully met through a combination of analytical modeling and experimental investigation. In the analysis, the stress and displacement distributions in the vicinity of a crack are determined using a shear lag model. These are incorporated into an energy based cracking criterion to determine the favorability of crack formation. A progressive damage algorithm allows the inclusion of material softening effects and temperature-dependent material properties. The analysis is implemented by a computer code which gives predicted crack density and degraded laminate properties as functions of any thermomechanical load history. Extensive experimentation provides verification of the analysis. AS4/3501-6 graphite/epoxy laminates are manufactured with three different layups to investigate ply thickness and orientation effects. Thermal specimens are cooled to progressively lower temperatures down to -184 C. After conditioning the specimens to each temperature, cracks are counted on their edges using optical microscopy and in their interiors by sanding to incremental depths. Tensile coupons are loaded monotonically to progressively higher loads until failure. Cracks are counted on the coupon edges after each loading. A data fit to all available results provides input parameters for the analysis and shows them to be material properties, independent of geometry and loading. Correlation between experiment and analysis is generally very good under both thermal and mechanical loading, showing the methodology to be a powerful, unified tool. Delayed crack initiation observed in a few cases is attributed to a lack of preexisting flaws assumed by the analysis. Some interactions between adjacent ply groups are attributed to local stress concentrations. These two effects are not captured by the analysis due to its global nature. The analysis is conservative in these cases and agrees well with data after the observed onset of cracking.

Maddocks, Jason R.↗

NEAMS Technical Area Support in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities outlined in this report include addition of Times and Positions systems, redesign of mechanical contact constraints to enable the augmented Lagrange algorithm, overhaul of the restart system, and incorporation of p-refinement in MOOSE.

97 MATHEMATICS AND COMPUTING↗

Development of a Single-Phase, Transient, Subchannel Code, within the MOOSE Multi-Physics Computational Framework

Subchannel codes have been widely used for thermal-hydraulics analyses in nuclear reactors. This paper details the development of a novel subchannel code within the Idaho National Laboratory’s (INL) Multi-physics Object Oriented Simulation Environment (MOOSE). MOOSE is a parallel computational framework targeted at the solution of systems of coupled, nonlinear partial differential equations, that often arise in the simulation of nuclear processes. As such, it includes codes/modules able to solve the multiple linear and nonlinear physics that describe a nuclear reactor, under normal operation conditions or accidents. This includes thermal-hydraulics, fuel performance, and neutronics codes, between others. A MOOSE-based subchannel code is a new addition to the fleet of INL-developed codes, based on the MOOSE framework. In this work, we present the derivation of the subchannel equations for a single-phase fluid, we proceed with the description of the algorithm that is used to solve these equations and describe how this algorithm was implemented within MOOSE. We also present how this code can be coupled to the BISON fuel performance code. Next, we verify the friction model and the turbulent mixing model. We calibrate the turbulent modeling parameters for momentum mixing and enthalpy mixing, C T , β. We validate the code using experimental results and last demonstrate the coupling capabilities using a simple example.

42 ENGINEERING↗

A Large-Grain Mapping Approach for Multiprocessor Systems Through Data Flow Model Ph.D. Thesis

A large-grain level mapping method is presented of numerical oriented applications onto multiprocessor systems. The method is based on the large-grain data flow representation of the input application and it assumes a general interconnection topology of the multiprocessor system. The large-grain data flow model was used because such representation best exhibits inherited parallelism in many important applications, e.g., CFD models based on partial differential equations can be presented in large-grain data flow format, very effectively. A generalized interconnection topology of the multiprocessor architecture is considered, including such architectural issues as interprocessor communication cost, with the aim to identify the 'best matching' between the application and the multiprocessor structure. The objective is to minimize the total execution time of the input algorithm running on the target system. The mapping strategy consists of the following: (1) large-grain data flow graph generation from the input application using compilation techniques; (2) data flow graph partitioning into basic computation blocks; and (3) physical mapping onto the target multiprocessor using a priority allocation scheme for the computation blocks.

Kim, Hwa-Soo↗

Recommended Methods for Setting Mission Conjunction Analysis Hard Body Radii

For real-time conjunction assessment (CA) operations, computation of the Probability of Collision (P(sub c)) typically depends on the state vector, its covariance, and the combined hard body radius (HBR) of both the primary and secondary space-craft. However, most algorithmic approaches that compute the P(sub c) use generic conservatively valued HBRs that may tend to go beyond the physical limitations of both spacecraft, enough to drastically change the results of a conjunction assessment mitigation decision. On the other hand, if the attitude of the spacecraft is known and available, then a refined HBR can be obtained that could result in an improved and accurate numerically-computed P(sub c) value. The goal of this analysis is to demonstrate the various calculated P(sub c) values obtained based on a number of different HBR calculation techniques, oriented in the encounter or conjunction plane at the time of closest approach (TCA). Since in most conjunctions the secondary object is a debris object and thus orders of magnitude smaller than the primary, the greatest operational benefit is wrought by developing a better size estimate and representation for the primary object. We present an analysis that includes the attitude information of the primary object in the HBR calculation and assesses the resulting P(sub c) values for conjunction assessment decision making.

Mashiku, Alinda K.↗

Recommended Methods for Setting Mission Conjunction Analysis Hard Body Radii

For real-time conjunction assessment (CA) operations, computation of the Probability of Collision (P(sub c)) typically depends on the state vector, its covariance, and the combined hard body radius (HBR) of both the primary and secondary space-craft. However, most algorithmic approaches that compute the P(sub c) use generic conservatively valued HBRs that may tend to go beyond the physical limitations of both spacecraft, enough to drastically change the results of a conjunction assessment mitigation decision. On the other hand, if the attitude of the spacecraft is known and available, then a refined HBR can be obtained that could result in an improved and accurate numerically-computed P(sub c) value. The goal of this analysis is to demonstrate the various calculated P(sub c) values obtained based on a number of different HBR calculation techniques, oriented in the encounter or conjunction plane at the time of closest approach (TCA). Since in most conjunctions the secondary object is a debris object and thus orders of magnitude smaller than the primary, the greatest operational benefit is wrought by developing a better size estimate and representation for the primary object. We present an analysis that includes the attitude information of the primary object in the HBR calculation and assesses the resulting P(sub c) values for conjunction assessment decision making.

Mashiku, Alinda K.↗

Automatic Calibration and Health Monitoring of Infrastructure Sensors

Smart transportation infrastructure relies on networks of heterogeneous sensors - cameras, radars, and lidars - continuously monitoring traffic conditions. However, executing the initial spatial calibration of multiple sensors and the subsequent health monitoring presents significant operational challenges. Environmental factors, mechanical vibrations, and gradual drift cause spatial misalignment, degrading fusion performance and tracking accuracy. Traditional calibration approaches require manual intervention with specialized targets or survey equipment, resulting in service interruptions and high maintenance costs. This work presents an automated framework for initial calibration and continuous health monitoring without human intervention or service disruption. Our approach addresses two critical problems: (1) detecting when sensors become miscalibrated during operation, and (2) automatically re-establishing spatial alignment using only operational traffic data. The health monitoring component analyzes measurement innovations - differences between sensor observations and predicted object states - to detect systematic biases indicative of calibration drift. By computing bias magnitude, directional consistency, and rejection rates, the system identifies miscalibrations as small as 0.5 meters. Unlike traditional methods requiring known calibration targets, our diagnostic operates continuously on live traffic observations, enabling early detection before fusion quality degrades. The automatic recalibration algorithm leverages overlapping sensor fields-of-view and temporal correlation of vehicle observations. Using graph-based optimization, the system automatically discovers which sensor pairs observe common regions, estimates pairwise spatial transformations using RANSAC-based robust estimation, and jointly optimizes all sensor poses through bundle adjustment. The framework handles practical deployment challenges, including different sensor sampling rates (1-10 Hz), varying installation positions, unknown orientations, and limited overlap regions (>10%). When approximate sensor positions are available from installation surveys (+/-1m accuracy), the algorithm additionally estimates sensor orientations, refining both position and rotation to sub-meter and sub-degree accuracy. We validate the framework on multi-hour traffic datasets from six heterogeneous sensors with sampling rates ranging from 1 Hz to 10 Hz. Results demonstrate successful calibration even with sparse overlap (<20%) and automatic detection of miscalibrations exceeding 0.8 meters. This work enables a "deploy-and-forget" sensor infrastructure that maintains calibration autonomously, reducing maintenance costs while improving tracking accuracy. The techniques generalize beyond transportation to any multi-sensor monitoring application requiring robust spatial alignment, including smart cities, industrial monitoring, and surveillance systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Rapid particle generation from an STL file and related issues in the application of material point methods to complex objects

Abstract In this paper, we focus on three issues related to applications of material point methods (MPMs) to objects with complex geometries. They are material point generation, compatibility of material points with a mesh, and sensitivity to mesh orientation. An efficient method of generating material points from a stereolithography (STL) file is introduced. This material point generation method is independent of the mesh used in MPM calculations. The compatibility between the material points and the mesh is then studied. We also show that the original MPM and the dual domain material point (DDMP) method are sensitive to mesh orientation. These issues are related to the calculation of the internal force and are concerns of the MPMs. They become more prominent when MPMs are applied to complex geometries. Our numerical results show that the recently developed local stress difference (LSD) algorithm (Perez et al. in J Comp Phys 498:112681, 2024) can be used to effectively address them.

36 MATERIALS SCIENCE↗

Robot tracking system improvements and visual calibration of orbiter position for radiator inspection

The following separate topics are addressed: (1) improving a robotic tracking system; and (2) providing insights into orbiter position calibration for radiator inspection. The objective of the tracking system project was to provide the capability to track moving targets more accurately by adjusting parameters in the control system and implementing a predictive algorithm. A computer model was developed to emulate the tracking system. Using this model as a test bed, a self-tuning algorithm was developed to tune the system gains. The model yielded important findings concerning factors that affect the gains. The self-tuning algorithms will provide the concepts to write a program to automatically tune the gains in the real system. The section concerning orbiter position calibration provides a comparison to previous work that had been performed for plant growth. It provided the conceptualized routines required to visually determine the orbiter position and orientation. Furthermore, it identified the types of information which are required to flow between the robot controller and the vision system.

Tonkay, Gregory↗

A new method for recognizing quadric surfaces from range data and its application to telerobotics and automation

The problem of recognizing and positioning of objects in three-dimensional space is important for robotics and navigation applications. In recent years, digital range data, also referred to as range images or depth maps, have been available for the analysis of three-dimensional objects owing to the development of several active range finding techniques. The distinct advantage of range images is the explicitness of the surface information available. Many industrial and navigational robotics tasks will be more easily accomplished if such explicit information can be efficiently interpreted. In this research, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be uniquely characterized by a set of these two-dimensional curves, thus allowing discrimination from the others. Before the recognition process can be implemented, the range data have to undergo a set of pre-processing operations, thereby making it more presentable to classification algorithms. One such pre-processing step is to study the effect of median filtering on raw range images. Utilizing a variety of surface curvature techniques, reliable sets of image data that approximate the shape of a quadric surface are determined. Since the initial orientation of the surfaces is unknown, a new technique is developed wherein all the rotation parameters are determined and subsequently eliminated. This approach enables us to position the quadric surfaces in a desired coordinate system. Experiments were conducted on raw range images of spheres, cylinders, and cones. Experiments were also performed on simulated data for surfaces such as hyperboloids of one and two sheets, elliptical and hyperbolic paraboloids, elliptical and hyperbolic cylinders, ellipsoids and the quadric cones. Both the real and simulated data yielded excellent results. Our approach is found to be more accurate and computationally inexpensive as compared to traditional approaches, such as the three-dimensional discriminant approach which involves evaluation of the rank of a matrix. Finally, we have proposed one other new approach, which involves the formulation of a mapping between the explicit and implicit forms of representing quadric surfaces. This approach, when fully realized, will yield a three-dimensional discriminant, which will recognize quadric surfaces based upon their component surfaces patches. This approach is faster than prior approaches and at the same time is invariant to pose and orientation of the surfaces in three-dimensional space.

Alvertos, Nicolas↗

CDM analysis

The C Data Manager (CDM) is an advanced tool for creating an object-oriented database and for processing queries related to objects stored in that database. The CDM source code was purchased and will be modified over the course of the Arachnid project. In this report, the modified CDM is referred to as MCDM. Using MCDM, a detailed series of experiments was designed and conducted on a Sun Sparcstation. The primary results and analysis of the CDM experiment are provided in this report. The experiments involved creating the Long-form Faint Source Catalog (LFSC) database and then analyzing it with respect to following: (1) the relationships between the volume of data and the time required to create a database; (2) the storage requirements of the database files; and (3) the properties of query algorithms. The effort focused on defining, implementing, and analyzing seven experimental scenarios: (1) find all sources by right ascension--RA; (2) find all sources by declination--DEC; (3) find all sources in the right ascension interval--RA1, RA2; (4) find all sources in the declination interval--DEC1, DEC2; (5) find all sources in the rectangle defined by--RA1, RA2, DEC1, DEC2; (6) find all sources that meet certain compound conditions; and (7) analyze a variety of query algorithms. Throughout this document, the numerical results obtained from these scenarios are reported; conclusions are presented at the end of the document.

Larson, Robert E.↗