Log in

Relevant bibliographies by topics / Path generation

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Path generation'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Path generation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Path generation"

1

Kumar, Gagan, and Vinay Chopra. "Automatic Test Data Generation for Basis Path Testing." Indian Journal Of Science And Technology 15, no. 41 (November 5, 2022): 2151–61. http://dx.doi.org/10.17485/ijst/v15i41.1503.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chirvasitu, Alexandru. "Metric enrichment, finite generation, and the path coreflection." Archivum Mathematicum, no. 2 (2024): 61–99. http://dx.doi.org/10.5817/am2024-2-61.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Goldenberg, A. A., and D. L. Lawrence. "End Effector Path Generation." Journal of Dynamic Systems, Measurement, and Control 108, no. 2 (June 1, 1986): 158–62. http://dx.doi.org/10.1115/1.3143761.

Full text

Abstract:

The path followed by a robotic manipulator is often defined by a sequence of Cartesian knots, i.e., position and orientation (location) of the end effector and the corresponding linear and angular velocity (speed) at each knot. The path location and speed in the interval between knots are not specified. Typically the control of robots is performed in terms of joint coordinates. Often, the joint coordinates corresponding to the path knots are splined together using lower degree polynomials. The actual path and speed followed by the end effector can be obtained by performing forward (direct) kinematics—a pointwise transformation. To obtain a good approximation of the actual path, many points must be used. In this paper an efficient first order approximation of the actual path using third order (cubic) interpolating polynomials is presented. The technique eliminates the need for repeatedly using the forward kinematics. The technique is illustrated by means of numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

4

Teng, Kai, and Yong Zeng. "The Path Optimization of Spray Painting Robot for Two Path Pattern." Advanced Materials Research 605-607 (December 2012): 1563–67. http://dx.doi.org/10.4028/www.scientific.net/amr.605-607.1563.

Full text

Abstract:

Automatic trajectory generation for spray painting is highly desirable for today’s automotive manufacturing. Generating paint gun trajectories for complex curved surfaces to satisfy paint thickness requirements is still highly challenging due to the complex geometry of surfaces. In this paper, based on existing of method which complex surfaces are divided into patches to satisfy the constraints, two path optimization algorithms for path pattern have been developed. Two algorithms are developed to optimize the spiral path and zigzag path on a patch by modifying the planning direction of paint gun path. The results of simulations have shown that the two path planning algorithms achieve satisfactory performance.

APA, Harvard, Vancouver, ISO, and other styles

5

Djelic, Marie-Laure, and Sigrid Quack. "Overcoming path dependency: path generation in open systems." Theory and Society 36, no. 2 (March 15, 2007): 161–86. http://dx.doi.org/10.1007/s11186-007-9026-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kyaw, Aye Aye, and Myat Myat Min. "An Efficient Approach for Model Based Test Path Generation." International Journal of Information and Education Technology 5, no. 10 (2015): 763–67. http://dx.doi.org/10.7763/ijiet.2015.v5.607.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Yanran, and Wenjie Li. "Meta-Path Augmented Response Generation." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 9971–72. http://dx.doi.org/10.1609/aaai.v33i01.33019971.

Full text

Abstract:

We propose a chatbot, namely MOCHA to make good use of relevant entities when generating responses. Augmented with meta-path information, MOCHA is able to mention proper entities following the conversation flow.

APA, Harvard, Vancouver, ISO, and other styles

8

Mansour, Nashat, and Miran Salame. "Data Generation for Path Testing." Software Quality Journal 12, no. 2 (June 2004): 121–36. http://dx.doi.org/10.1023/b:sqjo.0000024059.72478.4e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Akçali, I. D., and G. Dittrich. "Path generation by subdomain method." Mechanism and Machine Theory 24, no. 1 (January 1989): 45–52. http://dx.doi.org/10.1016/0094-114x(89)90082-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhu, Jiang, Akimitsu Hozumi, Tomohisa Tanaka, and Yoshio Saito. "High Efficiency Tool Path Generation for Freeform Surface Machining Based on NURBS Subdivision." Key Engineering Materials 625 (August 2014): 372–77. http://dx.doi.org/10.4028/www.scientific.net/kem.625.372.

