Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 145 records · Page 8

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Birge, Brian↗

Maximizing the Performance of a 3D Printed Heat Sink by Accounting for Anisotropic Thermal Conductivity During Filament Deposition

Newly developed high thermal conductivity polymer composite 3D printing filaments are used to characterize the thermal properties as a function of print orientation. The thermal conductivity of a printed part is anisotropic and varies by 2-6 times depending on the print direction - demonstrating higher conductivity in the deposition direction (in-plane) than in the two directions perpendicular to the deposition direction (cross-plane and through-plane). Therefore, deposition path planning greatly affects the overall heat dissipation rate and the performance of the heat sink. Traditionally, 3D printing slicers generate deposition paths based solely on geometric constraints. This work investigates a new approach of deposition path planning assisted by computational predictions of the heat sink thermal performance. The proposed approach uses a thermal simulation of a 3D-printed part, accounting for the anisotropic thermal properties, and the orientation of the local material properties are assigned based on the deposition path in multiple print orientations. The performances predicted via the simulations are compared, and the optimal deposition path is determined. For the highest thermal conductivity 3D printing filament (~ 12 W/m- K in-plane), a heat sink printed with the print direction parallel to the fins z-axis had ~20% improved performance in comparison to a heat sink with print direction perpendicular to the fins z-axis. Moreover, a plastic 3D printed heat sink was able to perform within 7% of an extruded Aluminum heat sink with similar geometry under natural convection. The computational predictions show the same trend as experimental measurements using 3D printed heat sinks.

Smith, Matthew↗

Fundamental Path Optimization Strategies for Extrusion-based Additive Manufacturing

Extrusion-based additive manufacturing processes begin with a software program, called a slicer, that generates layer geometry and fits toolpaths to each layer to define where material is to be extruded or deposited. Before the toolpaths are output as g-code for the additive manufacturing system to execute, the toolpaths should be optimized. Many complex optimization approaches using graph theory, Chinese postman problem, and other complex mathematical models exist, but these approaches are rarely used in daily printing operations and are not available through common slicing programs such as Cura and PrusaSlicer. Instead, path planning and optimization typically revolves around simpler, fully automated approaches such as inside out and next closest. This paper will explore the fundamental optimization strategies for toolpath planning and document a new implementation, available via open-source slicing software, that allows for greater control of the path planning process.

Roschli, Alex [ORNL] (ORCID:0000000213084632)↗

Integration of task level planning and diagnosis for an intelligent robot

A satellite floating space is diagnosed with a telerobot attached performing maintenance or replacement tasks. This research included three objectives. The first objective was to generate intelligent path planning for a robot to move around a satellite. The second objective was to diagnose possible faulty scenarios in the satellite. The third objective included two tasks. The first task was to combine intelligent path planning with diagnosis. The second task was to build an interface between the combined intelligent system with Robosim. The ability of a robot to deal with unexpected scenarios is particularly important in space since the situation could be different from time to time so that the telerobot must be capable of detecting that the situation has changed and the necessity may exist to alter its behavior based on the new situation. The feature of allowing human-in-the-loop is also very important in space. In some extreme cases, the situation is beyond the capability of a robot so our research project allows the human to override the decision of a robot.

Chan, Amy W.↗

Traverse Planning with Temporal-Spatial Constraints

We present an approach to planning rover traverses in a domain that includes temporal-spatial constraints. We are using the NASA Resource Prospector mission as a reference mission in our research. The objective of this mission is to explore permanently shadowed regions at a Lunar pole. Most of the time the rover is required to avoid being in shadow. This requirement depends on where the rover is located and when it is at that location. Such a temporal-spatial constraint makes traverse planning more challenging for both humans and machines. We present a mixed-initiative traverse planner which addresses this challenge. This traverse planner is part of the Exploration Ground Data Systems (xGDS), which we have enhanced with new visualization features, new analysis tools, and new automation for path planning, in order to be applicable to the Re-source Prospector mission. The key concept that is the basis of the analysis tools and that supports the automated path planning is reachability in this dynamic environment due to the temporal-spatial constraints.

temporal-spatial constraints↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

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↗

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.↗

Effect of Blown Powder Directed Energy Deposition Angle On Overspray Contamination

Abstract Blown powder directed energy deposition (DED) hybrid machine tools are particularly beneficial when the net shape of a component is to be manufactured in an additive and machined interleaved fashion. This investigation seeks to analyze the effect of the additive head lean angle relative to the part on blown powder DED surface contamination due to overspray. These hybrid DED platforms are commonly installed on multi-axis machining systems where the lean of the deposition head relative to the component surface can be controlled by tilting the component. The blown powder DED process has a 10–50% lower catchment efficiency as compared to wire fed DED systems. This excess powder is still fed towards the deposition location where the particles are heated by the laser and rebound off the melt pool. Some of these heated particles impact the previously machined thin-wall surface. While the deposition process and tool path planning process has been evaluated, the effect of the overspray due to lean angle of the deposition head on the previously thin-wall machined surface is not yet fully understood. This investigation found that minimum lean angle coincides with minimal overspray effect with nearly no contamination. If a lean angle is required, the maximum lean angle possible should be implemented for the smallest effected overspray area on the machined surface which was found to decrease the affect zone by half compared to intermediate lean angles. A diameter divergence was also noticed as the deposition angle was increased. In this study, a thorough analysis of the surface and geometric effects when depositing thin-walled components at varying angles is completed. It has been shown that part quality can be significantly affected by lean angle and thus must be incorporated as an additional design consideration in the manufacturing process.

