Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “path”

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 1,711 records · Page 95
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗
DOE OSTI2020

CTT: Tools for Fine Alignment of Flash X-ray Systems

The CTT code is a compilation of the python code that was prototyped in the interest of making a method for fine alignment of Flash X-ray Systems at the lab. It contains python code for interacting with LTT and running optimization loops using LTT simulations or ray tracing with RaySpace. It Includes classes for creating phantom objects and modular geometry objects in the simulations. It allows one to generate a random phantom that has been optimized to stay with a certain cubic volume and maximize the minimum distance between any two ball phantom centers in all projections. It was primarily made to work on ball phantoms which were simulated as Teflon spheres. It allows the alignment from some nominal position to some displaced position to simulate recovery of a real geometry from the nominal geometry of the system. Fine alignment can be done with the projections in LTT while a rough alignment is faster using rayspace. If rayspace works well for the use case it should be preferred since it is considerably faster and less resource intensive in general. Some Notes about using this code is that one will have to edit the imports for the files to get to the correct LTT path, LTT GUI path and to the CTT path when importing. This was made by using anaconda with python 3 on windows 10. The LTT code was stored in a anaconda environment which seemed to help the python find the LTT although it shouldn’t be necessary if you append the path in your code using sys.path.append(r'add the path you want here’). The sys.path.append method is a quick way to give your python code access to a given folder when running it (such as LTT or CTT). Note that since the code was originally made with paths for a specific machine that a new user will have to edit those paths to make it work in all the files that use the old paths. This is somewhat tedious but will be required to run the code on a new machine. The methodology used to run and make these notebooks starts with opening a command prompt as administrator in windows 10. After this one would activate the anaconda environment in the appropriate directory using “conda activate myenv” in the command prompt. After this open a jupyter-notebook using the keyword “jupyter-notebook". After that a notebook should open in a browser. Note that some libraries used may not come with anaconda so those may have to be installed. There shouldn’t be much though since the main things used are scipy, numpy, matplotlib, and LTT. LTTQuicksetup also requires some paths that will be specific to the computer so that should be changed as well.

42 ENGINEERING↗
NASA NTRS1998

Self-Calibrating and Remote Programmable Signal Conditioning Amplifier System and Method

A self-calibrating, remote programmable signal conditioning amplifier system employs information read from a memory attached to a measurement transducer for automatic calibration. The signal conditioning amplifier is self-calibrated on a continuous basis through use of a dual input path arrangement, with each path containing a multiplexer and a programmable amplifier. A digital signal processor controls operation of the system such that a transducer signal is applied to one of the input paths, while one or more calibration signals are applied to the second input path. Once the second path is calibrated, the digital signal processor switches the transducer signal to the second path. and then calibrates the first path. This process is continually repeated so that each path is calibrated on an essentially continuous basis. Dual output paths are also employed which are calibrated in the same manner. The digital signal processor also allows the implementation of a variety of digital filters which are either programmed into the system or downloaded by an operator, and performs up to eighth order linearization.

Medelius, Pedro J.↗
NASA NTRS2007

Real Time Analysis and Display of Aircraft Approach Maneuvers

Method and system for monitoring and comparing, in real time, performance of an aircraft during an approach to touchdown along a conventional approach path and along a contemplated modified approach path to touchdown. In a first procedure, a flight parameter value at a selected location is compared and displayed, for the planned path and for the modified path. In a second procedure, flight parameter values FP(t(sub m)) at a sequence (t(sub n)}n, of measurement times is compared and displayed, for the planned path and for a contemplated or presently-executed modified path. If the flight parameter for the planned path and for the modified path differ too much from each other, the pilot in command has an option of terminating the approach along the modified path.

Lynch, Robert E.↗
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 NTRS2013

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

Compact Radar Transceiver with Included Calibration

The Digital Beamforming Synthetic Aperture Radar (DBSAR) is an eight-channel phased array radar system that employs solid-state radar transceivers, a microstrip patch antenna, and a reconfigurable waveform generator and processor unit. The original DBSAR transceiver design utilizes connectorized electronic components that tend to be physically large and heavy. To achieve increased functionality in a smaller volume, PCB (printed circuit board) transceivers were designed to replace the large connectorized transceivers. One of the most challenging problems designing the transceivers in a PCB format was achieving proper performance in the calibration path. For a radar loop-back calibration path, a portion of the transmit signal is coupled out of the antenna feed and fed back into the receiver. This is achieved using passive components for stability and repeatability. Some signal also leaks through the receive path. As these two signal paths are correlated via an unpredictable phase, the leakage through the receive path during transmit must be 30 dB below the calibration path. For DBSAR s design, this requirement called for a 100-dB isolation in the receiver path during transmit. A total of 16 solid-state L-band transceivers on a PCB format were designed. The transceivers include frequency conversion stages, T/R switching, and a calibration path capable of measuring the transmit power-receiver gain product during transmit for pulse-by-pulse calibration or matched filtering. In particular, this calibration path achieves 100-dB isolation between the transmitted signal and the low-noise amplifier through the use of a switching network and a section of physical walls achieving attenuation of radiated leakage. The transceivers were designed in microstrip PCBs with lumped elements and individually packaged components for compactness. Each transceiver was designed on a single PCB with a custom enclosure providing interior walls and compartments to isolate transceiver subsystems from radiated interference. The enclosure also acts as a heat sink for the voltage regulators and power amplifiers inside the system. The PCB transceiver design produces transmit pulses of 2 W with an arbitrary duty cycle. Each transceiver is fed by an external 120-MHz signal transmit and two 1,140-MHz local oscillator signals. The received signal is amplified and down-converted to 120 MHz and is fed to the data processor. The transceiver dimensions are approximately 3.5 11.5 0.6 in. (9 29 1.5 cm). The PCB transceiver design reduces the volume and weight of the DBSAR instrument while maintaining the functionality found in the original design. Both volume and weight are critical for airborne and flight remote sensing instrumentation.

McLinden, Matthew↗
NASA NTRS2017

Map Projection Induced Variations in Locations of Polygon Geofence Edges

This Paper under-estimates answers to the following question under various constraints: If a geofencing algorithm uses a map projection to determine whether a position is inside/outside a polygon region, how far outside/inside the polygon can the point be and the algorithm determine that it is inside/outside (the opposite and therefore incorrect answer)? Geofencing systems for unmanned aircraft systems (UAS) often model stay-in and stay-out regions using 2D polygons with minimum and maximum altitudes. The vertices of the polygons are typically input as latitude-longitude pairs, and the edges as paths between adjacent vertices. There are numerous ways to generate these paths, resulting in numerous potential locations for the edges of stay-in and stay-out regions. These paths may be geodesics on a spherical model of the earth or geodesics on the WGS84 reference ellipsoid. In geofencing applications that use map projections, these paths are inverse images of straight lines in the projected plane. This projected plane may be a projection of a spherical earth model onto a tangent plane, called an orthographic projection. Alternatively, it may be a projection where the straight lines in the projected plane correspond to straight lines in the latitudelongitude coordinate system, also called a Plate Carr´ee projection. This paper estimates distances between different edge paths and an oracle path, which is a geodesic on either the spherical earth or the WGS84 ellipsoidal earth. This paper therefore estimates how far apart different edge paths can be rather than comparing their path lengths, which are not considered. Rather, the comparision is between the actual locations of the edges between vertices. For edges drawn using orthographic projections, this maximum distance increases as the distance from the polygon vertices to the projection point increases. For edges drawn using Plate Carr´ee projections, this maximum distance increases as the vertices become further from the equator. Distances between geodesics on a spherical earth and a WGS84 ellipsoidal earth are also analyzed, using the WGS84 ellipsoid as the oracle. Bounds on the 2D distance between a straight line and a great circle path, in an orthographically projected plane rather than on the surface of the earth, have been formally verified in the PVS theorem prover, meaning that they are mathematically correct in the absence of floating point errors.

Neeley, Paula↗
DOE OSTI2024

Portable self-contained pressure testing manifold and associated methods

A portable, case-enclosed pressure test manifold, configured to support both pneumatic and hydrostatic pressure testing, and comprising a downstream fluid path (e.g., a system test gauge, a ball valve, a system test port, a system relief valve, and other components/piping) and an upstream fluid path (e.g., a low-pressure gauge, a high-pressure gauge, and other components/piping). A regulator and/or the ball valve selectively operate the downstream fluid path, defining a hydrostatic pressure testing path, to receive a liquid; and the upstream fluid path in combination with the downstream fluid path, defining a pneumatic pressure testing path, to receive a gas. Manifold components are pressure rated based on use and are ASME Code B31.3 compliant. A flexible hose connects with either of the pneumatic pressure testing path and the hydrostatic pressure testing path of the manifold. The case includes parking receptables and a carrying handle configured to stow the hose during transport.

Milholland, Roger A.↗
NASA NTRS2021

Small UAV Flight Planning in Urban Environments

This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.

Path planning↗
NASA NTRS1977

A description of the software analysis from flight and simulation data of the course cut limiter in the TCV b-737 area navigation computer

During automatic horizontal path captures, the (Terminal Configured Vehicle) B-737 airplane maintained smaller than designed path intercept angles and experienced a sawtooth bank angle oscillation during its turn towards the path. From flight data, it was determined that these anomalies were caused by the improper output of the course cut limiter in the horizontal path control law. The output from the course cut limiter did not obtain its full value and it was calculated stepwise discontinuously. The automatic horizontal path captures were then conducted on the TCV B-737 airplane real-time simulation. The path intercept angles were maintained properly and no bank angle oscillation was encountered. Data showed that the course cut limiter was calculated at its full value in a continuous manner. The intermediate calculations of the course cut limiter in the airplane's navigation computer were rewritten and rescaled in such a manner that truncation errors could be minimized. The horizontal path capture tests were then reflown. The airplane maintained the proper path intercept angle and no bank angle oscillations occurred on any of the tests.

Knox, C. E.↗
NASA NTRS1983

Development of a prototype multi-processing interactive software invocation system

The Interactive Software Invocation System (NASA-ISIS) was first transported to the M68000 microcomputer, and then rewritten in the programming language Path Pascal. Path Pascal is a significantly enhanced derivative of Pascal, allowing concurrent algorithms to be expressed using the simple and elegant concept of Path Expressions. The primary results of this contract was to verify the viability of Path Pascal as a system's development language. The NASA-ISIS implementation using Path Pascal is a prototype of a large, interactive system in Path Pascal. As such, it is an excellent demonstration of the feasibility of using Path Pascal to write even more extensive systems. It is hoped that future efforts will build upon this research and, ultimately, that a full Path Pascal/ISIS Operating System (PPIOS) might be developed.

Berman, W. J.↗
NASA NTRS1989

Fault tolerant hypercube computer system architecture

A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed. Communication between the working nodes is via one communications network while communications between the working nodes and watch dog nodes and load balancing nodes higher in the structure is via another communications network separate from the first. A typical branch of the hierarchy reporting to a master node or host computer comprises, a plurality of first computing nodes; a first network of message conducting paths for interconnecting the first computing nodes as a hypercube. The first network provides a path for message transfer between the first computing nodes; a first watch dog node; and a second network of message connecting paths for connecting the first computing nodes to the first watch dog node independent from the first network, the second network provides an independent path for test message and reconfiguration affecting transfers between the first computing nodes and the first switch watch dog node. There is additionally, a plurality of second computing nodes; a third network of message conducting paths for interconnecting the second computing nodes as a hypercube. The third network provides a path for message transfer between the second computing nodes; a fourth network of message conducting paths for connecting the second computing nodes to the first watch dog node independent from the third network. The fourth network provides an independent path for test message and reconfiguration affecting transfers between the second computing nodes and the first watch dog node; and a first multiplexer disposed between the first watch dog node and the second and fourth networks for allowing the first watch dog node to selectively communicate with individual ones of the computing nodes through the second and fourth networks; as well as, a second watch dog node operably connected to the first multiplexer whereby the second watch dog node can selectively communicate with individual ones of the computing nodes through the second and fourth networks. The branch is completed by a first load balancing node; and a second multiplexer connected between the first load balancing node and the first and second watch dog nodes, allowing the first load balancing node to selectively communicate with the first and second watch dog nodes.

Madan, Herb S.↗
NASA NTRS1995

Temporal variation of meandering intensity and domain-wide lateral oscillations of the Gulf Stream

The path of the Gulf Stream exhibits two modes of variability: wavelike spatial meanders associated with instability processes and large-sale lateral shifts of the path presumably due to atmospheric forcing. The objectives of this study are to examine the temporal variation of the intensity of spatial meandering in the stream, to characterize large-scale lateral oscillations in the stream's path, and to study the correlation betwen these two dynamically distinct modes of variability. The data used for this analysis are path displacemets ofthe Gulf Stream between 75 deg and 60 deg W obtained from AVHRR-derived (Advanced Very High Resolution Radiometer) infrared images for the period April 1982 through December 1989. Meandering intensity, measured by the spatial root-mean-sqaure displacement of the stream path, displays a 9-month dominant periodicity which is persistent through the study period. The 9-month fluctuation in meandering intensity may be related to the interaction of Rosseby waves with the stream. Interannual variation of meandering intensity is also found to be significant, with meandering being mich more intense during 1985 than it was in 1987. Annual variation, however,is weak and not well-defined.The spatially averaged position of the stream, which reflects nonmeandering large-scale lateral oscillations of the stream path, is dominated by an annual cycle. On average, the mean position is farthest north in November and farthest south in April. The first empirical orthogonal function mode of the space-time path displacements represents lateral oscillatins that are in-phase over the space-time domain. Interannual oscillations are also observed and are found to be weaker than the annual oscillation. The eigenvalue of the first mode indicates that about 21.5% of the total space-time variability of the stream path can be attibuted to domain-wide lateral oscillation. The correlation between meandering intensity and domain-wide lateral oscillations is very weak.

Lee, Tong↗
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↗
DOE OSTI2021

Modeling and Analysis of the Transport and Disposal of Beryllium Moderator Blocks and Greater than Class C (GTCC) Waste

Radioactive waste in the United states is categorized based on its source, radioactivity, and security risk. The categorization method employed by the Nuclear Regulatory Committee (NRC) for low-level radioactive waste is not currently applied to any waste generated by the Department of Energy (DOE) or disposed of in DOE facilities. As a result, there is a large volume of DOE-generated waste with characteristics similar to the NRC’s “Greater than Class C” (GTCC) waste category which presently do not have a path for long-term disposal. Much of this waste cannot undergo the standard commercial disposition process due to it being categorized as Transuranic (TRU) waste under DOE guidelines, due to elevated concentrations of key fission products. Possible solutions to this dilemma are explored in the Environmental Impact Statement for the “Disposal of Greater-Than-Class-C Low Level Radioactive Wave” (EIS-0375). This paper analyzes several EIS possible paths for disposal for this “orphaned” waste. One example that highlights this categorization issue is the spent beryllium cladding that has been extracted from the Advanced Test Reactor (ATR) at Idaho National Laboratory (INL) throughout its operational lifetime. These beryllium blocks surround the reactor’s main chambers and components and serve as neutron moderators. This paper will use this particular waste form to analyze the economic and technological viability of transporting and storing this material under the storage and transportation criteria of the Waste isolation Pilot Plant (WIPP), which was deemed the most feasible disposition path according to the EIS. The example of this waste form used in this paper that highlights this categorization issue is the spent beryllium cladding extracted from Idaho National Laboratory’s (INL) Advanced Test Reactor (ATR). These beryllium blocks surround the reactor’s components and serve as neutron moderators, and thus have accumulated high concentration of high-activity transuranic isotopes. This paper analyzed the viability of transporting and storing this material under the storage and transportation criteria of the five primary disposition paths covered in EIS-0375. An array of calculations was carried out to assess the viability of the various disposition paths for the beryllium shipments as well as other waste shipments that fall within the GTCC category. Modeling with MCNP 6.2 was conducted to determine whether the beryllium blocks could be safely stored and transported within a 72-B cask; the standard shipping container for remote-handled, transuranic waste, while also meeting regulatory limits at various disposition paths. A cost analysis of the transportation and long-term disposal paths mentioned in the EIS was also carried out using available data and information from similar waste shipments. Lastly, a geochemical analysis of the various geological repository discussed in the EIS was also carried out using the Geochemists Workbench Release 14. Long-term disposal of the beryllium blocks at the Waste Isolation Pilot Plant (WIPP) proved to be the most cost-effective long-term disposition option of the ones considered in the EIS. A dose rate calculation at both contact and remote-handling distances indicate that the analyzed beryllium shipments should not exceed the exposure limits at any of the considered locations. Greater-than-class-C waste has been left in a regulatory state of limbo for years, resulting in backlogs of inventory across several research sites in the United States. Due to its high activity and presence of transuranic isotopes, it is imperative to ensure that it remains inaccessible and sequestered both in its short-term interim as well as a long-term geologic time scale. The information and assessments done in the paper could potentially serve as a reference for any future shipments of this waste form at the WIPP facility as well as other disposition paths that may be considered in the future.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

Feed-forward spectral calibration methodology for line-scanned tunable laser absorption spectroscopy

A generalized feed-forward method for accurate tunable laser absorption spectroscopy includes generating a laser beam. The generated laser beam is directed down a reference path and a test/sample path. One or more parameters are extracted from the reference path. The one or more parameters, extracted from the reference path, are used as feed-forward, to adjust spectral analysis of the test/sample path to detect a composition and/or concentration of an analyte gas within the test/sample path. The extraction of the one or more parameters from the reference path and the spectral analysis of the test/sample path are performed substantially concurrently.

Green, William↗
DOE OSTI2023

7. Space-Filling Toolpath Generation

Space-filling toolpaths are used to fill whatever space remains on a layer after closed-loop contours have been planned. They provide structure to the object, both supporting the geometry and creating solid surfaces. As such, there are two main types of space-filling toolpaths: infill and skin. Infill paths are sparse and meant to cover a large area quickly. Infill is typically not visible once a print is complete, because infill is covered by skins. Skins are the solid space-filling toolpaths meant to solidify the top and bottom of the object, which, unlike the sides of the object, are not completely covered by layering contours. Space-filling paths are typically planned by projecting a pattern over the layer, clipping the pattern at the boundary of the object, and then linking the remaining portions of the pattern. A subcategory of skin paths, called gradual infill, can be employed to densify the infill when approaching a top skin layer so that the print path of the top skin is sufficiently supported. Space-filling paths come in a variety of patterns to optimize how the space is filled. This chapter will discuss space-filling path categories, how to find the space for each path type, and how to apply the path type to generate toolpaths.

Roschli, Alex↗