Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “proximal 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Laser-Based Relative Navigation and Guidance for Space Shuttle Proximity Operations

American manned spacecraft have used visual piloting techniques in the terminal phase of randezvous during the Gemini, Apollo, Skylab, and Space Shuttle programs. In the last several years, space- shuttle astronauts have used the Rendezvous and Proximity Operations Program (RPOP), running; on a laptop computer, as a guidance and navigation aid during proximity operations. By processing measurements to the target satellite taken by a laser sensor, RPOP provides the shuttle crew with a more accurate relative position and velocity than from any other source. The inclusion of guidance algorithms allows RPOP to determine delta-velocities to fly very efficient, repeatable trajectories. This paper will focus on the guidance and navigation algorithms in RPOP, as well as results from simulation and flight. Although developed for shuttle proximity operations, the RPOP algorithms have potential applicability to an automated vehicle.

Laser sensors↗
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Automatic Generation of CFD-Ready Surface Triangulations from CAD Geometry

This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique which was developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space, The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first, As a result of this strategy, the algorithm will return its 'best' mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are 'CFD-ready' in that: (1) Edges match the underlying part model to within a specified tolerance. (2) Triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, alpha, or greater than Pi - 2alpha This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to tile output triangulations for a variety of CAD parts, tile discussion presents related theoretical results which assert the existence of such all angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗
DOE OSTI2020

Boosting the Performance of Plug-and-Play Priors via Denoiser Scaling

Plug-and-play priors (PnP) is an image reconstruction framework that utilizes an image denoiser as an imaging prior. Unlike traditional regularized inversion, PnP does not require the prior to be expressible in the form of a regularization function. This flexibility enables PnP algorithms to exploit the most effective image denoisers, leading to their state-of-the-art performance in various imaging tasks. However, many powerful denoisers, such as the ones based on convolutional neural networks (CNNs), do not have tunable parameters that would allow controlling their influence within PnP. To address this issue, in this paper, we introduce a scaling parameter that adjusts the magnitude of the denoiser input and output. We theoretical justify the denoiser scaling from the perspectives of proximal optimization, statistical estimation, and consensus equilibrium. Finally, we provide numerical experiments demonstrating the ability of denoiser scaling to systematically improve the performance of PnP for denoising CNN priors that do not have explicitly tunable parameters.

Boosting↗
DOE OSTI2022

Online State Estimation for Time-Varying Systems

The paper investigates the problem of estimating the state of a time-varying system with a linear measurement model; in particular, the paper considers the case where the number of measurements available can be smaller than the number of states. In lieu of a batch linear least-squares (LS) approach well-suited for static networks, where a sufficient number of measurements could be collected to obtain a full-rank design matrix the paper proposes an online algorithm to estimate the possibly time-varying state by processing measurements as and when available. The design of the algorithm hinges on a generalized LS cost augmented with a proximal-point-type regularization. With the solution of the regularized LS problem available in closed-form, the online algorithm is written as a linear dynamical system where the state is updated based on the previous estimate and based on the new available measurements. Conditions under which the algorithmic steps are in fact a contractive mapping are shown, and bounds on the estimation error are derived for different noise models. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2022

Chapter 10 - Remote Sensing Measurements of Aerosol Properties

