Search NASA⌕ Search

SEARCH · Search NASA

Results for “Clutter”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Theoretical models for polarimetric radar clutter

The Mueller matrix and polarization covariance matrix are described for polarimetric radar systems. The clutter is modeled by a layer of random permittivity, described by a three-dimensional correlation function, with variance, and horizontal and vertical correlation lengths. This model is applied, using the wave theory with Born approximations carried to the second order, to find the backscattering elements of the polarimetric matrices. It is found that 8 out of 16 elements of the Mueller matrix are identically zero, corresponding to a covariance matrix with four zero elements. Theoretical predictions are matched with experimental data for vegetation fields.

Borgeaud, M.↗
NASA NTRS1988

Radar returns from ground clutter in vicinity of airports

The objective of this project is to develop a dynamic simulation of the received signals from natural and man-made ground features in the vicinity of airports. The simulation is run during landing and takeoff stages of a flight. Vugraphs of noteworthy features of the simulation, ground clutter data bases, the development of algorithms for terrain features, typical wave theory results, and a gravity wave height profile are given.

Raemer, H. R.↗
NASA NTRS1988

Polarimetric clutter modeling: Theory and application

The two-layer anisotropic random medium model is used to investigate fully polarimetric scattering properties of earth terrain media. The polarization covariance matrices for the untilted and tilted uniaxial random medium are evaluated using the strong fluctuation theory and distorted Born approximation. In order to account for the azimuthal randomness in the growth direction of leaves in tree and grass fields, an averaging scheme over the azimuthal direction is also applied. It is found that characteristics of terrain clutter can be identified through the analysis of each element of the covariance matrix. Theoretical results are illustrated by the comparison with experimental data provided by MIT Lincoln Laboratory for tree and grass fields.

Kong, J. A.↗
NASA NTRS2013

Mixture-Tuned, Clutter Matched Filter for Remote Detection of Subpixel Spectral Signals

Mapping localized spectral features in large images demands sensitive and robust detection algorithms. Two aspects of large images that can harm matched-filter detection performance are addressed simultaneously. First, multimodal backgrounds may thwart the typical Gaussian model. Second, outlier features can trigger false detections from large projections onto the target vector. Two state-of-the-art approaches are combined that independently address outlier false positives and multimodal backgrounds. The background clustering models multimodal backgrounds, and the mixture tuned matched filter (MT-MF) addresses outliers. Combining the two methods captures significant additional performance benefits. The resulting mixture tuned clutter matched filter (MT-CMF) shows effective performance on simulated and airborne datasets. The classical MNF transform was applied, followed by k-means clustering. Then, each cluster s mean, covariance, and the corresponding eigenvalues were estimated. This yields a cluster-specific matched filter estimate as well as a cluster- specific feasibility score to flag outlier false positives. The technology described is a proof of concept that may be employed in future target detection and mapping applications for remote imaging spectrometers. It is of most direct relevance to JPL proposals for airborne and orbital hyperspectral instruments. Applications include subpixel target detection in hyperspectral scenes for military surveillance. Earth science applications include mineralogical mapping, species discrimination for ecosystem health monitoring, and land use classification.

Thompson, David R.↗
NASA NTRS2015

Reinforcement Learning with Autonomous Small Unmanned Aerial Vehicles in Cluttered Environments

We present ongoing work in the Autonomy Incubator at NASA Langley Research Center (LaRC) exploring the efficacy of a data set aggregation approach to reinforcement learning for small unmanned aerial vehicle (sUAV) flight in dense and cluttered environments with reactive obstacle avoidance. The goal is to learn an autonomous flight model using training experiences from a human piloting a sUAV around static obstacles. The training approach uses video data from a forward-facing camera that records the human pilot's flight. Various computer vision based features are extracted from the video relating to edge and gradient information. The recorded human-controlled inputs are used to train an autonomous control model that correlates the extracted feature vector to a yaw command. As part of the reinforcement learning approach, the autonomous control model is iteratively updated with feedback from a human agent who corrects undesired model output. This data driven approach to autonomous obstacle avoidance is explored for simulated forest environments furthering autonomous flight under the tree canopy research. This enables flight in previously inaccessible environments which are of interest to NASA researchers in Earth and Atmospheric sciences.

Tran, Loc↗
NASA NTRS2017

Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments

This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments. In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE-SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE-SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agents and moving obstacles. Simulation results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.

Bandyopadhyay, Saptarshi↗
NASA NTRS2017

Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems

