Search NASA⌕ Search

SEARCH · Search NASA

Results for “path-planning”

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.

33 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Algorithm Plans Collision-Free Path for Robotic Manipulator

An algorithm has been developed to enable a computer aboard a robot to autonomously plan the path of the manipulator arm of the robot to avoid collisions between the arm and any obstacle, which could be another part of the robot or an external object in the vicinity of the robot. In simplified terms, the algorithm generates trial path segments and tests each segment for potential collisions in an iterative process that ends when a sequence of collision-free segments reaches from the starting point to the destination. The main advantage of this algorithm, relative to prior such algorithms, is computational efficiency: the algorithm is designed to make minimal demands upon the limited computational resources available aboard a robot. This path-planning algorithm utilizes a modified version of the collision-detection method described in "Improved Collision-Detection Method for Robotic Manipulator" (NPO-30356), NASA Tech Briefs, Vol. 27, No. 3 (June 2003), page 72. The method involves utilization of mathematical models of the robot constructed prior to operation and similar models of external objects constructed automatically from sensory data acquired during operation. This method incorporates a previously developed method, known in the art as the method of oriented bounding boxes (OBBs), in which an object is represented approximately, for computational purposes, by a box that encloses its outer boundary. Because many parts of a robotic manipulator are cylindrical, the OBB method has been extended in this method to enable the approximate representation of cylindrical parts by use of octagonal or other multiple-OBB assemblies denoted oriented bounding prisms (OBPs). A multiresolution OBB/OBP representation of the robot and its manipulator arm and a multiresolution OBB representation of external objects (including terrain) are constructed and used in a process in which collisions at successively finer resolutions are detected through computational detection of overlaps between the corresponding OBB and OBP models. For computational efficiency, the process is started at the coarsest resolution and stopped as soon as possible, preferably before reaching the finest resolution. At the coarsest resolution, there is a single OBB enclosing all relevant external objects and a single OBB enclosing the entire robot. At the next finer level of resolution, the coarsest-resolution OBB is divided into two OBBs, and so forth. If no collision is detected at the coarsest resolution, then there is no need for further computation to detect collisions. If a collision is detected at the coarsest resolution, then tests for collisions are performed at the next finer level of resolution. This process is continued to successively finer resolutions until either no more collisions are detected or the finest resolution is reached.

Backes, Paul↗
NASA NTRS2010

NASA Tech Briefs, May 2010

Topics covered include: Instrument for Analysis of Greenland's Glacier Mills Cryogenic Moisture Apparatus; A Transportable Gravity Gradiometer Based on Atom Interferometry; Three Methods of Detection of Hydrazines; Crossed, Small-Deflection Energy Analyzer for Wind/Temperature Spectrometer; Wavefront Correction for Large, Flexible Antenna Reflector; Novel Micro Strip-to-Waveguide Feed Employing a Double-Y Junction; Thin-Film Ferro Electric-Coupled Microstripline Phase Shifters With Reduced Device Hysteresis; Two-Stage, 90-GHz, Low-Noise Amplifier; A 311-GHz Fundamental Oscillator Using InP HBT Technology; FPGA Coprocessor Design for an Onboard Multi-Angle Spectro-Polarimetric Imager; Serrating Nozzle Surfaces for Complete Transfer of Droplets; Turbomolecular Pumps for Holding Gases in Open Containers; Triaxial Swirl Injector Element for Liquid-Fueled Engines; Integrated Budget Office Toolbox; PLOT3D Export Tool for Tecplot; Math Description Engine Software Development Kit; Astronaut Office Scheduling System Software; ISS Solar Array Management; Probabilistic Structural Analysis Program; SPOT Program; Integrated Hybrid System Architecture for Risk Analysis; System for Packaging Planetary Samples for Return to Earth; Offset Compound Gear Drive; Low-Dead-Volume Inlet for Vacuum Chamber; Simple Check Valves for Microfluidic Devices; A Capillary-Based Static Phase Separator for Highly Variable Wetting Conditions; Gimballing Spacecraft Thruster; Finned Carbon-Carbon Heat Pipe with Potassium Working Fluid; Lightweight Heat Pipes Made from Magnesium; Ceramic Rail-Race Ball Bearings; Improved OTEC System for a Submarine Robot; Reflector Surface Error Compensation in Dual-Reflector Antennas; Enriched Storable Oxidizers for Rocket Engines; Planar Submillimeter-Wave Mixer Technology with Integrated Antenna; Widely Tunable Mode-Hop-Free External-Cavity Quantum Cascade Laser; Non-Geiger-Mode Single-Photon Avalanche Detector with Low Excess Noise; Using Whispering-Gallery-Mode Resonators for Refractometry; RF Device for Acquiring Images of the Human Body; Reactive Collision Avoidance Algorithm; Fast Solution in Sparse LDA for Binary Classification; Modeling Common-Sense Decisions in Artificial Intelligence; Graph-Based Path-Planning for Titan Balloons; Nanolaminate Membranes as Cylindrical Telescope Reflectors; Air-Sea Spray Airborne Radar Profiler Characterizes Energy Fluxes in Hurricanes; Large Telescope Segmented Primary Mirror Alignment; and Simplified Night Sky Display System.