Satellite instruments have proven especially capable at monitoring the quantity of airborne particles in columns of atmosphere, globally. This chapter describes the principles of satellite measurements and retrieval algorithms, and surveys current instruments and their capabilities. We outline the issues associated with retrieval algorithms, such as surface characterization and aerosol proximity to clouds, and the challenges with interpretation of the results. The relationship between measured aerosol properties and climate-relevant aerosol properties simulated in models is outlined, as well as how measurements are used to evaluate models. Most space-based aerosol instruments are passive sensors that measure reflected sunlight at multiple wavelengths, some at multiple viewing angles. A few are active sensors that send out their own laser light and measure the returned signal. Except when clouds are present, the excess amount of light scattered back to space, beyond that expected from the surface and atmospheric gas, is attributed to aerosol. Satellite measurements are used in many ways in aerosol research. They often provide the only method for monitoring hazardous phenomena such as major wildfire and volcanic eruption plumes, especially in remote areas. Stable, long-term, near-global-scale satellite data records make it possible to identify regional and global aerosol trends. Aerosol radiative effects on climate can be quantified on a near-global scale and used to estimate the strength of aerosol–radiation and aerosol–cloud interactions as well as to evaluate climate model simulations of these interactions. Aerosol-type mapping from satellite imagery is helpful for source attribution, model validation, and to constrain particle light-absorption properties that are essential for radiative forcing calculations. The range of aerosol properties retrieved from satellite observations has grown considerably since the first global estimates of aerosol optical depth (τ a) over ocean were made in the late 1970s. Methods for retrieving particle size and light-absorption properties were explored in the 1990s using multispectral, multi-angle observations, and polarization in visible and near-infrared wavelengths. Sensitivity to particle light absorption, primarily from black or brown carbon content, improved with the inclusion of UV channels, and sensitivity to very thin aerosol layers in the upper troposphere and lower stratosphere was advanced with the use of limb-sounding instruments and active sensors. There are limitations to every measurement technique, including satellite aerosol remote sensing. For wide-swath, passive instruments, aerosol retrievals near clouds can present substantial challenges as far as 15 km away due to cloud-scattered light contaminating the signal. In nearly all cases, retrievals over bright snow and ice surfaces are precluded because surface reflectance uncertainties can overwhelm the aerosol signal. Similarly, meteorological cloud is identified and masked out where possible. Data from passive sensors also lack vertical resolution except those that view toward the limb or where multi-angle imagery is acquired over plumes from wildfires, erupting volcanoes, and wind-blown dust. Yet, passive sensors provide vastly more coverage than the active instruments that mitigate these issues. Particle microphysical information is qualitative from all remote sensing techniques, relying on proxies to infer particle composition, hygroscopicity, and the amount of light-absorbing material. Further, particles smaller than about 200 nm diameter cannot be distinguished from atmospheric gas molecules with remote sensing, which hinders studies of cloud condensation nuclei and their effects on clouds. Most satellite instruments dedicated to aerosol observations are in low-Earth, near-polar, sun-synchronous orbits, which means they cross the equator at the same local time each day. Most are set on cycles that repeat approximately every 16 days, which makes it difficult to monitor aerosol evolution locally. Geostationary satellites make it possible to observe changes occurring from minutes to hours over regions up to 8000 km in size, but lack coverage of high latitudes, and often provide more limited constraints on aerosol properties. Ground-truth data are vital for satellite aerosol-retrieval validation. The AErosol RObotic NETwork (AERONET) of sun photometers was created in 1993 and has become an established global network of over 350 instruments for validating satellite measurements. The network, as well as global networks of ground-based lidars, solar flux radiometers and other sun photometers, are widely used for evaluating global satellite retrievals and model simulations. NASA's Earth Observing System (EOS) program beginning in 1999 led to improvements in reliability, spatial resolution, and spectral resolution (and hence, to improved particle size discrimination and light absorption properties). Satellite payloads include advanced broad-swath and multi-angle imagers, along with the first space-based active sensor focused largely on long-term aerosol monitoring. Since about 2002, Europe's SENTINEL and operational meteorological satellite fleets are also providing sustained aerosol observations, with planned continuation until at least 2030. Satellite remote sensing instruments offer valuable data for evaluating aerosol representations in global climate models. They have been used to assess aerosol optical and physical properties, trends and distributions, and are applied increasingly as direct model constraints in data assimilation to create global aerosol reanalysis products. Aerosol optical depth is the most common quantity adopted for routine model evaluation, including multiwavelength data to loosely constrain particle-size distributions. These evaluations of multiple models have revealed general biases in their regional aerosol amounts and seasonal patterns of transport and removal. Although satellite measurements have near-global coverage, substantial errors can be introduced into the model observation comparison unless attention is paid to spatial and temporal collocation, cloud screening, subgrid-scale variability, and measurement uncertainties that vary with retrieval conditions.

aerosol properties↗
NASA NTRS1994

Database tomography for commercial application

Database tomography is a method for extracting themes and their relationships from text. The algorithms, employed begin with word frequency and word proximity analysis and build upon these results. When the word 'database' is used, think of medical or police records, patents, journals, or papers, etc. (any text information that can be computer stored). Database tomography features a full text, user interactive technique enabling the user to identify areas of interest, establish relationships, and map trends for a deeper understanding of an area of interest. Database tomography concepts and applications have been reported in journals and presented at conferences. One important feature of the database tomography algorithm is that it can be used on a database of any size, and will facilitate the users ability to understand the volume of content therein. While employing the process to identify research opportunities it became obvious that this promising technology has potential applications for business, science, engineering, law, and academe. Examples include evaluating marketing trends, strategies, relationships and associations. Also, the database tomography process would be a powerful component in the area of competitive intelligence, national security intelligence and patent analysis. User interests and involvement cannot be overemphasized.