This paper presents a novel guidance algorithm for spacecraft swarms in an environment cluttered with many obstacles like a debris field or the asteroid belt. The objective of this algorithm is to reconfigure the swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. The agents first use a spherical-expansion-based sampling algorithm to cooperatively explore the workspace and find paths to the desired terminal positions. Using a distributed assignment algorithm, the agents converge on an optimal assignment of the target locations in the desired formation. Then each agent generates a locally optimal trajectory from its current location to its terminal position by solving a sequence of convex optimization problems. As the agent moves along this trajectory, it receives the position of other agents and updates its trajectory to avoid collisions with other agents and the obstacles. Thus the swarm achieves the desired formation in a distributed manner while avoiding collisions. Moreover, this algorithm is computationally efficient, therefore it can be implemented onboard resource-constrained spacecraft. Simulations results show that the proposed distributed algorithm can be used by a spacecraft swarm to reconfigure a desired formation around an asteroid in a collision-free manner.

Bandyopadhyay, Saptarshi↗
NASA NTRS2017

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗
NASA NTRS2017

Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments

This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments.1 In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE–SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE–SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agent and the moving obstacles. Simulations results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.

Hadaegh, Fred Y.↗
DOE OSTI2023

Real-Time Radiological Source Term Estimation for Multiple Sources in Cluttered Environments

A particle filter algorithm is presented to estimate the position, strength, and cardinality of an unknown number of radioactive point sources in an obstacle-rich environment using count measurements. The algorithm addresses gaps in the prior literature by incorporating two novel elements. The first is a precomputation step in which local terrain and obstacle data is processed to compute attenuation kernels throughout the search area. This enables rapid estimation performance in obstacle-rich environments as measurements are gathered. The second novel feature is a dynamic particle allocation technique in which the number of particles is adjusted in real time to meet convergence goals. This feature allows the algorithm to scale more efficiently to scenarios with a larger number of sources. A series of computational experiments using simulated data demonstrates the algorithm’s performance in a cluttered environment with up to eight sources.

Kemp, Samuel↗
DOE OSTI2022

Environmentally Adaptive, Multiband Software-Defined-Radar for Monitoring of Item of Interest in a Dynamically Cluttered Room

High-resolution multi-frequency radars when networked together, form a robust and seamless monitoring system for high-valued items. The multi-look-direction radar network investigated by LLNL and DSI, operates at 77 GHz and 5.8GHz, and is capable of detection at centimeter resolution movement of objects of interest. This dual frequency radar (unlike optical methods) can operate under various environments with conditions such a smoke, dust, and other natural or manmade obscurations. In addition, the multiband network radar is based on low-cost FCC approved EM specifications and can be scaled with the dimensions of the room and objects under consideration by user-defined inputs. Furthermore, the underlying radar signal processing based on software-defined radar engine is adaptive to its operational environment, where operators can input the size of the facility and object of interest and the distance between the object and radar. Finally, this multi-frequency radar employs a host of change detection and machine learning algorithms to reach performance levels in terms of high probability of detection and low false alarm rates while the monitoring state of the object can be reported remotely.

42 ENGINEERING↗
NASA NTRS1989

K-distribution and polarimetric terrain radar clutter

A multivariate K-distribution is proposed to model the statistics of fully polarimetric radar data from earth terrain with polarizations HH, HV, VH, and VV. In this approach, correlated polarizations of radar signals, as characterized by a covariance matrix, are treated as the sum of N n-dimensional random vectors; N obeys the negative binomial distribution with a parameter alpha and mean N-bar. Subsequently, an n-dimensional K-distribution, with either zero or nonzero mean, is developed in the limit of infinite N-bar or illuminated area. The probability density function (PDF) of the K-distributed vector normalized by its Euclidean norm is independent of the parameter alpha and is the same as that derived from a zero-mean Gaussian-distributed random vector.

Yueh, S. H.↗
NASA NTRS2005

Surface Clutter Removal in Airborne Radar Sounding Data from the Dry Valleys, Antarctica

We have collected roughly 1,000 line-km of airborne radar sounding data over glaciers, rock/ice glaciers, permafrost, subsurface ice bodies, ice-covered saline lakes, and glacial deposits in Taylor and Beacon Valley. These data are being analyzed in order to develop techniques for discriminating between subsurface and off-nadir echoes and for detecting and characterizing subsurface interfaces. The identification of features on Mars exhibiting morphologies consistent with ice/rock mixtures, near-surface ice bodies and near-surface liquid water, and the importance of such features to the search for water on Mars, highlights the need for appropriate terrestrial analogs and analysis techniques in order to prepare for radar sounder missions to Mars. Climatic, hydrological, and geological conditions in the Dry Valleys of Antarctica are analogous in many ways to those on Mars. A crucial first step in the data analysis process is the discrimination of echo sources in the radar data. The goal is to identify all returns from the surface of off-nadir topography in order to positively identify subsurface echoes. This process will also be critical for radar data that will be collected in areas of Mars exhibiting significant topography, so that subsurface echoes are identified unambiguously. The positive detection and characterization of subsurface (including sub-ice) water is a primary goal of NASA's Mars exploration program. Our data over the Dry Valleys provides an opportunity to implement techniques we are developing to accomplish these goals.

Holt, J. W.↗