Full text

Abstract:

Along with the rapid development of CAD/CAM system, the smooth surfaces are widely used in industry design. Especially NURBS surface attracts rising attentions because NURBS can describe flat surface, freeform surface and so on. Currently a lot of tool path generation patterns are proposed for milling process of freeform surface. Nevertheless there are still some problems on generating efficient tool path for freeform surface under the requested surface finish roughness. In this research, in order to resolve these problems, NURBS surface is divided into some patches and the tool path is generated on each patch. This paper proposes a surface divide method and makes a comparison between this method and undivided method. As a result, it is found that dividing the surface is helpful for the making shorter tool path and increase the machining efficiency.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Path generation"

1

Tsui, Kin-shing. "Tool path generation for protrusion milling." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36891332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tsui, Kin-shing, and 徐健成. "Tool path generation for protrusion milling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B36891332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ferreira, Labiche. "Surface mapping and automatic tool path generation." Master's thesis, University of Central Florida, 1991. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/26775.

Full text

Abstract:

University of Central Florida College of Engineering Thesis
With the use of machine vision systems in the manufacturing cycle of a product, the lead time for producing the final product has been substantially reduced. Efforts in the past have aimed at automating the tasks right from the drawing board stage to final production of the product. Such technologies include CAD, CAM, and CAPP. However the task of tool path (NC code) generation has not yet been fully automated. In the current techniques, the user plays a crucial role in the NC code generation process. There is an increasing trend for using machine vision systems in the fabrication of a part. Most machine vision (surface mapping) techniques generate a huge amount of data. Ideally, a CAM system should be capable of accepting data in any format for tool path generation with minimum intervention from the user. This thesis proposes a four step, computer based method for tool path (NC Code) generation from X,Y,Z data, aimed at minimizing if not eliminating the user role. The different techniques of surface mapping and curve fitting are also presented. These four steps extract relevant information needed for the generation of NC code, thereby automating the process traditionally handled by a user a interface.
M.S.;
Engineering;
Industrial Engineering;
156 p.
vi, 156 leaves, bound : ill. ; 28 cm.

APA, Harvard, Vancouver, ISO, and other styles

4

Flanigan, Ed. "Scalable test generation for path delay faults /." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1791777651&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

Abstract:

Thesis (Ph. D.)--Southern Illinois University Carbondale, 2009.
"Department of Electrical and Computer Engineering." Keywords: Path delay faults, Test generation, VLSI, Scalable test generation. Includes bibliographical references (p. 68-73). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

5

Flanigan, Edward. "SCALABLE TEST GENERATION FOR PATH DELAY FAULTS." OpenSIUC, 2009. https://opensiuc.lib.siu.edu/dissertations/291.

Full text

Abstract:

Modern day IC design has drawn a lot of attention towards the path delay fault model (PDF) [1], which targets delay defects that affect the timing characteristics of a circuit. Due to the exponential number of paths in modern circuits a subset of critical paths are chosen for testing purposes [2]. Path intensive circuits contain a large number of critical paths whose delays affect the performance of the circuit. This dissertation presents three techniques to improve test generation for path delay faults. The first technique presented in this dissertation avoids testing unnecessary paths by using arithmetic operations. This second technique shows how to compact many faults into a single test application, thus saving valuable test application time. The third technique demonstrates how to generate tests under modern day scan architectures. Experimental results demonstrate the effectiveness of the proposed techniques.

APA, Harvard, Vancouver, ISO, and other styles

6

Roca, Navarro Xevi. "Paving the path towards automatic hexahedral mesh generation." Doctoral thesis, Universitat Politècnica de Catalunya, 2009. http://hdl.handle.net/10803/5858.

Full text

Abstract:

Esta tesis versa sobre el desarrollo de las tecnologías para la generación de mallas de hexaedros. El proceso de generar una malla de hexaedros no es automático y su generación requiere varias horas te trabajo de un ingeniero especializado. Por lo tanto, es importante desarrollar herramientas que faciliten dicho proceso de generación. Con este fin, se presenta y desarrolla un método de proyección de mallas, una técnica de sweeping o barrido, un algoritmo para la obtención de mallas por bloques, y un entorno de generación de mallas.

Las implementaciones más competitivas del método de sweeping utilizan técnicas de proyección de mallas basadas en métodos afines. Los métodos afines más habituales presentan varios problemas relacionados con la obtención de sistemas de ecuaciones normales de rango deficiente. Para solucionar dichos problemas se presenta y analiza un nuevo método afín que depende de dos parámetros vectoriales. Además, se detalla un procedimiento automático para la selección de dichos vectores. El método de proyección resultante preserva la forma de las mallas proyectadas. Esta proyección es incorporada también en una nueva herramienta de sweeping. Dicha herramienta genera capas de nodos internos que respetan la curvatura de las superficies inicial y final. La herramienta de sweeping es capaz de mallar geometrías de extrusión definidas por trayectorias curvas, secciones no constantes a lo largo del eje de sweeping, y superficies inicial y final con diferente forma y curvatura.

En las últimas décadas se han propuesto varios ataques para la generación automática de mallas de hexahedros. Sin embargo, todavía no existe un algoritmo rápido y robusto que genere automáticamente mallas de hexaedros de alta calidad. Se propone un nuevo ataque para la generación de mallas por bloques mediante la representación de la geometría y la topología del dual de una malla de hexaedros. En dicho ataque, primero se genera una malla grosera de tetraedros. Después, varió polígonos planos se añaden al interior de los elementos de la malla grosera inicial. Dichos polígonos se denotan como contribuciones duales locales y representan una versión discreta del dual de una malla de hexaedros. En el último paso, la malla por bloques se obtiene como el dual de la representación del dual generada. El algoritmo de generación de mallas por bloques es aplicado a geometrías que presentan diferentes características geométricas como son superficies planas, superficies curvas, configuraciones delgadas, agujeros, y vértices con valencia mayor que tres.

Las mallas se generan habitualmente con la ayuda de entornos interactivos que integran una interfaz CAD y varios algoritmos de generación de mallas. Se presenta un nuevo entorno de generación de mallas especializado en la generación de cuadriláteros y hexaedros. Este entorno proporciona la tecnología necesaria para implementar les técnicas de generación de mallas de hexaedros presentadas en esta tesis.
This thesis deals with the development of hexahedral mesh generation technology. The process of generating hexahedral meshes is not fully automatic and it is a time consuming task. Therefore, it is important to develop tools that facilitate the generation of hexahedral meshes. To this end, a mesh projection method, a sweeping technique, a block-meshing algorithm, and an interactive mesh generation environment are presented and developed.

Competitive implementations of the sweeping method use mesh projection techniques based on affine methods. Standard affine methods have several drawbacks related to the statement of rank deficient sets of normal equations. To overcome these drawbacks a new affine method that depends on two vector parameters is presented and analyzed. Moreover, an automatic procedure that selects these two vector parameters is detailed. The resulting projection procedure preserves the shape of projected meshes. Then, this procedure is incorporated in a new sweeping tool. This tool generates inner layers of nodes that preserve the curvature of the cap surfaces. The sweeping tool is able to mesh extrusion geometries defined by non-linear sweeping trajectories, non-constant cross sections along the sweep axis, non-parallel cap surfaces, and cap surfaces with different shape and curvature.

In the last decades, several general-purpose approaches to generate automatically hexahedral meshes have been proposed. However, a fast and robust algorithm that automatically generates high-quality hexahedral meshes is not available. A novel approach for block meshing by representing the geometry and the topology of a hexahedral mesh is presented. The block-meshing algorithm first generates an initial coarse mesh of tetrahedral elements. Second, several planar polygons are added inside the elements of the initial coarse mesh. These polygons are referred as local dual contributions and represent a discrete version of the dual of a hexahedral mesh. Finally, the dual representation is dualized to obtain the final block mesh. The block-meshing algorithm is applied to mesh geometries that present different geometrical characteristics such as planar surfaces, curved surfaces, thin configurations, holes, and vertices with valence greater than three.