Kostoff, Ronald N.↗
NASA NTRS2021

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth- Moon system. Using Multi-Reward Proximal Policy Optimiza- tion, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Mashiku, Alinda K.↗
NASA NTRSDate not supplied

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth-Moon system. Using Multi-Reward Proximal Policy Optimization, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Christopher J Sullivan↗
DOE OSTI2021

Toward active disruption avoidance via real-time estimation of the safe operating region and disruption proximity in tokamaks

This paper describes a real-time capable algorithm for identifying the safe operating region around a tokamak operating point. The region is defined by a convex set of linear constraints, from which the distance of a point from a disruptive boundary can be calculated. The disruptivity of points is calculated from an empirical machine learning predictor that generates the likelihood of disruption. While the likelihood generated by such empirical models can be compared to a threshold to trigger a disruption mitigation system, the safe operating region calculation enables active optimization of the operating point to maintain a safe margin from disruptive boundaries. The proposed algorithm is tested using a random forest disruption predictor fit on data from DIII-D. The safe operating region identification algorithm is applied to historical data from DIII-D showing the evolution of disruptive boundaries and the potential impact of optimization of the operating point. Real-time relevant execution times are made possible by parallelizing many of the calculation steps and implementing the algorithm on a graphics processing unit. Lastly, a real-time capable algorithm for optimizing the target operating point within the identified constraints is also proposed and simulated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2005

Safety Ellipse Motion with Coarse Sun Angle Optimization

The Hubble Space Telescope Robotic Servicing and De-orbit Mission (HRSDM) was t o be performed by the unmanned Hubble Robotic Vehicle (HRV) consisting of a Deorbit Module (DM), responsible for the ultimate disposal of Hubble Space Telescope (HST) at the end of science operations, and an Ejection Module (EM), responsible for robotically servicing the HST to extend its useful operational lifetime. HRSDM consisted of eight distinct phases, including: launch, pursuit, proximity operations, capture, servicing, EM jettison and disposal, science operations, and deorbit. The scope of this paper is limited to the Proximity Operations phase of HRSDM. It introduces a relative motion strategy useful for Autonomous Rendezvous and Docking (AR&D) or Formation Flying missions where safe circumnavigation trajectories, or close proximity operations (tens or hundreds of meters) are required for extended periods of time. Parameters and algorithms used to model the relative motion of HRV with respect to HST during the Proximity Operations phase of the HRSDM are described. Specifically, the Safety Ellipse (SE) concept, convenient parameters for describing SE motion, and a concept for initializing SE motion around a target vehicle to coarsely optimize sun and relative navigation sensor angles are presented. The effects of solar incidence angle variations on sun angle optimization, and the effects of orbital perturbations and navigation uncertainty on long term SE motion are discussed.

Naasz, Bo↗
NASA NTRS1989

Reflexive obstacle avoidance for kinematically-redundant manipulators

Dexterous telerobots incorporating 17 or more degrees of freedom operating under coordinated, sensor-driven computer control will play important roles in future space operations. They will also be used on Earth in assignments like fire fighting, construction and battlefield support. A real time, reflexive obstacle avoidance system, seen as a functional requirement for such massively redundant manipulators, was developed using arm-mounted proximity sensors to control manipulator pose. The project involved a review and analysis of alternative proximity sensor technologies for space applications, the development of a general-purpose algorithm for synthesizing sensor inputs, and the implementation of a prototypical system for demonstration and testing. A 7 degree of freedom Robotics Research K-2107HR manipulator was outfitted with ultrasonic proximity sensors as a testbed, and Robotics Research's standard redundant motion control algorithm was modified such that an object detected by sensor arrays located at the elbow effectively applies a force to the manipulator elbow, normal to the axis. The arm is repelled by objects detected by the sensors, causing the robot to steer around objects in the workspace automatically while continuing to move its tool along the commanded path without interruption. The mathematical approach formulated for synthesizing sensor inputs can be employed for redundant robots of any kinematic configuration.

Karlen, James P.↗
NASA NTRS2005

Constrained spectral clustering under a local proximity structure assumption

This work focuses on incorporating pairwise constraints into a spectral clustering algorithm. A new constrained spectral clustering method is proposed, as well as an active constraint acquisition technique and a heuristic for parameter selection. We demonstrate that our constrained spectral clustering method, CSC, works well when the data exhibits what we term local proximity structure.

