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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A GPU-based Approach for Path Planning Optimization via Travel Length Reduction

Typically, before constructing an object with an additive manufacturing system, the 3D object must be sent through a process called slicing. Slicing converts a 3D object commonly in the form of an STL file into a set of layers by horizontally intersecting a plane with the object at various heights. At each height, called a layer, multiple 2D polygons can be generated. Each polygon represents a boundary for solid geometry and is called an island. Each island is then comprised of multiple path types in an attempt to optimally fill the polygon. To move between each island and each islands’ paths, travels are inserted. Travels are simply motion by the system to move from one area of construction to another. Travels do not contribute to the construction of the object, and so, are considered wasted motion. In large-scale additive manufacturing, objects can be quite large and the distance between islands can be large as well. As a result, these travels can waste a significant amount of time. Ideally, travels would be as short as possible, however, computing global minimal travel paths is computationally expensive. To combat this problem, researchers at Oak Ridge National Lab developed a GPU-based approach to travel insertion based on a unique factoradic representation. This representation was then utilized by the GPU to solve the Traveling Salesman Problem (TSP). This algorithm was able to compute global minimal travel paths quickly resulting in faster object construction. A general investigation was also carried out to determine when a GPU vs CPU implementation would be beneficial.

Borish, Michael↗
DOE OSTI2023

Integrated path planning and control through proximal policy optimization for a marine current turbine

This paper presents an integrated path planning and tracking control framework for a marine current turbine (MCT), where the MCT is treated as an energy-harvesting autonomous underwater vehicle (AUV). Considering the ocean (space of action) is continuous, the proposed framework employs two modules to address path planning and path tracking enabled by the proximal policy optimization (PPO) algorithm, which is a policy gradient deep reinforcement learning (RL) method. Further, to enable fully autonomous operation in a stochastic oceanic environment, the proposed path planning seeks a primary objective of maximizing the harvested energy; then, the path tracking module is designed to minimize the tracking error and avoid collisions with static and dynamic obstacles. Using field-collected acoustic Doppler current profiler (ADCP) data, the performance of the proposed framework is evaluated. Comparative studies with baseline algorithms in three different scenarios of path planning, path tracking without an obstacle, and path tracking with collision avoidance verify the effectiveness of our proposed approach.

16 TIDAL AND WAVE POWER↗
DOE OSTI2021

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗
DOE OSTI2024

Automated path planning for functionally graded materials considering phase stability and solidification behavior: Application to the Mo-Nb-Ta-Ti system

Functionally graded materials have the potential to improve upon monolithic parts by locally tailoring compositions to surrounding environmental conditions. Difficulties arise when designing composition gradients as incompatible materials can result in detrimental phase formation and failure of the gradient joint. As many alloys are multi-component, designing a composition gradient free of detrimental phases is difficult due to the large composition space available to explore. A framework was developed that improves the path planning algorithm and surrogate models with adaptive sampling schemes specific to their problem definition. A cost function was created to minimize a property (such as cracking susceptibility) along a path. This framework was applied to the Mo-Nb-Ta-Ti system as a case study to showcase the efficiency in building the surrogate models and in iterating different optimal compositionally graded paths.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning

Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.

Krajewski, Adam M. (ORCID:0000000222660099)↗
DOE OSTI2025

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)↗
DOE OSTI2023

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↗
DOE OSTI2022

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↗
DOE OSTI2025

Extending wire-arc directed energy deposition using non-gravity aligned (NGA) torch methods

For standard Additive Manufacturing (AM) processes, traditional path planning typically relies on a 2.5-dimensional approach. In wire-arc directed energy deposition (DED), commonly referred to as wire-arc additive manufacturing (WAAM), this 2.5D approach inherently limits final near net shape due to the stair-step effect and restricts the maximum overhang angle achievable without part degradation. To achieve better near net shape and part quality, a 3D planning approach that modulates the tool tip position and angle without process changes is demonstrated in components containing up to 105° of unsupported overhang. The experimental methods are validated with half and fully enclosed cylinder sections containing 90° of overhang. The non-gravity aligned methods are then applied to a commercial WAAM system for a composite tool mold demonstrator part. As a result, the methods developed in this paper enable expansion of WAAM system capabilities to parts containing large overhangs without compromising the net shape or material structure of the resulting parts and without the need for a part positioner.

Additive manufacturing↗
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↗
DOE OSTI2024

Planar slicing for nonextrusion AM processes

Extrusion-based AM processes, including material extrusion and directed energy deposition, construct objects by continuously depositing a relatively small amount of molten feedstock to a specific location. Nonextrusion AM processes, on the other hand, tend to form each layer by linearly or areally projecting either energy onto a vat of photocurable liquid or a binding agent into a bed of loose powder. Such systems vary significantly from extrusion-based AM processes but do share similarities. The general approach to path planning is the same, but nonextrusion processes typically favor the use of bitmap representations, instead of polygons, for pathing computation and do not use a g-code file to command the printer. In this chapter, a high-level discussion of these differences will be covered.

Macdonald, Eric↗
DOE OSTI2024

Evaluation of Autonomous Vehicle Sensing and Compute Load on a Chassis Dynamometer

The sensing and compute load auxiliary energy consumption in autonomous vehicles may be significant due to the large number of sensors and the high compute load from sensor processing and route planning. To understand this issue, this study investigates the top-down energy usage of an electric 2015 Kia Soul fully instrumented with state sensors and a state-specific computer for path planning and sensor processing. A chassis dynamometer was then used to evaluate the cases of (1) no sensors or computation, (2) only sensors operating, and (3) sensors plus compute load. The vehicle was operated autonomously on the dynamometer using a PolySync drive-kit with drive-by-wire longitudinal control. The DynoJet model 224xLC was used to adapt the eddy current dynamometer's road load parameters to comply with an Environmental Protection Agency drive schedule and to evaluate performance against the Argonne National Laboratory Digital Dynamometer Dataset. On the UDDS-HWFET combined driving cycle, the stock battery's range was reduced by 5.6% for sensors alone and 12.2% for sensors and compute load. These results show that the added sensing and compute auxiliary load from automated and autonomous systems is significant and that research efforts need to be spent investigating new energy efficient systems.

Brown, Nicholas E.↗