Source record↗
NASA NTRS2006

Integrating Terrain Maps Into a Reactive Navigation Strategy

An improved method of processing information for autonomous navigation of a robotic vehicle across rough terrain involves the integration of terrain maps into a reactive navigation strategy. Somewhat more precisely, the method involves the incorporation, into navigation logic, of data equivalent to regional traversability maps. The terrain characteristic is mapped using a fuzzy-logic representation of the difficulty of traversing the terrain. The method is robust in that it integrates a global path-planning strategy with sensor-based regional and local navigation strategies to ensure a high probability of success in reaching a destination and avoiding obstacles along the way. The sensor-based strategies use cameras aboard the vehicle to observe the regional terrain, defined as the area of the terrain that covers the immediate vicinity near the vehicle to a specified distance a few meters away.

Howard, Ayanna↗
NASA NTRS2005

Single-Command Approach and Instrument Placement by a Robot on a Target

AUTOAPPROACH is a computer program that enables a mobile robot to approach a target autonomously, starting from a distance of as much as 10 m, in response to a single command. AUTOAPPROACH is used in conjunction with (1) software that analyzes images acquired by stereoscopic cameras aboard the robot and (2) navigation and path-planning software that utilizes odometer readings along with the output of the image-analysis software. Intended originally for application to an instrumented, wheeled robot (rover) in scientific exploration of Mars, AUTOAPPROACH could be adapted to terrestrial applications, notably including the robotic removal of land mines and other unexploded ordnance. A human operator generates the approach command by selecting the target in images acquired by the robot cameras. The approach path consists of multiple legs. Feature points are derived from images that contain the target and are thereafter tracked to correct odometric errors and iteratively refine estimates of the position and orientation of the robot relative to the target on successive legs. The approach is terminated when the robot attains the position and orientation required for placing a scientific instrument at the target. The workspace of the robot arm is then autonomously checked for self/terrain collisions prior to the deployment of the scientific instrument onto the target.

Huntsberger, Terrance↗
NASA NTRS2005

Grid Visualization Tool

The Grid Visualization Tool (GVT) is a computer program for displaying the path of a mobile robotic explorer (rover) on a terrain map. The GVT reads a map-data file in either portable graymap (PGM) or portable pixmap (PPM) format, representing a gray-scale or color map image, respectively. The GVT also accepts input from path-planning and activity-planning software. From these inputs, the GVT generates a map overlaid with one or more rover path(s), waypoints, locations of targets to be explored, and/or target-status information (indicating success or failure in exploring each target). The display can also indicate different types of paths or path segments, such as the path actually traveled versus a planned path or the path traveled to the present position versus planned future movement along a path. The program provides for updating of the display in real time to facilitate visualization of progress. The size of the display and the map scale can be changed as desired by the user. The GVT was written in the C++ language using the Open Graphics Library (OpenGL) software. It has been compiled for both Sun Solaris and Linux operating systems.

Chouinard, Caroline↗
NASA NTRS2011

Probabilistic Path Planning of Montgolfier Balloons in Strong, Uncertain Wind Fields

Lighter-than-air vehicles such as hot-air balloons have been proposed for exploring Saturn s moon Titan, as well as other bodies with significant atmospheres. For these vehicles to navigate effectively, it is critical to incorporate the effects of surrounding wind fields, especially as these winds will likely be strong relative to the control authority of the vehicle. Predictive models of these wind fields are available, and previous research has considered problems of planning paths subject to these predicted forces. However, such previous work has considered the wind fields as known a priori, whereas in practical applications, the actual wind vector field is not known exactly and may deviate significantly from the wind velocities estimated by the model. A probabilistic 3D path-planning algorithm was developed for balloons to use uncertain wind models to generate time-efficient paths. The nominal goal of the algorithm is to determine what altitude and what horizontal actuation, if any is available on the vehicle, to use to reach a particular goal location in the least expected time, utilizing advantageous winds. The solution also enables one to quickly evaluate the expected time-to-goal from any other location and to avoid regions of large uncertainty. This method is designed for balloons in wind fields but may be generalized for any buoyant vehicle operating in a vector field. To prepare the planning problem, the uncertainty in the wind field is modeled. Then, the problem of reaching a particular goal location is formulated as a Markov decision process (MDP) using a discretized space approach. Solving the MDP provides a policy of what actuation option (how much buoyancy change and, if applicable, horizontal actuation) should be selected at any given location to minimize the expected time-to-goal. The results provide expected time-to-goal values from any given location on the globe in addition to the action policy. This stochastic approach can also provide insights not accessible by deterministic methods; for example, one can evaluate variability and risk associated with different scenarios, rather than only viewing the expected outcome.