Meshes are usually generated with the help of interactive environments that integrate a CAD interface and several meshing algorithms. An overview of a new mesh generation environment focused in quadrilateral and hexahedral mesh generation is presented. This environment provides the technology required to implement the hexahedral meshing techniques presented in this thesis.

APA, Harvard, Vancouver, ISO, and other styles

7

Ahamed, Shafee. "Tool path generation for rough machining using STEP." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/9715.

Full text

Abstract:

The production efficiency has been significantly improved over the years due to the rapid advancement in CAD and CAM. Very often, however, the production cycle is still unacceptably long. This has been frequently caused by the bottleneck link between CAD and CAM. The CAD design model cannot be directly machined by a CNC machine without an NC program, an NC program cannot be coded without a clearly defined tool path, and the CAD data are not readily useable for preparing tool path. A large amount of time is often spent on data exchange, NC tool path generation, and NC program preparation. To further reduce the production cycle, the CAD model has to be documented in a neutral format such that it can be readily used in CAM and the tool path should be automatically generated from the CAD model in a neutral format. The recently developed STEP data exchange standard provides such a neutral format that is independent of any software and hardware. However, none of the existing tool path generation systems is based on STEP. In view of the above facts, a STEP based tool path generation system is developed for rough machining of planar surfaces. This system comprises four modules. The first one is the data extraction module used to obtain geometric data from STEP. The second module is the slicing module which is designed to convert the three dimensional tool path generation problem into a series of two dimensional problems. The tool path will be generated by the third module. The tool path is then translated into NC program by an NC code generator--the last module. The proposed system has been implemented in a UNIGRAPHICS CAD/CAM environment. The application of the system is illustrated using an example part.

APA, Harvard, Vancouver, ISO, and other styles

8

Cocaud, Cedric. "Autonomous tasks allocation and path generation of UAV's." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27508.

Full text

Abstract:

The feasibility and survivability of Unmanned Air Vehicles (UAV's) in field applications have been demonstrated during many of the recent conflicts. UAV's have the potential to reduce costs and personnel while performing certain missions such as surveillance and reconnaissance with higher efficiency and lower risks. Since it is now recognized that a single UAV cannot achieve all tasks required during a mission, the option of using fleets of UAV's with complementary capabilities is now explored. However, controlling and coordinating such fleets will be almost impossible when considering the overwhelming number of degrees of freedom and their associated constraints, if individual UAV do not possess a high level of autonomy. Addressing the need for intelligent controllers, this work presents a new approach for on-line trajectory planning of a single UAV. The approach uses a genetic algorithm and integrates constraints of different types including specific times of arrival, vectors of approach close to target points, multiple objectives, weather conditions and behavioural guidelines with respect to speed, altitude and obstacle distance. The UAV's controller is divided into three modules. The first one is a trajectory generator that uses an analytical model to simulate the dynamics of UAV's. It is used to compute new trajectories in 3D as well as to assess the feasibility of existing ones. The second module is a knowledge base that uses a hybrid octree structure to represent terrain in 3D. The octree compresses digital elevation data by setting the resolution of the UAV's internal map to different levels based on the homogeneity of the terrain. The third module is a Genetic Algorithm that finds and optimizes candidate trajectories which fulfill all objectives of a mission while taking in account a variable number of constraints with varying preponderance. Simulations have shown that the intelligent controller could find viable trajectories within 10 to 20 seconds for missions with a single objective, demonstrating the feasibility of using this control scheme for real-time path planning for UAV's. Dynamically feasible trajectories satisfying all constraints could also be found for missions with up to three objectives. However, real time capabilities were severely reduced for such complex missions, the average computing time varying from 200 to 450 seconds. In all cases, all resulting trajectories were dynamically feasible, and could be readily used by the autopilot.

APA, Harvard, Vancouver, ISO, and other styles

9

Panoff, Timothy J. "Reference path generation and tracking of marine vehicles." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/24025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Putta, Laxmiprasad 1974. "Automatic tool path generation for multi-axis machining." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50463.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1998.
Includes bibliographical references (leaves 67-72).
We present a novel approach to CAD/CAM integration for multi-axis machining. Instead of redefining the workpiece in terms of machining features, we generate tool paths directly by analyzing the accessibility of the surface of the part. This eliminates the problem of feature extraction. We envision this as the core strategy of a new direct and seamless CAD/ CAM system. We perform the accessibility analysis in two stages. First, we triangulate the surface of the workpiece and perform a visibility analysis from a discrete set of orientations arranged on the Gaussian Sphere. This analysis is performed in object space to ensure reliability. For each triangle, a discrete set approximation of the accessibility cone is then constructed. Next, a minimum set cover algorithm like the Quine-McCluskey Algorithm is used to select the minimum set of orientations from which the entire workpiece can be accessed. These set of orientations correspond to the setups in the machining plan, and also dictate the orientation in which the designed part will be embedded in the stock. In particular, we bias the search for setups in favor of directions from which most of the part can be accessed i.e, the parallel and perpendicular directions of the faces in the workpiece. For each setup, we select a set of tools for optimal removal of material. Our tool-path generation strategy is based on two general steps: global roughing and facebased finishing. In global roughing, we represent the workpiece and stock in a voxelized format. We perform a waterline analysis and slice the stock into material removal slabs. In each slab, we generate zig-zag tool paths for removing bulk of the material. After gross material removal in global roughing, we finish the faces of the component in face-based finishing. Here, instead of assembling faces into features, we generate tool paths directly and independently for each face. The accessibility cones are used to help ensure interference- free cuts. After the tool paths have been generated, we optimize the plan to ensure that commonalities between adjacent faces are exploited.
by Laxmiprasad Putta.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Path generation"

1

Harper, Ash. Moonbelly: 7th generation priestess path. Leeds, Mass: AshRising Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

K, Choi Byoung, ed. NC machining and cutter-path generation. Oxford: Butterworth-Heinemann, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

K, Choi Byoung, ed. NC machining and cutter-path generation. Oxford: Butterworth-Heinemann, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Panoff, Timothy J. Reference path generation and tracking of marine vehicles. Monterey, Calif: Naval Postgraduate School, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Vang, Lue. Grandmother's path, grandfather's way =: Poj rhawv kab, yawg rhawv kev : oral lore, generation to generation. 2nd ed. Rancho Cordova, Calif: Vang & Lewis, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Andrews, Stuart. Interactive generation of feature curves on surfaces: A minimal path approach. Toronto: University of Toronto, Dept. of Computer Science, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

National Research Council (U.S.). Committee on Technologies to Deter Currency Counterfeiting., ed. A path to the next generation of U.S. banknotes: Keeping them real. Washington, D.C: National Academies Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vang, Lue. Grandmother's path, Grandfather's way: Poj rhawv kab Yawg rhawv kev ; ora lore, generation to generation : Lue Vang, Judy Lewis. Rancho Cordova, CA: L. Vang and J. Lewis, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vang, Lue. Grandmother's path, Grandfather's way: =Poj rhawv kab Yawg rhawv kev ; ora lore, generation to generation : Lue Vang, Judy Lewis. Rancho Cordova, CA: L. Vang and J. Lewis, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fraas, Lewis M. Path to affordable solar electric power & the 35% efficient solar cell. [Issaquah, WA]: JX Crystals, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Path generation"

1

Pitt, Christopher. "Paths and Path Followers." In Procedural Generation in Godot, 209–22. Berkeley, CA: Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-8795-8_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bubley, Russ. "Applications: Path Coupling." In Randomized Algorithms: Approximation, Generation and Counting, 91–118. London: Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0695-1_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ryutova-Kemoklidze, Margarita. "By the Sure Path of Experimentation." In The Quantum Generation, 1–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-49357-7_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Faria, Carlos, Daniela Martins, Marina A. Matos, Diana Pinho, Bruna Ramos, Estela Bicho, Lino Costa, et al. "Path Generation, Control, and Monitoring." In Advanced Structured Materials, 203–36. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44522-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Choi, Byoung K., and Robert B. Jerard. "Tool-path generation for roughing." In Sculptured Surface Machining, 147–65. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5283-3_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Choi, Byoung K., and Robert B. Jerard. "Tool-path generation for finishing." In Sculptured Surface Machining, 166–85. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5283-3_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lauwers, Bert. "Five-Axis Tool Path Generation." In CIRP Encyclopedia of Production Engineering, 1–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-642-35950-7_16684-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lauwers, Bert. "Five-Axis Tool Path Generation." In CIRP Encyclopedia of Production Engineering, 514–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-20617-7_16684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lauwers, Bert. "Five-Axis Tool Path Generation." In CIRP Encyclopedia of Production Engineering, 683–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-53120-4_16684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jia, Limin, Li Wang, and Yong Qin. "Rerouting Path Generation in Emergency." In High-Speed Railway Operation Under Emergent Conditions, 81–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63033-4_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Path generation"

1

Yao, Zhiyang, Satyandra K. Gupta, and Dana S. Nau. "Hybrid Cutter Path Generation for 2.5D Milling Operation." In ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/detc2002/cie-34490.

Full text

Abstract:

2.5D milling operation is widely used in a variety of applications. Generating efficient cutter path for 2.5D milling operation is very important in order to shorten total machining time and thus enhance overall throughput. However, most existing cutter path generation algorithms do not produce highly efficient cutter paths for certain type of complex pockets. The reason behind this is as following. For different types of pocket geometries, different types of cutter paths have been shown to be efficient. However, in certain types of complex pockets, no single type of cutter path produces efficient path throughout the pocket. Hybrid cutter paths, where different portions of the complex pocket have different types of paths, appear to be promising idea for generating efficient cutter path. However, currently only limited work has been devoted to generating hybrid cutter paths automatically. In this paper, we systematically analyze different cutter path generation strategies, and discuss several existing heuristics. Based on our observations, we propose two algorithms for generating hybrid cutter path, i.e., a greedy algorithm using heuristics and a branch and bound search algorithm, which can find efficient hybrid cutter path for complex parts.

APA, Harvard, Vancouver, ISO, and other styles

2

Sudkamp, Thomas, Carl Lizza, and Charles Wagner. "Hierarchic Path Generation." In 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, edited by Mohan M. Trivedi. SPIE, 1988. http://dx.doi.org/10.1117/12.947005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tan, Charlie Irawan, and Wen-Kai Tai. "Path stitching: Controllable racing path generation." In 2009 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2009. http://dx.doi.org/10.1109/icmlc.2009.5212595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Farhang, K., A. Midha, and A. S. Hall. "Synthesis of Harmonic Motion Generating Linkages: Part II — Path and Motion Generation." In ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0112.

Full text

Abstract:

Abstract This paper, a sequel to a companion paper on function generation, discusses the path and motion generation problems in the synthesis of linages with relatively small input cranks. The point on the floating link (i.e., the coupler of a crank-rocker linkage point on connecting rod in a slider-crank linkage) traces an approximate ellipse. This fact serves as a major distinction between the method described herein and the conventional, more general, synthesis techniques. In other words, only elliptical paths may be generated by the path (or coupler) points in the synthesis of linkages with small cranks. Higher order path and motion generation, in which velocity, acceleration, slope and the rate of change of slope of the coupler path may be specified, are also addressed in this paper.

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Meirui, Rongming Zhu, and Xueguang Yang. "UAV Path Generation, Path Following and Gimbal Control." In 2008 IEEE International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2008. http://dx.doi.org/10.1109/icnsc.2008.4525338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Guo, Guannan, Tsung-Wei Huang, Yibo Lin, and Martin Wong. "GPU-accelerated Critical Path Generation with Path Constraints." In 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD). IEEE, 2021. http://dx.doi.org/10.1109/iccad51958.2021.9643504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

McCloskey, Thomas. "Troubleshooting Turbine Steam Path Damage." In 2002 International Joint Power Generation Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/ijpgc2002-26108.

Full text

Abstract:

Steam path damage, particularly of rotating and stationary blading, has long been recognized as a leading cause of steam turbine unavailability for large fossil fuel plants worldwide. Turbine problems cost the utility industry as much as one billion dollars per year. Failures of blades, discs, and rotors in both fossil and nuclear steam turbines, represent a serious economic loss of availability and reliability for electric power generation suppliers and other energy supplies worldwide. Turbine problems such as deposition and erosion of blades can result in severe efficiency losses, resulting in significant economic penalties. The primary objective of this paper is to provide a methodology to identify the underlying damage or failure mechanisms, determine the root cause, and choosing immediate and long-term actions to lessen or prevent recurence of the problem.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Dongdong, Pinghai Yang, and Xiaoping Qian. "Adaptive NC Path Generation From Massive Point Data With Bounded Error." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49626.

Full text

Abstract:

This paper presents an approach for generating curvature-adaptive finishing tool paths with bounded error directly from massive point data in three-axis CNC milling. This approach uses the Moving Least Squares (MLS) surface as the underlying surface representation. A closed-form formula for normal curvature computing is derived from the implicit form of MLS surfaces. It enables the generation of curvature-adaptive tool paths from massive point data that is critical for balancing the trade-off between machining accuracy and speed. To ensure the path accuracy and robustness for arbitrary surfaces where there might be abrupt curvature change, a novel guidance field algorithm is introduced. It overcomes potential excessive locality of curvature-adaptive paths by examining the neighboring points’ curvature within a self-updating search bound. Our results affirm that the combination of curvature-adaptive path generation and the guidance field algorithm produces high-quality NC paths from a variety of point cloud data with bounded error.

APA, Harvard, Vancouver, ISO, and other styles

9

Dong, Yu, Dingding Wang, Niki Pissinou, and Jian Wang. "Multi-Path Load Balancing in Transport Layer." In 2007 Next Generation Internet Networks. IEEE, 2007. http://dx.doi.org/10.1109/ngi.2007.371208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Jau-Liang, and Joseph Duffy. "Path Generation for Two Cooperative Puma Robots." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0215.

Full text

Abstract:

Abstract This paper describes the development of generating collision-free paths for a pair of cooperative PUMA robots as their end effectors grasp a workpiece in an obstacle-strewn environment. After the initial and goal positions of the wrist center are specified, a collision-free path for this pair of manipulators to move the workpiece safely to the final destination is generated. The algorithm is demonstrated via computer graphics animation on a Silicon Graphics IRIS 4D/70GT workstation.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Path generation"

1

Shin, Dong H., and Sanjiv Singh. Path Generation for Robot Vehicles Using Composite Clothoid Segments. Fort Belvoir, VA: Defense Technical Information Center, December 1990. http://dx.doi.org/10.21236/ada232947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

John Collins. Next Generation Nuclear Plant Project Technology Development Roadmaps: The Technical Path Forward. Office of Scientific and Technical Information (OSTI), January 2009. http://dx.doi.org/10.2172/948587.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kwok, K. S., C. S. Loucks, and B. J. Driessen. General application of rapid 3-D digitizing and tool path generation for complex shapes. Office of Scientific and Technical Information (OSTI), September 1997. http://dx.doi.org/10.2172/532613.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

John Collins. Next Generation Nuclear Plant Project Technology Development Roadmaps: The Technical Path Forward for 750?800?C Reactor Outlet Temperature. Office of Scientific and Technical Information (OSTI), August 2009. http://dx.doi.org/10.2172/963739.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Denholm, Paul, Kara Clark, and Matt O'Connell. On the Path to SunShot. Emerging Issues and Challenges in Integrating High Levels of Solar into the Electrical Generation and Transmission System. Office of Scientific and Technical Information (OSTI), May 2016. http://dx.doi.org/10.2172/1253978.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Denholm, Paul, Kara Clark, and Matt O'Connell. On the Path to SunShot - Emerging Issues and Challenges in Integrating High Levels of Solar into the Electrical Generation and Transmission System. Office of Scientific and Technical Information (OSTI), May 2016. http://dx.doi.org/10.2172/1344204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mills, Patrick Ford. On the Path to Energy Independence and a Clean Power Future – LED Lighting Retrofit and Solar Power Generation for the CTUIR Science and Engineering Laboratory and Public Transit Center. Office of Scientific and Technical Information (OSTI), September 2019. http://dx.doi.org/10.2172/1562684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hertel, Thomas, Jevgenijs Steinbuks, and Uris Lantz Baldos. Competition for Land in the Global Bioeconomy. GTAP Working Paper, September 2012. http://dx.doi.org/10.21642/gtap.wp68.

Full text

Abstract:

The global land use implications of biofuel expansion have received considerable attention in the literature over the past decade. Model-based estimates of the emissions from cropland expansion have been used to assess the environmental impacts of biofuel policies. And integrated assessment models have estimated the potential for biofuels to contribute to greenhouse gas abatement over the coming century. All of these studies feature, explicitly or implicitly, competition between biofuel feed stocks and other land uses. However, the economic mechanisms governing this competition, as well as the contribution of biofuels to global land use change, have not received the close scrutiny that they deserve. The purpose of this paper is to offer a deeper look at these factors. We begin with a comparative static analysis which assesses the impact of exogenously specified forecasts of biofuel expansion over the 2006-2035 period. Global land use change is decomposed according to the three key margins of economic response: extensive supply, intensive supply, and demand. Under the International Energy Agency’s “New Policies” scenario, biofuels account for nearly one-fifth of global land use change over the 2006-2035 period. The paper also offers a comparative dynamic analysis which determines the optimal path for first and second generation biofuels over the course of the entire 21st century. In the absence of GHG regulation, the welfare-maximizing path for global land use allocates 170 Mha to biofuel feed stocks by 2100, with the associated biofuels accounting for about 30% of global liquid fuel consumption. This area expansion is somewhat diminished by expected climate change impacts on agriculture, while it is significantly increased by a moderately aggressive GHG emissions target and by advances in conversion efficiency of second generation biofuels.

APA, Harvard, Vancouver, ISO, and other styles

9

Linares, Pedro, Natalia Collado-Van-Baumberghen, and Jorge Galindo. The European electricity market reform: an assessment & next steps. Esade EcPol, January 2024. http://dx.doi.org/10.56269/20240115/pl.

Full text

Abstract:

The motivation behind the reform of the European electricity markets is therefore to create new incentives for the construction of generation capacity that will enable a more decisive move towards decarbonisation, while providing greater flexibility (both in terms of supply and demand) that can lead to greater price stability. However, although these goals are shared by all countries, the path towards them is not uniform at the outset due to the different energy and consumption mixes (industry and households). As a result, the outcome is far from the same and, in its current form,the reform of the European electricity market falls short in several important aspects. However, this reform should be seen as a first step, a process of reflection that creates the basis for further development. The ultimate goal should be the creation of a harmonised and long-term focused European electricity market.

APA, Harvard, Vancouver, ISO, and other styles

10

Ennasr, Osama, Charles Ellison, Anton Netchaev, Ahmet Soylemezoglu, and Garry Glaspell. Unmanned ground vehicle (UGV) path planning in 2.5D and 3D. Engineer Research and Development Center (U.S.), August 2023. http://dx.doi.org/10.21079/11681/47459.

Full text

Abstract:

Herein, we explored path planning in 2.5D and 3D for unmanned ground vehicle (UGV) applications. For real-time 2.5D navigation, we investigated generating 2.5D occupancy grids using either elevation or traversability to determine path costs. Compared to elevation, traversability, which used a layered approach generated from surface normals, was more robust for the tested environments. A layered approached was also used for 3D path planning. While it was possible to use the 3D approach in real time, the time required to generate 3D meshes meant that the only way to effectively path plan was to use a preexisting point cloud environment. As a result, we explored generating 3D meshes from a variety of sources, including handheld sensors, UGVs, UAVs, and aerial lidar.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!