Heinrich, Lauren↗

Grasp planning under uncertainty

The planning of dexterous grasps for multifingered robot hands operating in uncertain environments is covered. A sensor-based approach to the planning of a reach path prior to grasping is first described. An on-line, joint space finger path planning algorithm for the enclose phase of grasping was then developed. The algorithm minimizes the impact momentum of the hand. It uses a Preshape Jacobian matrix to map task-level hand preshape requirements into kinematic constraints. A master slave scheme avoids inter-finger collisions and reduces the dimensionality of the planning problem.

Erkmen, A. M.↗

Evolution and advanced technology

The NASREM architecture with its standard interfaces permits development and evolution of the Flight Telerobotic Servicer to greater autonomy. Technologies in control strategies for an arm with seven DOF, including a safety system containing skin sensors for obstacle avoidance, are being developed. Planning and robotic execution software includes symbolic task planning, world model data bases, and path planning algorithms. Research over the last five years has led to the development of laser scanning and ranging systems, which use coherent semiconductor laser diodes for short range sensing. The possibility of using a robot to autonomously assemble space structures is being investigated. A control framework compatible with NASREM is being developed that allows direct global control of the manipulator. Researchers are developing systems that permit an operator to quickly reconfigure the telerobot to do new tasks safely.

Ollendorf, Stanford↗

Formalization of the Bellman-Ford Algorithm for Airspace Applications

This paper describes the formal verification of one of the most well-known algorithms for finding the shortest path between all vertices in a directed graph, namely the Bellman-Ford algorithm. This formal verification, performed in the Prototype Verification System (PVS), is motivated by two applications in the aerospace domain which use the algorithm for path planning. The first is a pre-flight calculation that uses an adapted version of Bellman-Ford to find a route intended to maximize GNSS availability throughout the flight. The second is a more traditional application intended to find the shortest path between an autonomous aircraft's current position and a goal waypoint, while avoiding regions of space specified by geofences. A novel aspect of this formal verification effort is the inclusion of two distinct models of computation for the algorithm, one being a traditional serial computation, and the other being an explicitly parallel computation. The ability to use parallel computation in the Bellman-Ford algorithm is in fact why it was chosen over other traditionally more performant algorithms, especially for the GNSS application, where the size of the graph makes a purely serial computation infeasible.

formal verification↗

A Fault-Tolerant Intelligent Robotic Control System

This research project involves development of path planning and graphical user interface software at an operator workstation and a manipulator control system which translates the commands from the user workstation to control the robot arm.

path↗

Random adaptive tool path for zonal optics fabrication

Deterministic optics fabrication using sub-aperture tools has been vital for manufacturing precision optical surfaces. The fabrication process requires the tool influence function and the tool path to calculate the dwell time that guides the tool to bring surface quality within tight design tolerances. Widely used spiral and raster paths may leave excess waviness from the tool path, and the unavoidable constant removal layer is added to obtain positive dwell time. This waviness can be removed by either using smaller tools sequentially or randomizing the tool path. However, the existing tool-path solutions can hardly adapt to different surface aperture shapes and localized surface errors. Process efficiency and accuracy are also not well considered in tool-path planning. We propose an innovative zonal Random Adaptive Path (RAP) to solve these problems in this study. Firstly, RAP can be flexibly adapted to different surface aperture shapes by introducing part boundary. Secondly, an average threshold strategy is used in the RAP planning to improve efficiency, enabling the surface errors to be selectively corrected. Finally, the threshold is performed in several passes within one processing cycle, each with its RAP, until the desired residual is achieved. The performance of the proposed RAP is studied by comparing it with the conventional tool paths. The results demonstrated that RAP takes the least processing time and achieves the best surface quality, which verifies the effectiveness of RAP in deterministic optics fabrication.

36 MATERIALS SCIENCE↗

A survey of spacecraft formation flying guidance

This paper is the first comprehensive spacecraft formation flying guidance (FFG) survey. Here by the term guidance we mean both path planning (i. e., reference trajectory generation) and optimal, open loop control design. FFG naturally divides into two areas: Deep Space (DS), in which relative spacecraft dynamics reduce to double integrator form, and Planetary Orbital Environments (POE), in which they do not (e.9. libration point formations). Both areas consider optimal formation reconfigurations. In addition, DS FFG addresses optimal u, v-coverages for multiple spacecraft interferometers and rest-to-rest rotations. The main focus of the POE literature, however, is 'assive apertures.' These are periodic and fuel-eficient relative spacecraft trajectories that accomplish scientific objectives (e.9. synthesizing an aperture).

formation flying guidance optimal control path pla↗