domain knowledge↗
DOE OSTI2022

Data on Cu- and Ni-Si-Mn-rich solute clustering in a neutron irradiated austenitic stainless steel

The data presented in this article is supplementary to the research article “Phase instabilities in austenitic steels during particle bombardment at high and low dose rates” (Levine et al.). Needle-shaped samples were prepared with focused ion beam milling from a 304L stainless steel that was irradiated with fast neutrons (E 0.1 MeV) in the BOR-60 reactor at 318 °C to 47.5 dpa. Atom probe tomography (APT) experiments in voltage mode were then conducted on a Cameca LEAP 5000X HR. Atom position, range, and mass spectrum files after reconstruction with Cameca’s IVAS software are included. Cu- and Ni-Si-Mn-rich solute nanoclusters were identified and analyzed using the Open Source Characterization of APT Reconstructions (OSCAR) program. Python code for OSCAR, information on the program’s underlying algorithm, and sample output files are provided. A proximity histogram of a Ni-Si-Mn-rich cluster and a 1D density/solute concentration profile of a Cu-rich cluster are given to demonstrate OSCAR’s analytical functionalities. The provided APT dataset is valuable for benchmarking phase instabilities in neutron-irradiated austenitic stainless steels that occur at high doses. The OSCAR program can be reused to process other APT data sets where solute nanoclustering is of interest.

42 ENGINEERING↗
DOE OSTI2023

Reinforcement Learning Approach to Cybersecurity in Space (RELACSS)

Securing satellite groundstations against cyber-attacks is vital to national security missions. However, these cyber threats are constantly evolving. As vulnerabilities are discovered and patched, new vulnerabilities are discovered and exploited. In order to automate the process of discovering existing vulnerabilities and the means to exploit them, a reinforcement learning framework is presented in this report. We demonstrate that this framework can learn to successfully navigate an unknown network and detect nodes of interest despite the presence of a moving target defense. The agent then exfiltrates a file of interest from the node as quickly as possible. This framework also incorporates a defensive software agent that learns to impede the attacking agents progress. This setup allows for the agents to work against each other and improve their abilities. We anticipate that this capability will help uncover unforeseen vulnerabilities and the means to mitigate them. The modular nature of the framework enables users to swap out learning algorithms and modify the reward functions in order to adapt the learning tasks to various use cases and environments. Several algorithms, viz., tabular Q learning, deep Q networks, proximal policy optimization, advantage actor-critic, generative adversarial imitation learning, are explored for the agents and the results highlighted. The agent learns to solve the tasks in a light-weight abstract environment. Once the agent learns to perform sufficiently well, it can be deployed in a minimega virtual machine environment (or a real network) with wrappers that map abstract actions to software commands. The agent also uses a local representation of the actions called a ‘slot-mechanism’. This allows the agent to learn in a certain network and generalize it to different networks. The defensive agent learns to predict the actions taken by an offensive agent and uses that information to anticipate the threat. This information can then either be used to raise an alarm or to take actions to thwart the attack. We believe that with the appropriate reward design, a representative environment, and action set, this framework can be generalized to tackle other cybersecurity tasks. By sufficiently training these agents, we can anticipate vulnerabilities leading to robust future designs. We can also deploy automated defensive agents that can help secure satellite groundstation and their vital national security missions.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
NASA NTRS2013

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↗
NASA NTRS1995

Fuzzy logic techniques for rendezvous and docking of two geostationary satellites

Large assemblings in space require the ability to manage rendezvous and docking operations. In future these techniques will be required for the gradual build up of big telecommunication platforms in the geostationary orbit. The paper discusses the use of fuzzy logic to model and implement a control system for the docking/berthing of two satellites in geostationary orbit. The system mounted in a chaser vehicle determines the actual state of both satellites and generates torques to execute maneuvers to establish the structural latching. The paper describes the proximity operations to collocate the two satellites in the same orbital window, the fuzzy guidance and navigation of the chaser approaching the target and the final Fuzzy berthing. The fuzzy logic system represents a knowledge based controller that realizes the close loop operations autonomously replacing the conventional control algorithms. The goal is to produce smooth control actions in the proximity of the target and during the docking to avoid disturbance torques in the final assembly orbit. The knowledge of the fuzzy controller consists of a data base of rules and the definitions of the fuzzy sets. The knowledge of an experienced spacecraft controller is captured into a set of rules forming the Rules Data Base.

Ortega, Guillermo↗