Wolf, Michael↗
NASA NTRS2012

Predictive Sea State Estimation for Automated Ride Control and Handling - PSSEARCH

PSSEARCH provides predictive sea state estimation, coupled with closed-loop feedback control for automated ride control. It enables a manned or unmanned watercraft to determine the 3D map and sea state conditions in its vicinity in real time. Adaptive path-planning/ replanning software and a control surface management system will then use this information to choose the best settings and heading relative to the seas for the watercraft. PSSEARCH looks ahead and anticipates potential impact of waves on the boat and is used in a tight control loop to adjust trim tabs, course, and throttle settings. The software uses sensory inputs including IMU (Inertial Measurement Unit), stereo, radar, etc. to determine the sea state and wave conditions (wave height, frequency, wave direction) in the vicinity of a rapidly moving boat. This information can then be used to plot a safe path through the oncoming waves. The main issues in determining a safe path for sea surface navigation are: (1) deriving a 3D map of the surrounding environment, (2) extracting hazards and sea state surface state from the imaging sensors/map, and (3) planning a path and control surface settings that avoid the hazards, accomplish the mission navigation goals, and mitigate crew injuries from excessive heave, pitch, and roll accelerations while taking into account the dynamics of the sea surface state. The first part is solved using a wide baseline stereo system, where 3D structure is determined from two calibrated pairs of visual imagers. Once the 3D map is derived, anything above the sea surface is classified as a potential hazard and a surface analysis gives a static snapshot of the waves. Dynamics of the wave features are obtained from a frequency analysis of motion vectors derived from the orientation of the waves during a sequence of inputs. Fusion of the dynamic wave patterns with the 3D maps and the IMU outputs is used for efficient safe path planning.

Huntsberger, Terrance L.↗
NASA NTRS2018

Silhouette-Informed Trajectory Generation Through a Wire Maze for Small UAS

Current rapidly-exploring random tree (RRT) algorithms rely on proximity query packages that often include collision checkers, tolerance verification, and distance computation algorithms for the generation of safe paths. In this paper, we broaden the information available to the path-planning algorithm by incorporating silhouette information of nearby obstacles in conflict. A silhouette-informed tree (SIT) is generated through the flight-safe region of a wire maze for a single unmanned aerial system (UAS). The silhouette is used to extract local geometric information of nearby obstacles and provide path alternatives around these obstacles. Thus, focusing the search for the generation of new tree branches near these obstacles, and decreasing the number of samples required to explore the narrow corridors within the wire maze. The SIT is then processed to extract a path that connects the initial location of the UAS with the goal, reduce the number of line segments in this path if possible, and smooth the resulting path using Pythagorean Hodograph Bezier curves. To ensure that the smoothed path remains in the flight-safe region of the configuration space, a tolerance verification algorithm for Bezier curves and convex polytopes in three dimensions is proposed. Lastly, temporal specifications are imposed on the smoothed path in the shape of an arbitrary speed profile.

Puig-Navarro, Javier↗
NASA NTRSDate not supplied

Automated Multi-Robot Assembly of Compliance Optimized Structures

Autonomous assembly of large structures is one of the fundamental challenges on the way towards NASA’s objectives of deep space exploration. In this work, we propose an algorithmic framework to optimize the assembly process of a prescribed target structure by constraining the assembly effort as well as maintaining structural soundness throughout the process. This framework uses structural topology optimization with assembly effort metrics to generate checkpoints for robotic traversal algorithms. Assembly effort is quantified by the Wasserstein metric between consecutive structural configurations during the assembly process. The robotic assembly task is split into two subtasks, where we first optimize for a set of key frames, then perform reconfiguration between consecutive frames. Key frames are optimized by adopting topology optimization techniques to reduce assembly effort and maintain structural integrity during the assembly process, while reconfiguration between key frames is performed using a path planning algorithm with a minimum weight maximum matching approach on a bipartite graph. We employ a Crystalline robot model in which each structural element is capable of locomotion through the structure and locking into place with neighboring elements after reaching its destination. An example assembly of a two-dimensional cantilever beam under volume constraints and structural compliance considerations is presented to demonstrate the approach. Finally, we conclude by discussing possible future extensions to this work, including adoption of better metrics, extension to three-dimensional large-scale problems, and exacting finer control of structural integrity during the path-planning phase.

robotic assembly↗
NASA NTRSDate not supplied

Energy-Optimized Path Planning for Uas in Varying Winds Via Reinforcement Learning

In this paper we propose a reinforcement learning (RL) algorithm for path planning of Unmanned Aviation Vehicles (UAVs) under varying wind conditions. Solutions to UAV path planning problems are becoming increasingly necessary as autonomous UAVs continue to enter commercial and government spaces. Path-planning is inherently challenging, as UAVs need to account for dynamically changing flying conditions such as weather, obstacle or no-fly zones, degraded vehicle health, and off-nominal battery power consumption. Machine learning methods such as reinforcement learning (RL) have the potential to revolutionize how vehicles navigate in such uncertain environments. In this study, we compute UAV trajectories from a pre-determined starting position to a target cell within a 7X7 grid environment by optimizing parameters for mission assurance and safety limits in addition to the energy consumption and operation time. The UAV navigates the grid by taking actions to move in any of the eight cardinal and inter-cardinal directions, under constant thrust profile. The resultant UAV state is sampled from a probability distribution which accounts for the UAV’s action, local wind velocity, and the presence of obstacles or boundaries. As the unmanned airspace gets more complex due to multiple vehicles and environmental uncertainties, trade-offs between energy consumption, operation time, risk tolerance, and mission assurance need to be made. Our Markov Decision Process (MDP) environment model can capture any combination of these in the optimization objective, making it novel compared to other work in the field.

trajectory planning↗
DOE OSTI2019

Informative Path Planning for Mapping Radiation

This project involves making measurements of contaminated areas using portable radiation detectors and small robots. Tasks involve operating detectors and small robots, combining data acquisition for the two systems, and automating the systems. The end result is a radiation map of contamination areas. Localization of radioactive sources and mapping of contamination distribution is essential when responding to emergencies, or when dealing with cleanup efforts. Radiation maps are used for situational awareness and for establishing a safe perimeter. However, it may be hazardous or impossible for humans to safely enter the site and survey the area. Informative Path Planning (IPP) is used to design a path for a robotic sensor platform to gather the most information about the radiation distribution while operating under the set of constraints given by the dynamics of the robot and other requirements such as minimizing the overall mission time. The key challenge for IPP is the tight coupling in multiple layers of decisions: Selection of locations to visit; Allocation of sensors to those locations; Processing of information gathered. Given a robot equipped with a basic gamma detector and Lidar sensor, how can we efficiently explore an unknown environment in such a way that we can satisfy the robot's constraints while simultaneously maximizing the accuracy of the map and minimizing the total runtime? This work presents a systematic procedure for IPP and environmental mapping that: Selects the best locations at which to sample; Finds the best path for robots; Estimates the measurement value at unknown locations using a Gaussian Process regression framework. Given a set of points where radiation measurements were taken, we are utilizing a Gaussian Process Regression with a Matern kernel to reconstruct the shape of the underlying ground truth. Mapping is done via the Robot Operating System's OpenSlam Gmapping package, which creates a 2D occupancy grid map. Simulated trials were run with a radiation source placed at random locations, and allowing the robot to select and move towards 20 samples at separate locations, as well as sampling along the path while moving. The simulated sensor model assumed an efficiency of 0.3, collection time of 1 second. Various weighting schemes were tested and compared. Quantitative evaluations often favored exploitation-heavy weighting schemes where μ was emphasized, with the Root Mean Squared Error (RMSE) quickly tending towards 2, whereas qualitative comparisons would favor exploration-biased schemes with greater weight on σ. The difference comes from operators often favoring knowing the general location of a source, rather than the exact properties of a source. Weighting of the path-length π often reduced the quality of the regression as less exploration occurred, however this may be deemed a worthwhile trade-off under certain circumstances, such as with sensitive robots. Successfully developed a methodology for informative path-planning for a robot to efficiently gather information and create a map of radiation. In the future, we would like to focus on: Hardware trials with integration of the robot platform and the IPP software; More refined sensor and environmental modeling; Multiple robot platforms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

6. Closed-Loop Toolpath Generation

Closed-loop paths, also known as closed-loop contours, are paths that start and stop at the same point and are typically used to define the perimeter or outermost boundary of the polygon that represents a given layer of an object, referred to as the “layer polygon.” Finding the location of a closed-loop path involves applying two offsetting steps to the edge of the layer polygon. The offsetting steps respectively serve to (1) find the area that contains the toolpath and (2) find the centerline of that area, to define the path itself. After finding the perimeter path, the remaining geometry from the layer polygon can be used for additional path-planning steps. This chapter will discuss how the location for a closed-loop path is found, including various problem scenarios, and the different types of closed-loop paths used in additive manufacturing.

Roschli, Alex↗
NASA NTRS2001

Optimal collision avoidance guidance for formation-flying applications

Several proposed space science missions require deployment of a number of spacecraft to form a single functional unit or a formation flying spacecraft. There are many applications of a formation flying spacecraft; variable baseline optical space interferometry is one of them.

collision avoidance path-planning formation-flying↗
NASA NTRSDate not supplied

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